Abstract
Correlation algorithms based on pixel gray value are very popular and widely used in image template matching. However, these algorithms have high time complexity and are sensitive to the variation of image luminance and scale. To avoid that, a new algorithm based on coding image grey value is proposed. This algorithm divides the image into certain size blocks called R-block, sums the gray value of each R-block pixel, and codes the R-block according to the sorting result among the neighborhood of R-blocks. Image and template are matched by comparing their R-block coding. The R-block is very rapidly and easily coded and only equality comparison is needed. The new algorithm is robust to the linear transformation of pixel grey value and image noise. Its time complexity is reduced to O(M 2 log(N)), or namely is improved two order of magnitude in contrast to the current
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.
