Exact Algorithms for Non-Overlapping 2-Frame Problem with Non-Partial Coverage for Networked Robotic Cameras Conference Paper

abstract

• We report our algorithmic development on the 2-frame problem that addresses the need of coordinating two networked robotic pan-tilt-zoom (PTZ) cameras for n, (n > 2), competing rectangular observation requests. We assume the two camera frames have no overlap on their coverage. A request is satisfied only if it is fully covered by a camera frame. The satisfaction level for a given request is quantified by comparing its desirable observation resolution with that of the camera frame which fully covers it. We propose a series of exact algorithms for the solution that maximizes the overall satisfaction. Our algorithms solve the 2-frame problem in O(n2), O(n2m) and O(n3) times for fixed, m discrete and continuous camera resolution levels, respectively. We have implemented all the algorithms and compared them with the existing work. 2010 IEEE.

name of conference

• 2010 IEEE International Conference on Automation Science and Engineering

authors

• Song, Dezhen

published proceedings

• 2010 IEEE International Conference on Automation Science and Engineering

author list (cited authors)

• Xu, Y., Song, D., & Yi, J.

citation count

• 1

complete list of authors

• Xu, Yiliang||Song, Dezhen||Yi, Jingang

publication date

• August 2010

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

Digital Object Identifier (DOI)

• 10.1109/coase.2010.5584770

International Standard Book Number (ISBN) 13

• 9781424454471

start page

• 503

end page

• 508

URL

• http://dx.doi.org/10.1109/coase.2010.5584770