Higher-Dimensional Affine Registration and Vision Applications

—Affine registration has a long and venerable history in computer vision literature, and in particular, extensive work has been done for affine registration in IR2 and IR3 . This paper studies affine registration in IRm with m typically ranging from 4 to 12. To justify breaking of this dimension barrier, the first part of the paper describes three novel matching problems that can be formulated and solved as affine point-set registration problems in dimensions greater than three: stereo correspondence under motion, image set matching, and covariant point-set matching, problems that are not only interesting in their own right but also have potential for important vision applications. Unfortunately, most of the existing affine registration algorithms do not generalize easily to higher dimensions due to their inefficiency. Therefore, the second part of this paper develops a novel algorithm for estimating the affine transform between two point sets in IRm . Specifically, the algorithm fol...

• Type: Journal
• Year: 2011
• Where: PAMI
• Authors: S. M. Nejhum Shahed, Yu-Tseh Chi, Jeffrey Ho, Ming-Hsuan Yang
• Keywords: Computer Networks, Computer Vision Literature, PAMI 2011, Registration Algorithm, Stereo Correspondence