short-paper

Randomized sub-vectors hashing for high-dimensional image feature matching

Authors:

Heng Yang,

Qing Wang,

Zhoucan HeAuthors Info & Claims

MM '08: Proceedings of the 16th ACM international conference on Multimedia

Pages 705 - 708

https://doi.org/10.1145/1459359.1459465

Published: 26 October 2008 Publication History

Get Access

Abstract

High-dimensional image feature matching is an important part of many image matching based problems in computer vision which are solved by local invariant features. In this paper, we propose a new indexing/searching method based on Randomized Sub-Vectors Hashing (called RSVH) for high-dimensional image feature matching. The essential of the proposed idea is that the feature vectors are considered similar (measured by Euclidean distance) when the L2 norms of their corresponding randomized sub-vectors are approximately same respectively. Experimental results have demonstrated that our algorithm can perform much better than the famous BBF (Best-Bin-First) and LSH (Locality Sensitive Hashing) algorithms in extensive image matching and image retrieval applications.

References

[1]

Noah Snavely, Steven M. Seitz, Richard Szeliski. 2006 Photo tourism: Exploring photo collections in 3D. ACM Transactions on Graphics, 25(3):835--846.

Digital Library

Google Scholar

[2]

M. Brown and D. G. Lowe. 2007 Automatic Panoramic Image Stitching Using Invariant Features. IJCV, 74(1):59--73.

Digital Library

Google Scholar

[3]

K. Mikolajczyk, B. Leibe and B. Schiele. 2005 Local feature for object class recognition. In ICCV, pages 1792--1799.

Digital Library

Google Scholar

[4]

J. Yao and W. K. Cham. 2007 Robust multi-view feature matching from multiple unordered views. Pattern Recognition, 40:3081--3099.

Digital Library

Google Scholar

[5]

D. G. Lowe. 2004 Distinctive image features from scale-invariant keypoints. IJCV, 60(2):91--110.

Digital Library

Google Scholar

[6]

K. Mikolajczyk and C. Schmid. 2005 A Performance Evaluation of Local Descriptors, IEEE PAMI, 27 (10):1615--1630.

Digital Library

Google Scholar

[7]

J. H. Firedman, J. L. Bentley, R. A. Finkel. 1977 An algorithm for finding best matches in logarithmic expected time. ACM Transactions Mathematical Software (3)3 pp.209--226.

Digital Library

Google Scholar

[8]

Sameer A. Nene, Shree K. Nayar. 1997 A Simple Algorithm for Nearest Neighbor Search in High Dimensions. IEEE Transactions on pattern analysis and machine intelligence, (19) 9, pp.989--1003.

Digital Library

Google Scholar

[9]

C. Yu, B. C. Ooi, K. L. Tan, H. V. Jgadish. 2001 Indexing the Distance: An Efficient Method to KNN Processing. Proceedings of the 27th VLDB Conference, pp. 421--430.

Digital Library

Google Scholar

[10]

Aristides Gionis, Piotr Indyky and Rajeev Motwaniz. 1999 Similarity Search in High Dimensions via Hashing. In The VLDB Journal, pp. 518--529.

Digital Library

Google Scholar

[11]

Test images for image matching. http://lear.inrialpes.fr/people/mikolajczyk/

Google Scholar

[12]

Image retrieval dataset. http://vis.uky.edu/~stewe/ukbench/

Google Scholar

Cited By

View all

Thomee BLew M(2012)Interactive search in image retrieval: a surveyInternational Journal of Multimedia Information Retrieval10.1007/s13735-012-0014-41:2(71-86)Online publication date: 8-Jun-2012
https://doi.org/10.1007/s13735-012-0014-4
Liang YLi JZhang BGao WRui YHanjalic AXu CSteinbach EEl Saddik AZhou M(2009)Vocabulary-based hashing for image searchProceedings of the 17th ACM international conference on Multimedia10.1145/1631272.1631363(589-592)Online publication date: 23-Oct-2009
https://dl.acm.org/doi/10.1145/1631272.1631363
Yang HWang QDo E(2009)Distance-Based multiple paths quantization of vocabulary tree for object and scene retrievalProceedings of the 9th Asian conference on Computer Vision - Volume Part I10.1007/978-3-642-12307-8_29(313-322)Online publication date: 23-Sep-2009
https://dl.acm.org/doi/10.1007/978-3-642-12307-8_29

Index Terms

Randomized sub-vectors hashing for high-dimensional image feature matching
1. Information systems
  1. Information retrieval
    1. Information retrieval query processing

Recommendations

Grassmann Hashing for approximate nearest neighbor search in high dimensional space
ICME '11: Proceedings of the 2011 IEEE International Conference on Multimedia and Expo

Locality-Sensitive Hashing (LSH) approximates nearest neighbors in high dimensions by projecting original data into low-dimensional subspaces. The basic idea is to hash data samples to ensure that the probability of collision is much higher for samples ...
Constrained discriminant neighborhood embedding for high dimensional data feature extraction

When handling pattern classification problem such as face recognition and digital handwriting identification, image data is always represented to high dimensional vectors, from which discriminant features are extracted using dimensionality reduction ...
High-dimensional image data feature extraction by double discriminant embedding

We propose a supervised feature extraction method in this paper that uses two successive transformations to produce the extracted features. The first projection maximizes the difference between spectral features. Thus, produced features have minimum ...

Comments

Information & Contributors

Information

Published In

MM '08: Proceedings of the 16th ACM international conference on Multimedia

October 2008

1206 pages

ISBN:9781605583037

DOI:10.1145/1459359

General Chairs:
Abdulmotaleb EL Saddik
University of Ottawa
,
Son Vuong
University of British Colombia
,
Program Chairs:
Carsten Griwodz
University of Oslo
,
Alberto Del Bimbo
University degli Studi di Firenze
,
K. Selcuk Candan
Arizona State University
,
Alejandro Jaimes
Telefonica R&D, Madrid, Spain

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 October 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

MM08

Sponsor:

MM08: ACM Multimedia Conference 2008

October 26 - 31, 2008

British Columbia, Vancouver, Canada

Acceptance Rates

Overall Acceptance Rate 2,145 of 8,556 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
309
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Thomee BLew M(2012)Interactive search in image retrieval: a surveyInternational Journal of Multimedia Information Retrieval10.1007/s13735-012-0014-41:2(71-86)Online publication date: 8-Jun-2012
https://doi.org/10.1007/s13735-012-0014-4
Liang YLi JZhang BGao WRui YHanjalic AXu CSteinbach EEl Saddik AZhou M(2009)Vocabulary-based hashing for image searchProceedings of the 17th ACM international conference on Multimedia10.1145/1631272.1631363(589-592)Online publication date: 23-Oct-2009
https://dl.acm.org/doi/10.1145/1631272.1631363
Yang HWang QDo E(2009)Distance-Based multiple paths quantization of vocabulary tree for object and scene retrievalProceedings of the 9th Asian conference on Computer Vision - Volume Part I10.1007/978-3-642-12307-8_29(313-322)Online publication date: 23-Sep-2009
https://dl.acm.org/doi/10.1007/978-3-642-12307-8_29

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Grassmann Hashing for approximate nearest neighbor search in high dimensional space

Constrained discriminant neighborhood embedding for high dimensional data feature extraction

High-dimensional image data feature extraction by double discriminant embedding