Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Hanson, E. Riseman, P. Nagin (1975)
Region Growing in Textured Outdoor Scenes.
S. Zucker, A. Rosenfeld, L. Davis (1975)
Picture Segmentation by Texture DiscriminationIEEE Transactions on Computers, C-24
J. Weszka, R. Nagel, A. Rosenfeld (1973)
A Technique for Facilitating Threshold Selection for Object Extraction from Digital Pictures
Claude Brice, C. Fennema (1970)
Scene Analysis Using RegionsArtif. Intell., 1
S. Horowitz, T. Pavlidis (1976)
Picture Segmentation by a Tree Traversal AlgorithmJ. ACM, 23
J. Gupta, P. Wintz (1975)
A boundary finding algorithm and its applicationsIEEE Transactions on Circuits and Systems, 22
R. Ohlander (1975)
Analysis of natural scenes.
A. Aho, J. Hopcroft, J. Ullman (1974)
The Design and Analysis of Computer Algorithms
L. Roberts (1963)
Machine Perception of Three-Dimensional Solids
R. Bajcsy (1973)
Computer identification of visual surfacesComput. Graph. Image Process., 2
(1975)
Picture processing by graph analysis
S. Zucker (1976)
Region growing: Childhood and adolescence*Computer Graphics and Image Processing, 5
A. Rosenfeld, M. Thurston (1971)
Edge and Curve Detection for Visual Scene AnalysisIEEE Transactions on Computers, C-20
(1973)
Artif Intel
J. Strong, A. Rosenfeld (1973)
A region coloring technique for scene analysisCommunications of the ACM, 16
H. Feng, T. Pavlidis (1975)
The generation of polygonal outlines of objects from gray level picturesIEEE Transactions on Circuits and Systems, 22
Y. Yakimovsky (1973)
Scene analysis using a semantic base for region growing
S. Tanimoto (1975)
Hierarchical approaches to picture processing.
S. Tanimoto, T. Pavlidis (1975)
A hierarchical data structure for picture processingComputer Graphics and Image Processing, 4
(1973)
Computer Graphics and Image Processing
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
Communications of the ACM – Association for Computing Machinery
Published: Apr 1, 1977
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.