Active Search for Real-Time Vision

• Authors: Andrew J. Davison
• Venue: ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
• Year: 2005

In most cases when information is to be extracted from an image, there are priors available on the state of the world and therefore on the detailed measurements which will be obtained. While such priors are commonly combined with the actual measurements via Bayes驴 rule to calculate posterior probability distributions on model parameters, their additional value in guiding efficient image processing has almost always been overlooked. Priors tell us where to look for information in an image, how much computational effort we can expect to expend to extract it, and of how much utility to the task in hand it is likely to be. Such considerations are of importance in all practical real-time vision systems, where the processing resources available at each frame in a sequence are strictly limited 驴 and it is exactly in high frame-rate real-time systems such as trackers where strong priors are most likely to be available. In this paper, we use Shannon information theory to analyse the fundamental value of measurements using mutual information scores in absolute units of bits, specifically looking at the overwhelming case where uncertainty can be characterised by Gaussian probability distributions. We then compare these measurement values with the computational cost of the image processing required to obtain them. This theory puts on a firm footing for the first time principles of 驴active search驴 for efficient guided image processing, in which candidate features of possibly different types can be compared and selected automatically for measurement.