Correspondence problem in image sequence analysis

摘要

An algorithm to address the correspondence problem in image sequence analysis is proposed. The underlying philosophy of this algorithm is reductionist, and is based on the assertion that measurements pertaining to motion that are obtained from the whole image sequence must be very similar to the measurements that are obtained from corresponding portions of the image sequence. The algorithm has been extensively tested on synthesized data as well as on real image sequences. It appears that the assumption underlying the proposed algorithm is quite useful and applicable to a large class of images. The proposed algorithm has a high degree of inherent parallelism, and is thus suited for implementation on parallel machines.