ΘR$\Re$-String: A Geometry-Based Representation for Efficient and Effective Retrieval of Images by Spatial Similarity
Issue No. 03 - May/June (1998 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.687982
<p><b>Abstract</b>—A spatial similarity algorithm assesses the degree to which the spatial relationships among the domain objects in a database image conform to those specified in the query image. In this paper, we propose a geometry-based structure for representing the spatial relationships in the images and an associated spatial similarity algorithm. The proposed algorithm recognizes both translation, scale, and rotation variants of an image, and variants of the image generated by an arbitrary composition of translation, scale, and rotation transformations. The algorithm has Θ(<it>n</it> log <it>n</it>) time complexity in terms of the number of objects common to the database and query images. The retrieval effectiveness of the proposed algorithm is evaluated using the <it>TESSA</it> image collection.</p>
Image representation, matching, multimedia databases, spatial similarity, retrieval algorithms.
Venkat N. Gudivada, "ΘR$\Re$-String: A Geometry-Based Representation for Efficient and Effective Retrieval of Images by Spatial Similarity", IEEE Transactions on Knowledge & Data Engineering, vol. 10, no. , pp. 504-512, May/June 1998, doi:10.1109/69.687982