Visual Human Tracking in Wireless Cameras Networks A SURF-Based Approach

Author(s):  
Yi Zhou ◽  
Hichem Snoussi ◽  
Shibao Zheng ◽  
Fethi Smach

In wireless camera networks, the communication load between cameras is a major concern for visual tracking. To save the bandwidth, traditional applications transfer the spatial coordinates under the precondition of camera calibration, which is computationally unreasonable for large and mobile camera networks. In this chapter, we exploit the use of distinctive and fast to compute local features to represent the non-rigid targets. Transmission of feature descriptors between cameras is done without any calibration. Combining the haar-like patterns and relative color information, our local features succeed to re-identify and relocate the target among the distributed cameras. Furthermore, efficient interest point detection and matching scheme are proposed for the visual tracking under real-time constraints.

Author(s):  
Usha Devi Gandhi

The sensing power of traditional camera networks for efficiently addressing the critical tasks in the process of cluster – based target tracking of human, such as measurement integration, inclusion/exclusion in the cluster and cluster head rotation. The Wireless Camera Networks efficiently uses distribution friendly representation and methods in which every node contributes to the computation in each mechanism without the requirement of any prior knowledge of the rest of the nodes. These mechanisms and methods are integrated in two different distributed schemas so that it can be implemented in the same mean time without taking into the consideration of cluster size. Thus, the experimental evaluation shows that the proposed schemes and mechanisms drastically reduce the energy consumption and computational burden with respect to the existing methodology.


2016 ◽  
Vol 16 (10) ◽  
pp. 3875-3886 ◽  
Author(s):  
Yong Wang ◽  
Dianhong Wang ◽  
Xufan Zhang ◽  
Jun Chen ◽  
Yamin Li

2012 ◽  
Vol 263-266 ◽  
pp. 2320-2323 ◽  
Author(s):  
Ying Gao ◽  
Rui Zhao Wang ◽  
Jue Yuan

Based on interest point detection, a feature preserving mesh simplification algorithm is proposed. The Harris operator values of all vertices in the mesh were computed firstly. On the base of Garland’s simplification algorithm, we combine the Harris operator value with quadric error metric and change the order of edge collapsing in the simplification. The experimental results show that the proposed algorithm is effective and feature preserving.


2014 ◽  
pp. 189-209 ◽  
Author(s):  
Kuan-Hui Lee ◽  
Chun-Te Chu ◽  
Younggun Lee ◽  
Zhijun Fang ◽  
Jenq-Neng Hwang

Sign in / Sign up

Export Citation Format

Share Document