By Topic

A graph-theoretic approach to colour image segmentation and contour classification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Vlachos, T. ; Imperial Coll. of Sci., Technol. & Med., London, UK ; Constantinides, A.G.

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

Published in:

Image Processing and its Applications, 1992., International Conference on

Date of Conference:

7-9 Apr 1992