Visibility Planning: Predicting Continuous Period of Unobstructed Views
| dc.contributor.author | Lim, Ser-Nam | en_US |
| dc.contributor.author | Davis, Larry S. | en_US |
| dc.contributor.author | Wan, Yung-Chun (Justin) | en_US |
| dc.date.accessioned | 2004-05-31T23:37:08Z | |
| dc.date.available | 2004-05-31T23:37:08Z | |
| dc.date.created | 2004-03 | en_US |
| dc.date.issued | 2004-04-19 | en_US |
| dc.description.abstract | To perform surveillance tasks effectively, unobstructed views of objects are required e.g. unobstructed video of objects are often needed for gait recognition. As a result, we need to determine intervals for video collection during which a desired object is visible w.r.t. a given sensor. In addition, these intervals are in the future so that the system can effectively plan and schedule sensors for collecting these videos. We describe an approach to determine these visibility intervals. A Kalman filter is first used to predict the trajectories of the objects. The trajectories are converted to polar coordinate representations w.r.t. a given sensor. Trajectories with the same angular displacement w.r.t. the sensor over time can be found by determining intersection points of functions representing these trajectories. Intervals between these intersection points are suitable for video collection. We also address the efficiency issue of finding these intersection points. An obvious brute force approach of $O(N^2)$ exists, where $N$ is the number of objects. This approach suffices when $N$ is small. When $N$ is large, we introduce an optimal segment intersection algorithm of $O(N\log^2N+I)$, $I$ being the number of intersection points. Finally, we model the prediction errors associated with the Kalman filter using a circular object representation. Experimental results that compare the performance of the brute force and the optimal segment intersection algorithms are shown. (UMIACS-TR-2004-22) | en_US |
| dc.format.extent | 467505 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/1349 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4577 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-2004-22 | en_US |
| dc.title | Visibility Planning: Predicting Continuous Period of Unobstructed Views | en_US |
| dc.type | Technical Report | en_US |