Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Matrix computations (3rd ed.)
Matrix analysis and applied linear algebra
Matrix analysis and applied linear algebra
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Image Databases: Search and Retrieval of Digital Imagery
Image Databases: Search and Retrieval of Digital Imagery
Empirical evaluation of dissimilarity measures for color and texture
Computer Vision and Image Understanding - Special issue on empirical evaluation of computer vision algorithms
Efficient Color Histogram Indexing for Quadratic Form Distance Functions
IEEE Transactions on Pattern Analysis and Machine Intelligence
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
On the Surprising Behavior of Distance Metrics in High Dimensional Spaces
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Nearest Neighbor Classification in 3D Protein Databases
Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology
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
Improving Adaptable Similarity Query Processing by Using Approximations
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
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
3D Shape Histograms for Similarity Search and Classification in Spatial Databases
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Pivot selection techniques for proximity searching in metric spaces
Pattern Recognition Letters
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
Signature quadratic form distances for content-based similarity
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Similarity Search: The Metric Space Approach
Similarity Search: The Metric Space Approach
Ptolemaic indexing of the signature quadratic form distance
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Combining CPU and GPU architectures for fast similarity search
Distributed and Parallel Databases
Visual image search: feature signatures or/and global descriptors
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
| Hi-index | 0.00 |
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used. Unlike the widely used Euclidean distance, the QFD allows to arbitrarily correlate the histogram bins (dimensions), allowing thus to better model the similarity between histograms. However, unlike Euclidean distance, which is of linear time complexity, the QFD requires quadratic time to evaluate the similarity of two objects. In consequence, indexing and querying a database under QFD are expensive operations. In this paper we show that, given static correlations between dimensions, the QFD space can be transformed into an equivalent Euclidean space. Thus, the overall complexity of indexing and searching in the QFD similarity model can be reduced qualitatively. Besides the theoretical time complexity analysis of our approach applied to several metric access methods, in experimental evaluation we show the real-time speedup on a real-world image database.