Abstract
In this paper we consider the wavelet decomposition of textured images with the aim to segment them. One of the key problems with using the tree-structured wavelet transform of an image is deciding how many branches of the tree are required for the accurate representation of the texture within the image, and which of these branches to use as features when clustering.
We describe here the use of two-point statistics to determine which features to select in the clustering procedure and termination of the wavelet decomposition. We present results on a set of composite Brodatz images.
Preview
Unable to display preview. Download preview PDF.
References
T. Chang & C.C.J. Kuo, “Texture Analysis and Classification with tree-structured Wavelet transform”, IEEE Trans on Image Proc., 2, pp 429–441, 1993.
R. Coifman & M.V. Wickerhauser, “Entropy-Based Algorithm for Best Basis Selection”, IEEE Trans on Info Theory, 38, March 1992.
I. Daubechies, “The Wavelet Transform, Time-Frequency Localization and Signal Analysis”, IEEE Trans on Info Theory, 36, pp 961–1005, 1990.
I. Daubechies, “Ten Lectures on Wavelets”, SIAM, Philadelphia, 1992.
Y. Lin, T. Chang & C.C.J. Kuo, “Texture Segmentation Using Wavelet Packets”, SPIE, 2034, Mathematical Imaging, pp 277–286, 1993.
S. Mallat, “Multifrequency Channel Decomposition of Images and Wavelet Models”, IEEE Trans. on Acoustics, Speech and Sig. Proc., 37, pp 2091–2110, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Palmer, P.L., Fatemi -Ghomi, N., Petrou, M. (1995). Feature selection for the tree-wavelet transform. In: Hlaváč, V., Šára, R. (eds) Computer Analysis of Images and Patterns. CAIP 1995. Lecture Notes in Computer Science, vol 970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60268-2_387
Download citation
DOI: https://doi.org/10.1007/3-540-60268-2_387
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60268-2
Online ISBN: 978-3-540-44781-8
eBook Packages: Springer Book Archive