Approximate techniques in solving optimal camera placement problems

Jian Zhao, David Haws, Ruriko Yoshida, Sen Ching Samson Cheung

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations

Abstract

While the theoretical foundation of optimal camera placement has been studied for decades, its practical implementation has recently attracted significant research interest due to the increasing popularity of visual sensor network. The discrete camera placement problem is NP-hard and many approximate solutions have been independently studied. The goal of this paper is to provide a comprehensive framework in comparing the merits of these techniques. We consider two general classes of camera placement problems and adapt some of the most commonly used approximation techniques in solving them. The accuracy, efficiency and scalability of each technique are analyzed and compared in depth. Extensive experimental results are provided to illustrate the strength and weakness of each method.

Original languageEnglish
Title of host publication2011 IEEE International Conference on Computer Vision Workshops, ICCV Workshops 2011
Pages1705-1712
Number of pages8
DOIs
StatePublished - 2011
Event2011 IEEE International Conference on Computer Vision Workshops, ICCV Workshops 2011 - Barcelona, Spain
Duration: Nov 6 2011Nov 13 2011

Publication series

NameProceedings of the IEEE International Conference on Computer Vision

Conference

Conference2011 IEEE International Conference on Computer Vision Workshops, ICCV Workshops 2011
Country/TerritorySpain
CityBarcelona
Period11/6/1111/13/11

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'Approximate techniques in solving optimal camera placement problems'. Together they form a unique fingerprint.

Cite this