Abstract
A novel image registration scheme is devised in view of the weak affine transformation, which is a kind of similarity transformation with anisotropic scales or affine transformation without shearing. Two robust algorithms are proposed to retrieve the registration parameters from the error-prone initial correspondences based on the fast least trimmed squares (Fast-LTS) and the random sample consensus (RANSAC). In terms of several criteria, the algorithms are evaluated on three carefully selected datasets from different sensors and the experimental results demonstrate that the proposed scheme and algorithms perform robustly and accurately. Our findings also indicate that the Fast-LTS-based algorithm is more stable and appropriate for image registration than the RANSAC-based algorithm although the speed is slower.
Sign-in/Register to access full text options 
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.
