A graph-theoretic approach to colour image segmentation and contour classification
暂无分享,去创建一个
The segmentation of colour pictures in a graph-theoretic context is considered. The procedure aims at identifying visually important features on the image plane, such as regions of homogeneous colour and chromatic transitions. A segmentation algorithm of the region growing type is described which operates in a given colour co-ordinate system under the influence of an appropriate colour distance measure. The suppression of artificial contouring, a specific type of artefact introduced by the segmentation of algorithm, is formulated as a dual graph-theoretic problem. A hierarchical classification of contours is obtained which facilitates the progressive elimination of the undesirable contours. >
[1] M. Kunt,et al. Second-generation image-coding techniques , 1985, Proceedings of the IEEE.
[2] Myungcheol Lee,et al. Graph theory for image analysis: an approach based on the shortest spanning tree , 1986 .
[3] O. J. Morris,et al. Region and texture coding of TV pictures , 1989 .
[4] William K. Pratt,et al. Digital image processing (2nd ed.) , 1991 .