27 March 1989 Geometry Guided Segmentation
Author Affiliations +
Proceedings Volume 1002, Intelligent Robots and Computer Vision VII; (1989) https://doi.org/10.1117/12.960273
Event: 1988 Cambridge Symposium on Advances in Intelligent Robotics Systems, 1988, Boston, MA, United States
Our overall goal is to develop an image understanding system for automatically interpreting dental radiographs. This paper describes the module that integrates the intrinsic image data to form the region adjacency graph that represents the image. The specific problem is to develop a robust method for segmenting the image into small regions that do not overlap anatomical boundaries. Classical algorithms for finding homogeneous regions (i.e., 2 class segmentation or connected components) will not always yield correct results since blurred edges can cause adjacent anatomical regions to be labeled as one region. This defect is a problem in this and other applications where an object count is necessary. Our solution to the problem is to guide the segmentation by intrinsic properties of the constituent objects. The module takes a set of intrinsic images as arguments. A connected components-like algorithm is performed, but the connectivity relation is not 4- or 8-neighbor connectivity in binary images; the connectivity is defined in terms of the intrinsic image data. We shall describe both the classical method and the modified segmentation procedures, and present experiments using both algorithms. Our experiments show that for the dental radiographs a segmentation using gray level data in conjunction with edges of the surfaces of teeth give a robust and reliable segmentation.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Stanley M. Dunn, Stanley M. Dunn, Tajen Liang, Tajen Liang, } "Geometry Guided Segmentation", Proc. SPIE 1002, Intelligent Robots and Computer Vision VII, (27 March 1989); doi: 10.1117/12.960273; https://doi.org/10.1117/12.960273


Back to Top