DocumentCode
3519075
Title
Constraints-based graph embedding optimal surveillance-video mosaicing
Author
Hu, Feng ; Li, Tuotuo ; Geng, Zheng
Author_Institution
Inst. of Autom., Beijing, China
fYear
2011
fDate
28-28 Nov. 2011
Firstpage
311
Lastpage
315
Abstract
One single surveillance camera usually possesses a local view point, making it incapable of monitoring the whole scene. Even utilizing a pan, tilt, zoom (PTZ) platform, the captured frames are inconvenient for observation due to its discretion in presenting the global area. In this paper, we focus on the video mosaicing problem in surveillance environment, to provide a convenient and accurate panorama of the global site being monitored. Based on the specific requirements in surveillance environment, three constraints are proposed for video mosaicing, which include temporal constraint, spatial constraint and similarity constraint. Furthermore, we cast the problem of video mosaicing into the framework of graph embedding, and solve the optimum mosaic by finding the optimal path in the graph with Dijkstra method. Experiments from both outdoor and indoor applications demonstrate the advantage of our method over previous ones, and show that our method is very adaptable in surveillance applications.
Keywords
graph theory; video signal processing; video surveillance; Dijkstra method; constraints-based graph; graph embedding; local view point; optimal surveillance; pan, tilt, zoom platform; similarity constraint; spatial constraint; surveillance camera; temporal constraint; video mosaicing problem; Cameras; Computer vision; Lighting; Streaming media; Strips; Surveillance; PTZ camera; video mosaicing; video surveillance;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition (ACPR), 2011 First Asian Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4577-0122-1
Type
conf
DOI
10.1109/ACPR.2011.6166643
Filename
6166643
Link To Document