Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Algebraic Approach for Recovering Topology in Distributed Camera Networks

Edgar J. Lobaton, Parvez Ahammad and S. Shankar Sastry

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2009-4
January 14, 2009

http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-4.pdf

Camera networks are widely used for tasks such as surveillance, monitoring and tracking. In order to accomplish these tasks, knowledge of localization information such as camera locations and other geometric constraints about the environment (e.g. walls, rooms, and building layout) are typically considered to be essential. However, this information is not always required for many tasks such as estimating the topology of camera network coverage, or coordinate-free object tracking and navigation. In this paper, we propose a simplicial representation (called CN-Complex) that can be constructed from discrete local observations from cameras, and utilize this novel representation to recover the topological information of the network coverage. We prove that our representation captures the correct topological information from network coverage for 2.5D layouts, and demonstrate their utility in simulations as well as a real-world experimental set-up. Our proposed approach is particularly useful in the context of ad-hoc camera networks in indoor/outdoor urban environments with distributed but limited computational power and energy.


BibTeX citation:

@techreport{Lobaton:EECS-2009-4,
    Author = {Lobaton, Edgar J. and Ahammad, Parvez and Sastry, S. Shankar},
    Title = {Algebraic Approach for Recovering Topology in Distributed Camera Networks},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2009},
    Month = {Jan},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-4.html},
    Number = {UCB/EECS-2009-4},
    Abstract = {Camera networks are widely used for tasks such as surveillance, monitoring and tracking. In order to accomplish these tasks, knowledge of localization information such as camera locations and other geometric constraints about the environment (e.g. walls, rooms, and building layout) are typically considered to be essential. However, this information is not always required for many tasks such as estimating the topology of camera network coverage, or coordinate-free object tracking and navigation. In this paper, we propose a simplicial representation (called CN-Complex) that can be constructed from discrete local observations from cameras, and utilize this novel representation to recover the topological information of the network coverage. We prove that our representation captures the correct topological information from network coverage for 2.5D layouts, and demonstrate their utility in simulations as well as a real-world experimental set-up.  Our proposed approach is particularly useful in the context of ad-hoc camera networks in indoor/outdoor urban environments with distributed but limited computational power and energy.}
}

EndNote citation:

%0 Report
%A Lobaton, Edgar J.
%A Ahammad, Parvez
%A Sastry, S. Shankar
%T Algebraic Approach for Recovering Topology in Distributed Camera Networks
%I EECS Department, University of California, Berkeley
%D 2009
%8 January 14
%@ UCB/EECS-2009-4
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-4.html
%F Lobaton:EECS-2009-4