Abstract
Template Matching (TM) techniques are widely used for recognition and location of objects in image and signal processing applications. The existing techniques such as cross, zero and normalised cross-correlations for TM are time consuming. This paper proposes parallel algorithms for TM problems using Normalised Cross Correlation and Particle Swarm Optimisation (PSO) to suit real-time applications. Experimental results show that parallel version of PSO is comparatively efficient.
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 callMore From: International Journal of Parallel, Emergent and Distributed Systems
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.
