Abstract
In this paper, 2D affine registration problem was studied. First, combining with the procedure of traditional iterative closest point method, the registration problem was modeled as an optimization problem on Lie group $$GL(2,{\mathfrak{R}})$$. To assure the registration non-degenerate, some reasonable constraints were introduced into the model by Iwasawa decomposition. Then, a series of quadratic programming were used to approximate the registration problem and a novel affine registration algorithm was proposed. At last, several illustration and comparison experiments were presented to demonstrate the performance and efficiency of the proposed algorithm. Particularly, a way of selecting a good initial registration based on ICA method to achieve the global minimum was suggested.
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.
