Share Email Print

Proceedings Paper

Axiomatic path strength definition for fuzzy connectedness and the case of multiple seeds
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper presents an extension of the theory and algorithms for fuzzy connectedness. In this framework, a strength of connectedness is assigned to every pair of image elements by finding the strongest connecting path between them. The strength of a path is the weakest affinity between successive pairs of elements along the path. Affinity specifies the degree to which elements hang together locally in the image. A fuzzy connected object containing a particular seed element is computed via dynamic programming. In all reported works so far, the minimum of affinities has been considered for path strength and the maximum of path strengths for fuzzy connectedness. The question thus remained all along as to whether there are other valid formulations for fuzzy connectedness. One of the main contributions of this paper is a theoretical investigation under reasonable axioms to establish that maximum of path strengths of minimum of affinities along each path is indeed the one and only valid choice. The second contribution here is to generalize the theory and algorithms of fuzzy connectedness to the multi-seeded case. The importance of multi-seeded fuzzy connectedness is illustrated with examples taken from several real medical imaging applications.

Paper Details

Date Published: 9 May 2002
PDF: 11 pages
Proc. SPIE 4684, Medical Imaging 2002: Image Processing, (9 May 2002); doi: 10.1117/12.467083
Show Author Affiliations
Jayaram K. Udupa, Univ. of Pennsylvania (United States)
Punam K. Saha, Univ. of Pennsylvania (United States)

Published in SPIE Proceedings Vol. 4684:
Medical Imaging 2002: Image Processing
Milan Sonka; J. Michael Fitzpatrick, Editor(s)

© SPIE. Terms of Use
Back to Top