Abstract

Image matching is a very important area of image processing. This paper presents a fast matching algorithm for image matching, based on square-block. In this novel algorithm for matching, first template is divided into certain sub templates called D-block, then eigen value of every sub template is calculated and the optimal one is chosen according to certain principle, and finally the best matching position for reference image is determined by adopting interlaced scanning during image matching processing. Experimental results show that the proposed algorithm is superior to the regular algorithm and has low computational complexity.

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.