Feature-based correspondence: an eigenvector approach
Image and Vision Computing - Special issue: BMVC 1991
Modal Matching for Correspondence and Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Global Solution to Sparse Correspondence Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
SoftPOSIT: Simultaneous Pose and Correspondence Determination
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
The Softassign Procrustes Matching Algorithm
IPMI '97 Proceedings of the 15th International Conference on Information Processing in Medical Imaging
Multiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision
Hi-index | 0.00 |
Feature matching and pose estimation are two crucial tasks in computer vision. The widely adopted scheme is first find the correct matches then estimate the transformation parameters. Unfortunately, such simple scheme does not work well sometimes, because these two tasks of matching and estimation are mutually interlocked. This paper proposes a new method that is able to estimate the transformation and find the correct matches simultaneously. The above interlock is disentangled by an alternating Newton iteration method. We formulate the problem as a nearest-matrix problem, and provide a different numerical technique. Experiments on both synthetic and real images gave good results. Fast global convergence was obtained without the need of good initial guess.