The Design and Use of Steerable Filters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Scale & Affine Invariant Interest Point Detectors
International Journal of Computer Vision
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
PCA-SIFT: a more distinctive representation for local image descriptors
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Top-points as interest points for image matching
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
The Representation and Matching of Images Using Top Points
Journal of Mathematical Imaging and Vision
Hi-index | 0.00 |
Local feature matching is an essential component of many image retrieval algorithms. Euclidean and Mahalanobis distances are mostly used in order to compare two feature vectors. The first distance does not give satisfactory results in many cases and is inappropriate in the typical case where the components of the feature vector are incommensurable, whereas the second one requires training data. In this paper a stability based similarity measure (SBSM) is introduced for feature vectors that are composed of arbitrary algebraic combinations of image derivatives. Feature matching based on SBSM is shown to outperform algorithms based on Euclidean and Mahalanobis distances, and does not require any training.