By Topic

Saccades planning with kinetic TSP for distant targets identification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. D. Bimbo ; Dipt. di Sistemi e Informatica, Univ. di Firenze, Italy ; F. Pernici

This paper considers the problem of designing an active observer to plan a sequence of decisions regarding what target to look at, through a foveal-sensing action. We propose a framework in which a pan/tilt/zoom camera schedules saccades in order to acquire high resolution images (at least one) of as many moving targets as possible before they leaving the scene. An intelligent choice of the order of sensing the targets can significantly reduce the total dead-time waste by the active camera and, consequently, its cycle time. We cast the whole problem as a particular kind of discrete optimization. In particular we will show that the problem can be solved by modeling the attentional gaze control with a novel form of kinetic traveling salesperson problem (KTSP), reformulated as a time dependent orienteering (TDO) problem.

Published in:

Imaging for Crime Detection and Prevention, 2005. ICDP 2005. The IEE International Symposium on

Date of Conference:

7-8 June 2005