This work focuses on the problem of calibrating planar networks of cameras in a distributed fashion. The camera network is modeled by a graph, and along each edge a noisy relative angular measurement is available. The goal is to achieve the absolute orientation of each camera with respect to a fixed external reference frame, in order to be able to perform monitoring and patrolling tasks. The idea is to exploit the cycles in the graph, along which all relative measurements sum to zero, in order to eliminate the noise. We design a distributed algorithm for the cameras to autonomously calibrate and we adopt an asynchronous gossip-like communication protocol. The proposed algorithm is proved to converge, almost surely and in the mean square sense, to the set of angles with zero cycle error. Finally, numerical experiments are presented to compare the performance of the algorithm on different graph topologies.

Asynchronous Distributed Calibration of Camera Networks / Borra, Domenica; Fagnani, Fabio. - ELETTRONICO. - (2013), pp. 754-759. ((Intervento presentato al convegno 2013 European Control Conference (ECC) tenutosi a Zürich, Switzerland nel July 17-19, 2013.

Asynchronous Distributed Calibration of Camera Networks

BORRA, DOMENICA;FAGNANI, FABIO
2013

Abstract

This work focuses on the problem of calibrating planar networks of cameras in a distributed fashion. The camera network is modeled by a graph, and along each edge a noisy relative angular measurement is available. The goal is to achieve the absolute orientation of each camera with respect to a fixed external reference frame, in order to be able to perform monitoring and patrolling tasks. The idea is to exploit the cycles in the graph, along which all relative measurements sum to zero, in order to eliminate the noise. We design a distributed algorithm for the cameras to autonomously calibrate and we adopt an asynchronous gossip-like communication protocol. The proposed algorithm is proved to converge, almost surely and in the mean square sense, to the set of angles with zero cycle error. Finally, numerical experiments are presented to compare the performance of the algorithm on different graph topologies.
File in questo prodotto:
File Dimensione Formato  
ECC2013_1162.pdf

non disponibili

Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 1.18 MB
Formato Adobe PDF
1.18 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2522436
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo