Anytime similarity measures for faster alignment

摘要

Image alignment refers to finding the best transformation from a fixed reference image to a new image of a scene. This process is often optimizing a similarity measure between images, computed based on the image data. However, in time-critical applications state-of-the-art methods for computing similarity are too slow. Instead of using all the image data to compute similarity, one could use only a subset of pixels to improve the speed, but often this comes at the cost of reduced accuracy. These kinds of tradeoffs between the amount of computation and the accuracy of the result have been addressed in the field of real-time artificial intelligence as deliberation control problems. We propose that the optimization of a similarity measure is a natural application domain for deliberation control using the anytime algorithm framework. In this paper, we present anytime versions for the computation of two common image similarity measures: mean squared difference and mutual information. Off-line, we learn a performance profile specific to each measure, which is then used on-line to select the appropriate amount of pixels to process at each optimization step. When tested against existing techniques, our method achieves comparable quality and robustness with significantly less computation.