By Topic

On Genuine Connectivity Relations Based on Logical Predicates

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 $13
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

1 Author(s)
Pierre Soille ; Institute for Environment and Sustainability, Italy

This paper introduces a framework for the generation of genuine connectivity relations whose equivalent classes (called connected components) define unique partitions of the definition domain of a given grey tone image. This framework exploits the total ordering relation between the alpha-connected components of a pixel (two pixels are alpha-connected if there exists at least one path joining them such that the intensity differences between successive pixels of this path does not exceed a threshold value equal to alpha). Genuine connectivity relations are then obtained by considering the largest alpha-connected components satisfying one or more logical predicates such as the variance of the intensity values of the alpha-connected components not exceeding a given threshold value. Fine to coarse hierarchy partitions are generated by carefully varying the input threshold values. The proposed framework has the striking property of uniqueness. That is, the results do not depend on pixel processing order and are fully defined by the values of the threshold values, in contrast to most region growing procedures.

Published in:

Image Analysis and Processing, 2007. ICIAP 2007. 14th International Conference on

Date of Conference:

10-14 Sept. 2007