Abstract
A pyramid linking algorithm for texture segmentation is presented. It is based on the computation of spatial properties of long, straight edge segments at fixed orientations. Features are computed for each edge segment in terms of the distances to the nearest neighboring edge segments of given orientations. This produces a set of sparse “edge separation maps” of features which are then used as the basis of a pyramid linking procedure for hierarchically grouping edges into homogeneously textured regions. Segmentation is performed in one bottom-up pass of linking nodes to their most similar parent. Results are shown using both the raw and smoothed edge separation features. All of the steps of the procedure can be efficiently implemented as parallel operations on a pyramid machine.
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
A. Rosenfeld, Ed., Multiresolution Image Processing and Analysis. Berlin, West Germany: Springer-Verlag, 1984.
B. P. Kjell and C. R. Dyer, “Edge separation and orientation texture measures,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, San Francisco, C A, June 1985, pp. 306–311.
B. P. Kjell, “Edge separation and orientation texture measures,” Ph.D. dissertation, Computer Science Department, University of Wisconsin, Madison, WI, 1985.
T. Phillips and T. Matsuyama, The labeled discrete Voronoi diagram, Technical Report TR-1278, Center for Automation Research, University of Maryland, College Park, MD, May 1983.
P. C. Chen and T. Pavlidis, “Segmentation by texture using a co-occurrence matrix and a split-and-merge algorithm,” Computer Graphics and Image Processing, vol. 10, pp. 172–182, 1979.
M. Pietikainen and A. Rosenfeld, “Image segmentation by texture using pyramid node linking,” IEEE Trans. Syst., Man, Cybern., vol. SMC-11, pp. 822–825, 1981.
K. I. Laws, “Texture energy measures,” Proc. Image Understanding Workshop, Los Angeles, CA, Nov. 1979, pp. 47–51.
P. J. Burt, T. H. Hong, and A. Rosenfeld, “Segmentation and estimation of image region properties through cooperative hierarchical computation,” IEEE Trans. Syst., Man, Cybern., vol. SMC-11, pp. 802–809, 1981.
J. Cibulskis and C. R. Dyer, “Node linking strategies in pyramids for image segmentation,” IEEE Trans. Syst., Man, Cybern., vol. SMC-14, pp. 424–436, 1984.
P. J. Burt, “The pyramid as a structure for efficient computation,” in Multiresolution Image Processing and Analysis, A. Rosenfeld, Ed. Berlin, West Germany: Springer- Verlag, 1984, pp. 6–35.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kjell, B.P., Dyer, C.R. (1986). Segmentation of Textured Images by Pyramid Linking. In: Cantoni, V., Levialdi, S. (eds) Pyramidal Systems for Computer Vision. NATO ASI Series, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82940-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-82940-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-82942-0
Online ISBN: 978-3-642-82940-6
eBook Packages: Springer Book Archive