ACM Home Page
Please provide us with feedback. Feedback
Design and evaluation of algorithms for image retrieval by spatial similarity
Full text PdfPdf (1.89 MB)
Source ACM Transactions on Information Systems (TOIS) archive
Volume 13 ,  Issue 2  (April 1995) table of contents
Pages: 115 - 144  
Year of Publication: 1995
ISSN:1046-8188
Authors
Venkat N. Gudivada  Ohio Univ., Athens
Vijay V. Raghavan  Univ. of Southwest Louisiana, Lafayette
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 96,   Citation Count: 63
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/201040.201041
What is a DOI?

ABSTRACT

Similarity-based retrieval of images is an important task in many image database applications. A major class of users' requests requires retrieving those images in the database that are spatially similar to the query image. We propose an algorithm for computing the spatial similarity between two symbolic images. A symbolic image is a logical representation of the original image where the image objects are uniquely labeled with symbolic names. Spatial relationships in a symbolic image are represented as edges in a weighted graph referred to as spatial-orientation graph. Spatial similarity is then quantified in terms of the number of, as well as the extent to which, the edges of the spatial-orientation graph of the database image conform to the corresponding edges of the spatial-orientation graph of the query image.The proposed algorithm is robust in the sense that it can deal with translation, scale, and rotational variances in images. The algorithm has quadratic time complexity in terms of the total number of objects in both the database and query images. We also introduce the idea of quantifying a system's retrieval quality by having an expert specify the expected rank ordering with respect to each query for a set of test queries. This enables us to assess the quality of algorithms comprehensively for retrieval in image databases. The characteristics of the proposed algorithm are compared with those of the previously available algorithms using a testbed of images. The comparison demonstrated that our algorithm is not only more efficient but also provides a rank ordering of images that consistently matches with the expert's expected rank ordering.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
FISHER, W. 1958. On grouping for maximum homogeneity. J. Am. Stat. Assoc. 53, 789-798.
 
5
 
6
 
7
GUDWADA, V.N. 1993. A unified framework for retrieval in image databases. Ph.D. dissertation, Univ. of Southwestern Louisiana, Lafayette, La.
 
8
 
9
RAGHAVAN, V. V. AND GUDIVADA, V. N. 1990. A domain independent similarity measure for symbolic images. In 1st Indian Computing Congress (Hyderabad, India, Nov.). 195-203.
 
10
TAMURA, H. AND YOKOYA, N. 1984. Image database systems: A survey. Part. Recog. 17, 1, 29-43.

CITED BY  63

Collaborative Colleagues:
Venkat N. Gudivada: colleagues
Vijay V. Raghavan: colleagues