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
A survey of image registration techniques
ACM Computing Surveys (CSUR)
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hierarchical Procrustes Matching for Shape Retrieval
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
A Statistics-Based Approach to Binary Image Registration with Uncertainty Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
A new method for affine registration of images and point sets
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Video orbits of the projective group a simple approach to featureless estimation of parameters
IEEE Transactions on Image Processing
A unifying framework for correspondence-less linear shape alignment
ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I
Hi-index | 0.00 |
We consider the estimation of 2D affine transformations aligning a known binary shape and its distorted observation. The classical way to solve this registration problem is to find correspondences between the two images and then compute the transformation parameters from these landmarks. In this paper, we propose a novel approach where the exact transformation is obtained as a least-squares solution of a linear system. The basic idea is to fit a Gaussian density to the shapes which preserves the effect of the unknown transformation. It can also be regarded as a consistent coloring of the shapes yielding two rich functions defined over the two shapes to be matched. The advantage of the proposed solution is that it is fast, easy to implement, works without established correspondences and provides a unique and exact solution regardless of the magnitude of transformation.