A graph-theoretical approach to region detection
- 25 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper presents a general and computationally inexpensive algorithmic scheme that falls in a region detection category. In the scheme, a minimal spanning tree is used as a path of a sequential region grower. The algorithm traverses the spatially adjacent graph while maintaining the structural organization of an image. The graph-theoretical evaluation of heuristics is described and examples of implementation are given.Keywords
This publication has 13 references indexed in Scilit:
- The editing of picture segmentations using local analysis of graphsCommunications of the ACM, 1977
- Picture Segmentation by a Tree Traversal AlgorithmJournal of the ACM, 1976
- Experiments on picture representation using regular decompositionComputer Graphics and Image Processing, 1976
- Image filtering-A context dependent processIEEE Transactions on Circuits and Systems, 1975
- Tree Systems for Syntactic Pattern RecognitionIEEE Transactions on Computers, 1973
- Computer determination of the constituent structure of biological imagesComputers and Biomedical Research, 1971
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971
- Scene analysis using regionsArtificial Intelligence, 1970
- Minimum Spanning Trees and Single Linkage Cluster AnalysisJournal of the Royal Statistical Society Series C: Applied Statistics, 1969
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957