Loading [a11y]/accessibility-menu.js
Efficient k-nearest neighbor queries with the Signature Quadratic Form Distance | IEEE Conference Publication | IEEE Xplore

Efficient k-nearest neighbor queries with the Signature Quadratic Form Distance


Abstract:

A frequently encountered query type in multimedia databases is the k-nearest neighbor query which finds the k-nearest neighbors of a given query. To speed up such queries...Show More

Abstract:

A frequently encountered query type in multimedia databases is the k-nearest neighbor query which finds the k-nearest neighbors of a given query. To speed up such queries and to meet the user requirements in low response time, approximation techniques play an important role. In this paper, we present an efficient approximation technique applicable to distance measures defined over flexible feature representations, i.e. feature signatures. We apply our approximation technique to the recently proposed Signature Quadratic Form Distance applicable to feature signatures. We performed our experiments on numerous image databases, gathering k-nearest neighbor query rankings in significantly low computation time with an average speed-up factor of 13.
Date of Conference: 01-06 March 2010
Date Added to IEEE Xplore: 22 April 2010
ISBN Information:
Conference Location: Long Beach, CA, USA

References

References is not available for this document.