Towards optimal indexing for relevance feedback in large image databases

Authors:
Sharadh Ramaswamy;Kenneth Rose
Affiliations:
Signal Compression Lab, Electrical and Computer Engineering, University of California, Santa Barbara, CA;Signal Compression Lab, Electrical and Computer Engineering, University of California, Santa Barbara, CA
Venue:
IEEE Transactions on Image Processing
Year:
2009

Citing 26
Cited 1

Vector quantization and signal compression

Vector quantization and signal compression
BIRCH: an efficient data clustering method for very large databases

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Vector approximation based indexing for non-uniform high dimensional data sets

Proceedings of the ninth international conference on Information and knowledge management
The Earth Mover's Distance as a Metric for Image Retrieval

International Journal of Computer Vision
Database Management Systems

Database Management Systems
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Query by Image and Video Content: The QBIC System

Computer
Shape Matching and Object Recognition Using Shape Contexts

IEEE Transactions on Pattern Analysis and Machine Intelligence
VQ-index: an index structure for similarity searching in multimedia databases

Proceedings of the tenth ACM international conference on Multimedia
Similarity Indexing with the SS-tree

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Approximate Nearest Neighbor Searching in Multimedia Databases

Proceedings of the 17th International Conference on Data Engineering
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
MindReader: Querying Databases Through Multiple Examples

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Similarity Search in High Dimensions via Hashing

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation

Proceedings of the 27th International Conference on Very Large Data Bases
Indexing the Distance: An Efficient Method to KNN Processing

Proceedings of the 27th International Conference on Very Large Data Bases
Object Recognition from Local Scale-Invariant Features

ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Learning a Mahalanobis Metric from Equivalence Constraints

The Journal of Machine Learning Research
Efficient Shape Matching Using Shape Contexts

IEEE Transactions on Pattern Analysis and Machine Intelligence
The Pyramid Match Kernel: Discriminative Classification with Sets of Image Features

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Information-theoretic metric learning

Proceedings of the 24th international conference on Machine learning
Hierarchical browsing and search of large image databases

IEEE Transactions on Image Processing
The MPEG-7 visual standard for content description-an overview

IEEE Transactions on Circuits and Systems for Video Technology
Color and texture descriptors

IEEE Transactions on Circuits and Systems for Video Technology
MPEG-7 visual shape descriptors

IEEE Transactions on Circuits and Systems for Video Technology

Medical image retrieval, indexing and enhancement techniques: a survey

Proceedings of the 2011 International Conference on Communication, Computing & Security

Quantified Score

Hi-index	0.01

Visualization

Abstract

Motivated by the need to efficiently leverage user relevance feedback in content-based retrieval from image databases, we propose a fast, clustering-based indexing technique for exact nearest-neighbor search that adapts to the Mahalanobis distance with a varying weight matrix. We derive a basic property of point-to-hyperplane Mahalanobis distance, which enables efficient recalculation of such distances as the Mahalanobis weight matrix is varied. This property is exploited to recalculate bounds on query-cluster distances via projection on known separating hyperplanes (available from the underlying clustering procedure), to effectively eliminate noncompetitive clusters from the search and to retrieve clusters in increasing order of (the appropriate) distance from the query. We compare performance with an existing variant of VA-File indexing designed for relevance feedback, and observe considerable gains.