Efficient parallel algorithms for image template matching on hypercube SIMD machines

K.V.K Prasanna,V Krishnan

doi:10.1109/34.24802

Efficient parallel algorithms for image template matching on hypercube SIMD machines

K.V.K Prasanna, V Krishnan

https://doi.org/10.1109/34.24802

Copy DOI

Journal: IEEE Transactions on Pattern Analysis and Machine Intelligence	Publication Date: Jun 1, 1989
Citations: 15

Affiliation: University of Southern California, Engineering Systems (United States)

#Single-instruction Multiple Data-stream #Parallel Algorithms + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

Efficient parallel algorithms developed on hypercube SIMD (single-instruction multiple data-stream) machines for image template matching are presented. Most of these parallel algorithms are asymptotically optimal in their time complexities. These results improve the known bounds in the literature.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

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

Similar Papers

Paper Title

Journal

Date

Author

More From: IEEE Transactions on Pattern Analysis and Machine Intelligence

Paper Title

Journal

Date

Author

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.