Very fast template matching
From MaRDI portal
Recommendations
Cited in
(18)- Analysis of a steepest-descent image-matching algorithm
- A quadtree algorithm for template matching on a pyramid computer
- Using orientation codes for rotation-invariant template matching.
- Fast-Match: fast affine template matching
- Posterior probability measure for image matching
- Fast Kirsch edge detection based on templates decomposition and integral image
- Learning to match: deriving optimal template-matching algorithms from probabilistic image models
- Improved cross-correlation for template matching on the Laplacian pyramid
- A fast globally optimal algorithm for template matching using low-resolution pruning
- Faster image template matching in the sum of the absolute value of differences measure
- Averaged template matching equations
- Index trees for accelerating deformable template matching
- Statistical Template Matching under Geometric Transformations
- Kernel-based non-linear template matching
- A fast matching algorithm based on image gray value
- Normalized cross-correlation for spherical images
- Fast normalized cross-correlation
- Fast template matching algorithm for contour images based on its chain coded description applied for human face identification
This page was built for publication: Very fast template matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459377)