On Image Analysis by the Methods of Moments
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
The Feature Extraction of Chinese Character Based on Contour Information
ICDAR '99 Proceedings of the Fifth International Conference on Document Analysis and Recognition
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
A Performance Evaluation of Local Descriptors
IEEE Transactions on Pattern Analysis and Machine Intelligence
ZNCC-based template matching using bounded partial correlation
Pattern Recognition Letters
Grayscale template-matching invariant to rotation, scale, translation, brightness and contrast
PSIVT'07 Proceedings of the 2nd Pacific Rim conference on Advances in image and video technology
Efficient rotation-discriminative template matching
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
Translation, rotation, and scale-invariant object recognition
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
| Hi-index | 0.01 |
We consider brightness/contrast-invariant and rotation-discriminating template matching that searches an image to analyze A for a query image Q. We propose to use the complex coefficients of the discrete Fourier transform of the radial projections to compute new rotation-invariant local features. These coefficients can be efficiently obtained via FFT. We classify templates in ''stable'' and ''unstable'' ones and argue that any local feature-based template matching may fail to find unstable templates. We extract several stable sub-templates of Q and find them in A by comparing the features. The matchings of the sub-templates are combined using the Hough transform. As the features of A are computed only once, the algorithm can find quickly many different sub-templates in A, and it is suitable for finding many query images in A, multi-scale searching and partial occlusion-robust template matching.