Issue No. 06 - November/December (1998 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.738362
<p><b>Abstract</b>—Shape similarity search is a crucial task in image databases, particularly in the presence of errors induced by segmentation or scanning images. The resulting slight displacements or rotations have not been considered so far in the literature. We present a new similarity model that flexibly addresses this problem. By specifying neighborhood influence weights, the user may adapt the similarity distance functions to her or his requirements or preferences. Technically, the new similarity model is based on quadratic forms for which we present a multistep query processing architecture particularly for high dimensions as they occur in image databases. Our algorithm to reduce the dimensionality of quadratic form-based similarity queries results in a lower-bounding distance function that is proven to provide an optimal filter selectivity. Experiments on our test database of 10,000 images demonstrate the applicability and the performance of our approach even in high dimensions such as 1,024.</p>
Content-based image retrieval, adaptable similarity search, multistep query processing, searching and browsing large image databases, managing high-dimensional image data.
Mihael Ankerst, Hans-Peter Kriegel, Thomas Seidl, "A Multistep Approach for Shape Similarity Search in Image Databases", IEEE Transactions on Knowledge & Data Engineering, vol. 10, no. , pp. 996-1004, November/December 1998, doi:10.1109/69.738362