Segmentation of Textured Images by Pyramid Linking
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.
KeywordsVoronoi Diagram Texture Image Texture Region Segmentation Accuracy Texture Segmentation
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- B. P. Kjell, “Edge separation and orientation texture measures,” Ph.D. dissertation, Computer Science Department, University of Wisconsin, Madison, WI, 1985.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- K. I. Laws, “Texture energy measures,” Proc. Image Understanding Workshop, Los Angeles, CA, Nov. 1979, pp. 47–51.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar