Fast algorithm for robust template matching with M-estimators

Authors:
Jiun-Hung Chen;Chu-Song Chen;Yong-Sheng Chen
Affiliations:
Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2003

Citing 0
Cited 11

A multimodal approach to time-invariant scene retrieval from single overhead image

Proceedings of the 6th ACM SIGMM international workshop on Multimedia information retrieval
Image Matching with Spatially Variant Contrast and Offset: A Quadratic Programming Approach

SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Noisy time series prediction using M-estimator based robust radial basis function neural networks with growing and pruning techniques

Expert Systems with Applications: An International Journal
Application of Kohonen network for automatic point correspondence in 2D medical images

Computers in Biology and Medicine
A performance study for camera pose estimation using visual marker based tracking

Machine Vision and Applications
M-estimators over separable sets of representative points for template matching

Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Multimodal genetic algorithms-based algorithm for automatic point correspondence

Pattern Recognition
Handling occlusions for robust augmented reality systems

Journal on Image and Video Processing - Special issue on fast and robust methods for multiple-view vision
Visual object tracking by an evolutionary self-organizing neural network

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Evolutionary neural networks for practical applications
A forward regression algorithm based on M-estimators

CONTROL'05 Proceedings of the 2005 WSEAS international conference on Dynamical systems and control
Image registration for foveated panoramic sensing

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)

Quantified Score

Hi-index	35.69

Visualization

Abstract

We propose a fast algorithm for speeding up the process of template matching that uses M-estimators for dealing with outliers. We propose a particular image hierarchy called the p-pyramid that can be exploited to generate a list of ascending lower bounds of the minimal matching errors when a nondecreasing robust error measure is adopted. Then, the set of lower bounds can be used to prune the search of the p-pyramid, and a fast algorithm is thereby developed in this paper. This fast algorithm ensures finding the global minimum of the robust template matching problem in which a nondecreasing M-estimator serves as an error measure. Experimental results demonstrate the effectiveness of our method.