Abstract
In this paper, a Hierarchical Entropy based Representation for texture indexing HERTI is presented. The hypothesis is that any texture can be efficaciously represented by means of a 1-D signal obtained by a characteristic curve covering a square (uniform under a given criterion and a given segmentation) region. Starting from such a signal, HER can be then efficaciously applied, taking into account of its generality, for image retrieval by content. Moreover, a Spatial Access Method (SAM), i.e. k-d-Tree, has been utilized in order to improve the search performances. The results obtained on some databases show that HERTI achieves very good performances with few false alarms and dismissals.
Chapter PDF
Similar content being viewed by others
References
E. G. M. Petrakis, C. Faloutsos,’ Similarity Searching in Medical Image Databases’, IEEE Trans. on knowledge and data engineering, Vol. 9, No. 3, May/June 1997.
U. Glavitsch, P. Schauble, M. Wechsler,’ Metadata for integrating speech documents in a text retrieval system, Sigmod Record, vol. 23, No. 4, Dec. 1994.
G. Salton and M. J. McGill, Introduction to modern information retrieval, McGraw-Hill, 1983.
M. Nappi, D. Vitulano, S. Vitulano, ”Entropy based Indexing in Time Series databases, Proc. od IWSCI’ 99 Muroran, Japan, June 1999.
C. Di Ruberto, D. Vitulano, S. Vitulano, ”Content based Image Retrieval by Contour Indexing, to appear on Proc. of MDIC’ 99, Slerno Italy, October 99.
R. Agrawal, C. Faloutsos and A. Swami,’ Efficient similarity search in sequence databases’, Foundation of Data Organization and Algorithm (FODO) Conference, Evanston, Illinois, Oct. 1993.
N. Beckmann, H. P. Kriegel, R. Schneider, B. Seeger,’ The R*-tree: An efficient and robust access method for points and rectangles’, Proc. of ACM SIGMOD, pp. 322–331, May 1990.
A. Guttman,’ R-Tree: A dynamic index structure for spatial searching, Proc. of ACM SIGMOD, Boston, pp. 45–47, June 1984.
I. Kamel, C. Faloutsos,’ On packing R-Trees, Proc. of CIKM, Second Int. Conf. On Information Knowledge Management, Nov. 1993.
H. V. Jagadish,’ Linear clustering of objects with multiple attributes, Proc. of ACM SIGMOD, pp. 332–342, Atlantic City, May 1990.
A. V. Oppenheim and R. W. Schafer. Digital Signal Processing, Prentice Hall, Englewood Cliffs, N.J., 1975.
H. Samet, The design and analysis of spatial data strucures, Addison Wesley, 1989.
J. D. Ullman, Principles of database and knowledge-based systems, Computer Science Press, Rockville, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vitulano, D., Vitulano, S. (2000). Texture Indexing by a Hierarchical Representation. In: Ferri, F.J., Iñesta, J.M., Amin, A., Pudil, P. (eds) Advances in Pattern Recognition. SSPR /SPR 2000. Lecture Notes in Computer Science, vol 1876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44522-6_39
Download citation
DOI: https://doi.org/10.1007/3-540-44522-6_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67946-2
Online ISBN: 978-3-540-44522-7
eBook Packages: Springer Book Archive
