Translator Disclaimer
Paper
10 December 1986 A Study Of Texture Segmentation
Author Affiliations +
Abstract
In recent years, significant progress has been made in image segmentation and classification, but still no global theory of image segmentation exists. The wide variety of segmentation techniques used are basically ad hoc and are very dependent on the way the desired features are presented. The main local features used in various segmentation algorithms are image brightness, color and texture. One of the most important features for image segmentation by the human observer is texture, yet it has been difficult to measure and characterize. Actually, texture segmentation is at a very early stage of development at this time. This paper describes an experimental investigation into digital image segmentation using texture features. Texture features are extracted from a few widely different examples of image data. Several different feature sets are used, and the resulting files are input into an unsupervised clustering algorithm. Several variations on the clustering algorithm are explored: some partition the image into segments by using similarities only in the space of features, and others include spatial information such as the location of individual pixels. The various experimental results are also compared, and a new direction for investigation is described.
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Edward M. Bassett, Bayesteh G. Ghaffary, and A. A. Sawchuk "A Study Of Texture Segmentation", Proc. SPIE 0697, Applications of Digital Image Processing IX, (10 December 1986); https://doi.org/10.1117/12.976216
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

FPGA design and implementation of Gaussian filter
Proceedings of SPIE (December 17 2015)
CT image processing for hardwood log inspection
Proceedings of SPIE (December 01 1991)
Image Segmentation Algorithms
Proceedings of SPIE (July 11 1985)

Back to Top