The Earth Mover's Distance as a Metric for Image Retrieval
International Journal of Computer Vision
ACM Computing Surveys (CSUR)
Efficient Color Histogram Indexing for Quadratic Form Distance Functions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Empirical Evaluation of Dissimilarity Measures for Color and Texture
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
The analysis and applications of adaptive-binning color histograms
Computer Vision and Image Understanding - Special issue on color for image indexing and retrieval
The Amsterdam Library of Object Images
International Journal of Computer Vision
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
A Performance Evaluation of Local Descriptors
IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Features for image retrieval: an experimental comparison
Information Retrieval
The MIR flickr retrieval evaluation
MIR '08 Proceedings of the 1st ACM international conference on Multimedia information retrieval
A Fast Similarity Join Algorithm Using Graphics Processing Units
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Signature quadratic form distances for content-based similarity
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Analyzing Metric Space Indexes: What For?
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Signature Quadratic Form Distance
Proceedings of the ACM International Conference on Image and Video Retrieval
On (not) indexing quadratic form distance by metric access methods
Proceedings of the 14th International Conference on Extending Database Technology
Indexing the signature quadratic form distance for efficient content-based multimedia retrieval
Proceedings of the 1st ACM International Conference on Multimedia Retrieval
Ptolemaic indexing of the signature quadratic form distance
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Fast GPU-based locality sensitive hashing for k-nearest neighbor computation
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A graphics hardware accelerated algorithm for nearest neighbor search
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
On stability of adaptive similarity measures for content-based image retrieval
MMM'12 Proceedings of the 18th international conference on Advances in Multimedia Modeling
U2STRA: high-performance data management of ubiquitous urban sensing trajectories on GPGPUs
Proceedings of the 2012 ACM workshop on City data management workshop
Hi-index | 0.00 |
The Signature Quadratic Form Distance on feature signatures represents a flexible distance-based similarity model for effective content-based multimedia retrieval. Although metric indexing approaches are able to speed up query processing by two orders of magnitude, their applicability to large-scale multimedia databases containing billions of images is still a challenging issue. In this paper, we propose a parallel approach that balances the utilization of CPU and many-core GPUs for efficient similarity search with the Signature Quadratic Form Distance. In particular, we show how to process multiple distance computations and other parts of the search procedure in parallel, achieving maximal performance of the combined CPU/GPU system. The experimental evaluation demonstrates that our approach implemented on a common workstation with 2 GPU cards outperforms traditional parallel implementation on a high-end 48-core NUMA server in terms of efficiency almost by an order of magnitude. If we consider also the price of the high-end server that is ten times higher than that of the GPU workstation then, based on price/performance ratio, the GPU-based similarity search beats the CPU-based solution by almost two orders of magnitude. Although proposed for the SQFD, our approach of fast GPU-based similarity search is applicable for any distance function that is efficiently parallelizable in the SIMT execution model.