Techniques for Efficiently Searching in Spatial, Temporal, Spatio-temporal, and Multimedia Databases
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Robust Adaptable Video Copy Detection
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Multiple feature fusion for social media applications
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Relevance feedback for the Earth Mover's distance
AMR'09 Proceedings of the 7th international conference on Adaptive multimedia retrieval: understanding media and adapting to the user
An efficient and effective similarity measure to enable data mining of petroglyphs
Data Mining and Knowledge Discovery
Parameterized earth mover's distance for efficient metric space indexing
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Indexing the earth mover's distance using normal distributions
Proceedings of the VLDB Endowment
Speeding up complex video copy detection queries
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
WS-Finder: a framework for similarity search of web services
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
Hi-index | 0.00 |
Multimedia similarity search in large databases requires efficient query processing. The Earth Mover's Distance, introduced in computer vision, is successfully used as a similarity model in a number of small-scale applications. Its computational complexity hindered its adoption in large multimedia databases. We enable directly indexing the Earth Mover's Distance in structures such as the R-tree and the VA-file by providing the accurate `MinDist' function to any bounding rectangle in the index. We exploit the computational structure of the new MinDist to derive a new lower bound for the EMD MinDist which is assembled from quantized partial solutions yielding very fast query processing times. We prove completeness of our approach in a multistep scheme. Extensive experiments on real world data demonstrate the high efficiency.