Similarity Matrix Compression for Efficient Signature Quadratic Form Distance Computation

Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art similarity measures, the Signature Quadratic Form Distance has shown good applicability and high quality in comparing flexible feature representations. In order to improve the efficiency of the Signature Quadratic Form Distance, we propose the similarity matrix compression approach which aims at compressing the distance's inherent similarity matrix. We theoretically show how to reduce the complexity of distance computations and benchmark computation time improvements. As a result, we improve the efficiency of a single distance computation by a factor up to 9.

Authors: Beecks C., Uysal M., Seidl T.
Published in: Proc. 3rd International Conference on Similarity Search and Applications (SISAP 2010), Istanbul, Turkey
Publisher: ACM - New York, NY, USA
Sprache: EN
Jahr: 2010
Seiten: 109-114
ISBN: 978-1-4503-0420-7
Konferenz: SISAP
DOI:10.1145/1862344.1862361
URL:SISAP 2010
Dateien:
Typ: Tagungsbeiträge
Forschungsgebiet: Exploration of Multimedia Databases