Abstract

We present an image alignment algorithm based on the matching of relative gradient maps between images. This algorithm consists of two stages; namely, a learning-based approximate pattern search and an iterative energy-minimization procedure for matching relative image gradient. The first stage finds some candidate poses of the pattern in the image through a fast search of the best match of the relative gradient features from the database of training feature vectors. The training database is obtained from the synthesis of the template image under a number of uniform samplings in a range of the geometric transformation space. Subsequently, the approximate candidate poses are further verified and refined by matching the relative gradient images through an iterative energy-minimization procedure. This approach based on the matching of relative gradients has the advantage of robustness against inhomogeneous illumination variations. Some experimental results are shown to demonstrate the efficiency and robustness of the proposed algorithm.

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 call

Disclaimer: 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.