Share Email Print

Proceedings Paper

Segmenting Intersecting And Incomplete Boundaries
Author(s): Ganapathy Krishnan; Deborah Walters
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper describes general purpose algorithms for segmenting boundary images. Intersecting and incomplete boundaries commonly occur in line-art images, and also in natural images depicting translucent objects. Humans have little difficulty in segmenting such boundaries into sets corresponding to the perceptually significant regions in the image. Many existing machine vision algorithms, however, have difficulty in processing images which contain intersecting or incomplete boundaries. However, Walters' segmentation algorithm based on the p-space representation of oriented edges will correctly segment images with non-acutely intersecting lines and boundaries. This paper suggests a non-iterative, parallel algorithm which will fill large gaps and segment acutely intersecting boundaries. These algorithms are useful in a variety of applications including fake color separation, character recognition, and also in segmenting images depicting translucent objects.

Paper Details

Date Published: 29 March 1988
PDF: 7 pages
Proc. SPIE 0937, Applications of Artificial Intelligence VI, (29 March 1988); doi: 10.1117/12.947019
Show Author Affiliations
Ganapathy Krishnan, State University of New York at Buffalo (United States)
Deborah Walters, State University of New York at Buffalo (United States)

Published in SPIE Proceedings Vol. 0937:
Applications of Artificial Intelligence VI
Mohan M. Trivedi, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?