Referenced Items are not available for this document.
This paper presents a new affine-invariant matching algorithm based on B-spline modeling, which solves the problem of the nonuniqueness of B-spline in curve matching. This method first smoothes the B-spline curve by increasing the degree of the curve. It is followed by a reduction of the curve degree using the least square error (LSE) approach to construct the curvature scale space (CSS) image. CSS matching is then carried out. Our method combines the advantages of B-spline that are continuous curve representation and the robustness of CSS matching with respect to noise and affine transformation. It avoids the need for other matching algorithms that have to use the resampled points on the curve. Thus, the curve matching error is reduced. The proposed algorithm has been tested by matching similar shapes from a prototype database. The experimental results showed the robustness and accuracy of the proposed method in B-spline curve matching.
Published in:
Pattern Analysis and Machine Intelligence, IEEE Transactions on
(Volume:29
,
Issue:
10
)
Date of Publication: Oct. 2007
- Page(s):
- 1853 - 1858
- ISSN :
- 0162-8828
- INSPEC Accession Number:
- 9628076
- Digital Object Identifier :
- 10.1109/TPAMI.2007.1135
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 27 August 2007
- Issue Date :
- Oct. 2007
- Sponsored by :
- IEEE Computer Society
- PubMed ID :
- 17699928
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
