Abstract: seamless mobility is a requirement for MAUC and quite lots of work is already involved [6-18]. To achieve seamlessness of mobility in a multi-relay MAUC topography, quite a lot of back-end work must be carried out for proactively enabling potential “next-relays” and cause resource reservations. It is important to know trends of CBRs which will need exactly 1 relay, 2 relays, 3 relays….in the environment for policy formulations and improvement in resource management. This has been carried out in a previous paper [5] where trends for need of exact relay numbers have been detailed. However, it may be more useful to consider the trends for number of CBRs requiring more than 1 relay, more/less than 2 relays, more/less than 3 relays,….for more appropriate formulation of policies. From a designer/programmer’s point of view, it may be easier to consider rightly that a CBR may need for example more than 5 relays or less than 8 relays rather than exactly 6 relays. This paper is therefore a direc

• Publication Date: 21-Dec-2014
• DOI: 10.15224/978-1-63248-034-7-41
• Views: 0
• Downloads: 0

Abstract: The object tracking algorithms based on men shift are good and efficient. But they have limitations like inaccuracy of target localization and sometimes complete tracking failure. These difficulties arises because of the fact that in basic kernel based mean shift tracking algorithm, the centroid is not always at the center of the target and the size of tracking window remains constant even if there is a major change in the size of object. It causes introduction of large number of background pixels in the object model which give localization errors or complete tracking failure. One more limitation of basic mean shift tracking algorithm is that it does not have an adaptive stop threshold in searching the target procedure. So even at times it gives proper target localization the computation time is much more. To deal with these challenges a new robust mean shift object tracking algorithm with improved tracking velocity and least localization errors is proposed in this paper. This approach

• Publication Date: 21-Dec-2014
• DOI: 10.15224/978-1-63248-034-7-42
• Views: 0
• Downloads: 0