Picture Segmentation by a Tree Traversal Algorithm
Journal of the ACM (JACM)
A region coloring technique for scene analysis
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Analysis of natural scenes.
Hierarchical approaches to picture processing.
Hierarchical approaches to picture processing.
New mathematical morphology operators and their applications
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Texture tile considerations for raster graphics
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Data structures for picture processing
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Computers in Biology and Medicine
Advances in constrained connectivity
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
| Hi-index | 48.22 |
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.