Image Matching with Spatially Variant Contrast and Offset: A Quadratic Programming Approach

Authors:
Alexander Shorin;Georgy Gimel'Farb;Patrice Delmas;Jonh Morris
Affiliations:
Department of Computer Science, University of Auckland, Auckland, New Zealand 1142;Department of Computer Science, University of Auckland, Auckland, New Zealand 1142;Department of Computer Science, University of Auckland, Auckland, New Zealand 1142;Department of Computer Science, University of Auckland, Auckland, New Zealand 1142
Venue:
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Year:
2008

Citing 8
Cited 0

Robust image matching under partial occlusion and spatially varying illumination change

Computer Vision and Image Understanding - Special issue on robusst statistical techniques in image understanding
Photometric Stereo with General, Unknown Lighting

International Journal of Computer Vision
Robust face imagematching under illumination variations

EURASIP Journal on Applied Signal Processing
A robust measure for visual correspondence

ICIAP '07 Proceedings of the 14th International Conference on Image Analysis and Processing
Fast algorithm for robust template matching with M-estimators

IEEE Transactions on Signal Processing
Fast robust correlation

IEEE Transactions on Image Processing
Robust and Efficient Image Alignment Based on Relative Gradient Matching

IEEE Transactions on Image Processing
A Comparative Study of Local Matching Approach for Face Recognition

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Template matching is widely used in machine vision, digital photogrammetry, and multimedia data mining to search for a target object by similarity between its prototype image (template) and a sensed image of a natural scene containing the target. In the real-world environment, similarity scores are frequently affected by contrast / offset deviations between the template and target signals. Most of the popular least-squares scores presume only simple smooth deviations that can be approximated with a low-order polynomial. This paper proposes an alternative and more general quadratic programming based matching score that extends the conventional least-squares framework onto both smooth and non-smooth signal deviations.