A fast globally optimal algorithm for template matching using low-resolution pruning

DOI10.1109/83.913587MaRDI QIDQ4419892zbMATH OpenOpenAlexWikidataFDO

Authors Mohammad Gharavi-Alkhansari

Publication date 15 October 2003

Published in IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/83.913587

zbMATH Keywords

block matchingexhaustive searchimage searchmotion estimation

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

Recommendations

• scientific article; zbMATH DE number 2062506
• Fast-Match: fast affine template matching
• Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory
• A fast matching algorithm based on image gray value
• Faster image template matching in the sum of the absolute value of differences measure

Cited in

(8)

• Fast-Match: fast affine template matching
• Learning to match: deriving optimal template-matching algorithms from probabilistic image models
• Improved cross-correlation for template matching on the Laplacian pyramid
• Faster image template matching in the sum of the absolute value of differences measure
• Fast algorithm for robust template matching with m-estimators
• A fast matching algorithm based on image gray value
• Fast normalized cross-correlation
• Study on Bhattacharyya coefficients within mean-shift framework and its application

This page was built for publication: A fast globally optimal algorithm for template matching using low-resolution pruning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419892)