Decentralized human tracking in visual sensor networks: using sparse representation for efficient communication

Warning The system is temporarily closed to updates for reporting purpose.

Coşar, Serhan and Çetin, Müjdat (2014) Decentralized human tracking in visual sensor networks: using sparse representation for efficient communication. In: Spagnolo, Paolo and Mazzeo, Pier Luigi and Distante, Cosimo, (eds.) Human Behavior Understanding in Networked Sensing: Theory and Applications of Networks of Sensors. Springer, New York, pp. 45-73. ISBN 978-3-319-10806-3 (Print) 978-3-319-10807-0 (Online)

[img]PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1007/978-3-319-10807-0_3


The recent advances in camera sensors and development of new distributed processing algorithms have enabled a new kind of wireless sensor networks namely the visual sensor networks (VSNs). VSNs consist of a network of image sensors, embedded processors, and wireless transceivers which are powered by batteries. The constraints on energy and bandwidth resources challenge setting up a tracking system in VSNs. In this chapter, we present a sparsity-driven decentralized framework for multi-camera human tracking in VSNs. The traditional centralized approaches involve sending compressed images to a central processing unit, which, in the case of severe bandwidth constraints, can hurt the performance of further processing (i.e., tracking) because of low-quality images. Instead, we propose a decentralized tracking framework in which each camera node performs feature extraction and obtains likelihood functions. We propose a sparsity-driven method that can obtain bandwidth-efficient representation of likelihoods. Our approach involves the design of special overscomplete dictionaries that match the structure of the likelihoods and the transmission of likelihood information in the network through sparse representation in such dictionaries. By exploiting information from the sparse representation obtained in the previous frame, we spatially constrain the set of allowed dictionary coefficients in the current frame to reduce the size of the optimization problem and hence, the computation time. Experimental results show that our sparse representation framework is an effective approach that can be used together with any probabilistic tracker and that can provide major savings in communication bandwidth without significant degradation in tracking performance.

Item Type:Book Section / Chapter
Subjects:T Technology > TK Electrical engineering. Electronics Nuclear engineering
ID Code:25645
Deposited By:Müjdat Çetin
Deposited On:19 Dec 2014 15:24
Last Modified:02 Aug 2019 14:53

Repository Staff Only: item control page