A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
IEEE Transactions on Pattern Analysis and Machine Intelligence
Proceedings of the conference on Visualization '01
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Partial and approximate symmetry detection for 3D geometry
ACM SIGGRAPH 2006 Papers
Generalized RANSAC Framework for Relaxed Correspondence Problems
3DPVT '06 Proceedings of the Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)
Feature Correspondence Via Graph Matching: Models and Global Optimization
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part II
Robust feature point matching by preserving local geometric consistency
Computer Vision and Image Understanding
Local feature extraction and matching on range images: 2.5D SIFT
Computer Vision and Image Understanding
ASIFT: A New Framework for Fully Affine Invariant Image Comparison
SIAM Journal on Imaging Sciences
KinectFusion: Real-time dense surface mapping and tracking
ISMAR '11 Proceedings of the 2011 10th IEEE International Symposium on Mixed and Augmented Reality
Transformed polynomials for global registration of point clouds
Proceedings of the 27th Spring Conference on Computer Graphics
| Hi-index | 0.00 |
Given two views of a static scene, estimation of correspondences between them is required for various computer vision tasks, such as 3D reconstruction and registration, motion and structure estimation, and object recognition. Without loss of generality, this paper treats the correspondence-estimation problem in the context of feature-based rangescan registration of widely separated views and presents a novel approach to obtain globally consistent set of correspondences. In this paper, we define the notion of a weak feature, and follow the approach that avoids early commitment to the "best" match. It instead considers multiple candidate matches for each feature, and eventually models and solves correspondence-estimation as an optimization problem viz. weighted bipartite matching. We focus on developing a robust approach that suceeds in the presence of significant noise and sparsity in the input.