{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T23:00:56Z","timestamp":1763766056827,"version":"3.37.3"},"reference-count":41,"publisher":"SAGE Publications","issue":"11","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2013,11,1]]},"abstract":"<jats:p> While the theoretical foundation of the optimal camera placement problem has been studied for decades, its practical implementation has recently attracted significant research interest due to the increasing popularity of visual sensor networks. The most flexible formulation of finding the optimal camera placement is based on a binary integer programming (BIP) problem. Despite the flexibility, most of the resulting BIP problems are NP-hard and any such formulations of reasonable size are not amenable to exact solutions. There exists a myriad of approximate algorithms for BIP problems, but their applications, efficiency, and scalability in solving camera placement are poorly understood. Thus, we develop a comprehensive framework in comparing the merits of a wide variety of approximate algorithms in solving the optimal camera placement problems. We first present a general approach of adapting these problems into BIP formulations. Then, we demonstrate how they can be solved using different approximate algorithms including greedy heuristics, Markov-chain Monte Carlo, simulated annealing, and linear and semidefinite programming relaxations. 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. <\/jats:p>","DOI":"10.1155\/2013\/241913","type":"journal-article","created":{"date-parts":[[2013,11,28]],"date-time":"2013-11-28T21:01:29Z","timestamp":1385672489000},"page":"241913","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":46,"title":["Approximate Techniques in Solving Optimal Camera Placement Problems"],"prefix":"10.1177","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5465-1253","authenticated-orcid":false,"given":"Jian","family":"Zhao","sequence":"first","affiliation":[{"name":"Microsoft Corp, One Microsoft Way, Redmond, WA 98052, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0995-2553","authenticated-orcid":false,"given":"Ruriko","family":"Yoshida","sequence":"additional","affiliation":[{"name":"Department of Statistics, University of Kentucky, Lexington, KY 40536, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sen-ching Samson","family":"Cheung","sequence":"additional","affiliation":[{"name":"Center for Visualization and Virtual Environments, University of Kentucky, 329 Rose Street, Lexington, KY 40506, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Haws","sequence":"additional","affiliation":[{"name":"Thomas J. Watson Research Center, Yorktown Heights, NY 10598, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2013,11,28]]},"reference":[{"first-page":"111","volume-title":"Proceedings of the 4th ACM International Workshop on Video Surveillance and Sensor Networks (VSSN '06)","author":"Horster E.","key":"B17-2013-241913"},{"key":"B3-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1146711"},{"key":"B9-2013-241913","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2006.06.005"},{"key":"B16-2013-241913","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-007-0046-5"},{"key":"B41-2013-241913","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-374633-7.00008-2"},{"key":"B14-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152761"},{"key":"B36-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2017507"},{"key":"B8-2013-241913","doi-asserted-by":"publisher","DOI":"10.1007\/11776178_24"},{"key":"B42-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2011.6130455"},{"volume-title":"Art Gallery Theorems and Algorithms","year":"1987","author":"O'Rourke J.","key":"B25-2013-241913"},{"volume-title":"Art Gallery and Illumination Problems","year":"1997","author":"Urrutia J.","key":"B30-2013-241913"},{"key":"B28-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/5.163407"},{"key":"B5-2013-241913","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(75)90061-1"},{"key":"B20-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057165"},{"volume-title":"Proceedings of the 1st Workshop on Broadband Advanced Sensor Networks (BASENETS '04)","author":"Yang D.","key":"B35-2013-241913"},{"first-page":"273","volume-title":"Proceedings of the Vision Modeling and Visualization Conference (VMV '01)","author":"Vazquez P.","key":"B31-2013-241913"},{"key":"B33-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/HAVE.2006.283777"},{"key":"B2-2013-241913","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-007-9164-7"},{"key":"B24-2013-241913","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0057-9"},{"key":"B39-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2009.5117711"},{"key":"B40-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2008.2001430"},{"key":"B38-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2009.5457476"},{"volume-title":"Model Building in Mathematical Programming","year":"1999","author":"Williams H. P.","key":"B32-2013-241913"},{"key":"B26-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/WiMob.2008.88"},{"key":"B23-2013-241913","doi-asserted-by":"publisher","DOI":"10.1145\/1865987.1866003"},{"key":"B37-2013-241913","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSC.2007.4357532"},{"key":"B7-2013-241913","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","edition":"2"},{"key":"B10-2013-241913","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"B12-2013-241913","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.002"},{"key":"B34-2013-241913","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459562"},{"key":"B29-2013-241913","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00182-8"},{"key":"B4-2013-241913","doi-asserted-by":"publisher","DOI":"10.1145\/1542362.1542421"},{"volume-title":"Monte Carlo Strategies in Scientific Computing","year":"2008","author":"Liu J. S.","key":"B21-2013-241913"},{"volume-title":"Understanding and Using Linear Programming","year":"2007","author":"G\u00e4rtner B.","key":"B13-2013-241913"},{"key":"B22-2013-241913","doi-asserted-by":"publisher","DOI":"10.1137\/0801013"},{"key":"B27-2013-241913","doi-asserted-by":"publisher","DOI":"10.1137\/0403036"},{"key":"B18-2013-241913","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45535-3_23"},{"key":"B19-2013-241913","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.3.470.16391"},{"key":"B1-2013-241913","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-008-0001-1"},{"volume-title":"CVX: Matlab Software for Disciplined Convex Programming, Version 1.21","year":"2011","author":"Grant M.","key":"B15-2013-241913"},{"key":"B6-2013-241913","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2013\/241913","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/full-xml\/10.1155\/2013\/241913","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2013\/241913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,16]],"date-time":"2021-05-16T21:22:56Z","timestamp":1621200176000},"score":1,"resource":{"primary":{"URL":"http:\/\/journals.sagepub.com\/doi\/10.1155\/2013\/241913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,1]]},"references-count":41,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2013,11,1]]}},"alternative-id":["10.1155\/2013\/241913"],"URL":"https:\/\/doi.org\/10.1155\/2013\/241913","relation":{},"ISSN":["1550-1477","1550-1477"],"issn-type":[{"type":"print","value":"1550-1477"},{"type":"electronic","value":"1550-1477"}],"subject":[],"published":{"date-parts":[[2013,11,1]]}}}