Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The editing of picture segmentations using local analysis of graphs

The editing of picture segmentations using local analysis of graphs Graphics and Image Processing J.D. Foley Editor The Editing of Picture Segmentations Using Local Analysis of Graphs Steven L. Tanimoto University of Connecticut Theodosios Pavlidis Princeton University A major problem in picture processing is the elimination of the large number of spurious regions that result from an initial segmentation by region growing techniques. Such regions have been eliminated either on the basis of semantic information or on the basis of size and contrast. A scheme is presented which performs eliminations on the basis of local properties of the region adjacency graph. The scheme is based on definitions of graph properties which are satisfied when a spurious region is present; then editing is equivalent to fast graph operations. A number of examples are shown. Key Words and Phrases: picture processing, pattern recognition, segmentation, region editing CR Categories: 3.63 Introduction Segmentation, the process of breaking a picture into its component parts, has been studied heavily in recent work, both through boundary analysis methods [6, 12, 13] and region analysis methods [2, 3, 10, 18, 19]. Algorithms that compute a segmentation of a picture into regions often output a result containing a number of undesired spurious regions which are either the http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

The editing of picture segmentations using local analysis of graphs

Loading next page...
 
/lp/association-for-computing-machinery/the-editing-of-picture-segmentations-using-local-analysis-of-graphs-CdldVgN77B

References (20)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1977 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/359461.359468
Publisher site
See Article on Publisher Site

Abstract

Graphics and Image Processing J.D. Foley Editor The Editing of Picture Segmentations Using Local Analysis of Graphs Steven L. Tanimoto University of Connecticut Theodosios Pavlidis Princeton University A major problem in picture processing is the elimination of the large number of spurious regions that result from an initial segmentation by region growing techniques. Such regions have been eliminated either on the basis of semantic information or on the basis of size and contrast. A scheme is presented which performs eliminations on the basis of local properties of the region adjacency graph. The scheme is based on definitions of graph properties which are satisfied when a spurious region is present; then editing is equivalent to fast graph operations. A number of examples are shown. Key Words and Phrases: picture processing, pattern recognition, segmentation, region editing CR Categories: 3.63 Introduction Segmentation, the process of breaking a picture into its component parts, has been studied heavily in recent work, both through boundary analysis methods [6, 12, 13] and region analysis methods [2, 3, 10, 18, 19]. Algorithms that compute a segmentation of a picture into regions often output a result containing a number of undesired spurious regions which are either the

Journal

Communications of the ACMAssociation for Computing Machinery

Published: Apr 1, 1977

There are no references for this article.