Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2016, Article ID 4801784, 16 pages
http://dx.doi.org/10.1155/2016/4801784
Research Article

Two-Phase Algorithm for Optimal Camera Placement

1College of Business & Economics, Chung-Ang University, 84 Heukseok-ro, Dongjak-gu, Seoul 06974, Republic of Korea
2Department of Industrial & Management Engineering, Kyonggi University, 154-42 Gwanggyosan-ro, Yeongtong-gu, Suwon, Gyeonggi 16227, Republic of Korea
3Department of Business Administration, Hoseo University, 12 Hoseodae-gil, Dongnam-gu, Cheonan-si, Chungcheongnam-do 31066, Republic of Korea

Received 17 May 2016; Accepted 19 July 2016

Academic Editor: Minsoo Kim

Copyright © 2016 Jun-Woo Ahn et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

As markers for visual sensor networks have become larger, interest in the optimal camera placement problem has continued to increase. The most featured solution for the optimal camera placement problem is based on binary integer programming (BIP). Due to the NP-hard characteristic of the optimal camera placement problem, however, it is difficult to find a solution for a complex, real-world problem using BIP. Many approximation algorithms have been developed to solve this problem. In this paper, a two-phase algorithm is proposed as an approximation algorithm based on BIP that can solve the optimal camera placement problem for a placement space larger than in current studies. This study solves the problem in three-dimensional space for a real-world structure.