Abstract

Establishing correspondence between features of a set of im- ages has been a long-standing issue amongst the computer vision commu- nity. We propose a method that solves the multi-frame correspondence problem by imposing a rank constraint on the observed scene, i.e. rigidity is assumed. Since our algorithm is based solely on a geometrical (global) criterion, it does not su?er from issues usually associated to local meth- ods, such as the aperture problem. We model feature matching by introducing the assignment tensor, which allows simultaneous feature alignment for al l images, thus pro- viding a coherent solution to the calibrated multi-frame correspondence problem in a single step of linear complexity. Also, an iterative method is presented that is able to cope with the non-calibrated case. Moreover, our method is able to seamlessly reject a large number of outliers in every image, thus also handling occlusion in an integrated manner.