A subspace approach for matching 2D shapes under affine distortions

This paper presents a subspace approach to matching a pair of 2D shapes, and estimating the affine transformation that aligns the two 2D shapes. In the proposed method, by considering each shape as a 2D signal, one shape is projected onto the subspace spanned by the other, and the affine transformat...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition 2011-02, Vol.44 (2), p.210-221
Main Authors: Mai, F., Chang, C.Q., Hung, Y.S.
Format: Article
Language:English
Subjects:
2D shape
Accuracy
Affine transformation
Affine transformations
Applied sciences
Computation
Exact sciences and technology
Information, signal and communications theory
Matching
Noise
Pattern recognition
Shape registration
Signal processing
Subspace
Subspaces
Telecommunications and information theory
Two dimensional
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a subspace approach to matching a pair of 2D shapes, and estimating the affine transformation that aligns the two 2D shapes. In the proposed method, by considering each shape as a 2D signal, one shape is projected onto the subspace spanned by the other, and the affine transformation is estimated by minimizing the projection error in the subspace. The proposed method is fast, easy to implement, and with a clear physical interpretation. Furthermore, it is robust to noise due to the merit of the subspace method. The proposed approach has been tested for registration accuracy, computation time, and robustness to noise. Its performance on synthetic and real images is compared with the state-of-the-art reference algorithms. The experimental results show that our approach compares favorably to the reference methods, in terms of registration accuracy, computation speed, and robustness.
ISSN:0031-3203
1873-5142
DOI:10.1016/j.patcog.2010.08.032