Показать сокращенную информацию

dc.contributor.authorLim, Ser-Namen_US
dc.contributor.authorDavis, Larry S.en_US
dc.contributor.authorWan, Yung-Chun (Justin)en_US
dc.date.accessioned2004-05-31T23:37:08Z
dc.date.available2004-05-31T23:37:08Z
dc.date.created2004-03en_US
dc.date.issued2004-04-19en_US
dc.identifier.urihttp://hdl.handle.net/1903/1349
dc.description.abstractTo 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.extent467505 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4577en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-2004-22en_US
dc.titleVisibility Planning: Predicting Continuous Period of Unobstructed Viewsen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Файлы в этом документе

Thumbnail
Thumbnail

Данный элемент включен в следующие коллекции

Показать сокращенную информацию