Approximate techniques in solving optimal camera placement problems

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

Producción científica: Conference contributionrevisión exhaustiva

21 Citas (Scopus)

Resumen

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.

Idioma originalEnglish
Título de la publicación alojada2011 IEEE International Conference on Computer Vision Workshops, ICCV Workshops 2011
Páginas1705-1712
Número de páginas8
DOI
EstadoPublished - 2011
Evento13th IEEE International Conference on Computer Vision Workshops, ICCVW 2011 - Barcelona, Spain
Duración: nov 6 2011nov 13 2011

Serie de la publicación

NombreProceedings of the IEEE International Conference on Computer Vision
ISSN (versión impresa)1550-5499
ISSN (versión digital)2380-7504

Conference

Conference13th IEEE International Conference on Computer Vision Workshops, ICCVW 2011
País/TerritorioSpain
CiudadBarcelona
Período11/6/1111/13/11

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition

Huella

Profundice en los temas de investigación de 'Approximate techniques in solving optimal camera placement problems'. En conjunto forman una huella única.

Citar esto