Abstract
One basic requirement of image registration is the high precision of point matching. In this paper, we present a simple and robust method to get more accurate matching points by using the structural information of divided triangles. The method initially construct triangles using Delaunay Triangulation which considering rough matched points as vertices, and then iteratively removes outliers until obtain the consensus topology structure. An algorithm called K-Nearest Neighbor Dis-ratio is also presented to avoiding mismatches. Compared with RANSAC and GTM, Our proposed method acquires more inliers and demonstrates higher matching accuracy.
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
