The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Vector quantization and signal compression
Vector quantization and signal compression
Machine Learning
BIRCH: an efficient data clustering method for very large databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Query refinement for multimedia similarity retrieval in MARS
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Classification with Nonmetric Distances: Image Retrieval and Class Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Support vector machine active learning for image retrieval
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Comparing discriminating transformations and SVM for learning during multimedia retrieval
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Clustering for Approximate Similarity Search in High-Dimensional Spaces
IEEE Transactions on Knowledge and Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd 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
What Is the Nearest Neighbor in High Dimensional Spaces?
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Query Reformulation for Content Based Multimedia Retrieval in MARS
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
PBIR-MM: multimodal image retrieval and annotation
Proceedings of the tenth ACM international conference on Multimedia
MEGA---the maximizing expected generalization algorithm for learning complex query concepts
ACM Transactions on Information Systems (TOIS)
Enhanced Perceptual Distance Functions and Indexing for Image Replica Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust and fast similarity search for moving object trajectories
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Similarity search: a matching based approach
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Efficient skyline retrieval with arbitrary similarity measures
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Transfer non-metric measures into metric for similarity search
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Content-based video copy detection
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Scalable indexing for perceptual data
MCAM'07 Proceedings of the 2007 international conference on Multimedia content analysis and mining
CP-index: using clustering and pivots for indexing non-metric spaces
Proceedings of the Third International Conference on SImilarity Search and APplications
Efficient RkNN retrieval with arbitrary non-metric similarity measures
Proceedings of the VLDB Endowment
Efficient reverse skyline retrieval with arbitrary non-metric similarity measures
Proceedings of the 14th International Conference on Extending Database Technology
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
Context-sensitive ranking for effective image retrieval
MMM'07 Proceedings of the 13th international conference on Multimedia Modeling - Volume Part I
On fast non-metric similarity search by metric access methods
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Capturing contextual relationship for effective media search
Multimedia Tools and Applications
Non-metric similarity ranking for image retrieval
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Visually exploring movement data via similarity-based analysis
Journal of Intelligent Information Systems
A conversation with Dr. Edward Y. Chang
ACM SIGKDD Explorations Newsletter
Improving the speed and stability of the k-nearest neighbors method
Pattern Recognition Letters
| Hi-index | 0.00 |
To date, almost all research work in the Content-Based Image Retrieval (CBIR) community has used Minkowski-like functions to measure similarity between images. In this paper, we first present a non-metric distance function, dynamic partial function (DPF), which works significantly better than Minkowski-like functions for measuring perceptual similarity; and we explain DPF's link to similarity theories in cognitive science. We then propose DynDex, an indexing method that deals with both the dynamic and non-metric aspects of the distance function. DynDex employs statistical methods including distance-based classification and bagging to enable efficient indexing with DPF. In addition to its efficiency for conducting similarity searches in very high-dimensional spaces, we show that DynDex remains effective when features are weighted dynamically for supporting personalized searches.