Abstract
This paper describes three systems for image indexing and retrieval based on contour analysis. The systems compared are F-Index for Contours (fic), Hierarchical Entropy-based Representation (her) and Sketch-based query by Dialogue (sqd). The first system has been modified for contour-matching, since it was originally designed for a different purpose. The choice of these specifical systems has been made because of their similar conception, aim and computational complexity. An experimental and conceptual comparison has been carried out in order to assess retrieval precision, efficiency and usability. The results show that fic and her have similar performance in the high end of the spectrum, while sqd has less precise retrieval and less efficient search.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, C. Faloutsos, A. Swami, “E fficient similarity search in sequence databases,” Proc. FODO: 4th Int’l Conf. on Foundations of Data Organization and Algorithms, pp. 69–84, Evanston, IL, Oct. 1993.
N. Beckmann, H. P. Kriegel, R. Schneider, B. Seeger, “The R273B-tree: an efficient and robust access method for points and rectangles,” Proc. ACM SIGMOD, pp. 322–331, May 1990.
J. L. Bentley, “Multidimensional binary search trees used for associative searching,” Comm. AC1M, Vol. 18, No. 9, pp. 509–517, Sept. 1975.
A. Del Bimbo, M. De Marsico, S. Levialdi, G. Peritore, “Query by dialog: and inter-active approach to pictorial querying,” Image and Vision Computing 16, pp. 557–569, Elsevier, 1998.
A. Del Bimbo, P. Pala, “Visual Image Retrieval by Elastic Matching of User Sketches,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, n. 2, Feb. 1997, pp. 121–132.
R. Distasi, D. Vitulano, S. Vitulano, “A hierarchical representation for content based image retrieval,” Journal of Visual Languages and Computing, Special Issue on Multimedia Databases and Image Communication, Vol. 5, n. 8, Aug. 2000.
A. V. Oppenheim and R. W. Schafer, Digital Signal Processing, Prentice-Hall, Englewood Cliffs, NJ, USA, 1975.
M. Otterman, “Approximate Matching with High Dimensionality R-trees,” M.Sc. scholarly paper, Dept. of Computer Science, Univ. of Maryland, MD, USA, 1992.
S. Sclaro, “Distance to Deformable Prototypes: Encoding Shape Categories for Effcient Search,” In A. W. M. Smeulders, R. Jain, Eds., Image Databases and Multi-Media Search, Series on Software Engineering and Knowledge Engineering, vol. 8, pp. 25–37, World Scientific.
S. Sclaro, Image database used in shape-based retrieval experiments available via ftp at ftp://cs-ftp.bu.edu/sclaroff/pictures.tar.Z.
C. T. Zahn and R. Z. Roskies, “Fourier descriptors for plane closed curves,” IEEE Trans. Computers, Vol. C21, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Distasi, R., Nappi, M., Tucci, M., Vitulano, S. (2001). Image Indexing by Contour Analysis: A Comparison. In: Arcelli, C., Cordella, L.P., di Baja, G.S. (eds) Visual Form 2001. IWVF 2001. Lecture Notes in Computer Science, vol 2059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45129-3_61
Download citation
DOI: https://doi.org/10.1007/3-540-45129-3_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42120-7
Online ISBN: 978-3-540-45129-7
eBook Packages: Springer Book Archive