Soft image segmentation by weighted linked pyramid

  • Prewer D
  • Kitchen L
  • 5


    Mendeley users who have this article in their library.
  • 14


    Citations of this article.


This paper introduces the notion of soft segmentation and the use of a weighted linked pyramid algorithm to compute it. A fundamental problem of region segmentation is that for many images no unique, correct region boundaries can be determined. In this situation, the normal desire for a definitive crisp segmentation may be unreasonable. It is proposed that soft segmentation is a more natural way to segment digital image data than crisp segmentation. One method of deriving a soft segmentation from a weighted linked pyramid is shown. We introduce methods for comparing a soft segmentation with a crisp one and show that in some ways the soft segmentation is better. © 2001 Elsevier Science B.V. All rights reserved.

Author-supplied keywords

  • Hierarchical segmentation
  • Linked pyramid
  • Region segmentation
  • Soft segmentation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • David Prewer

  • Les Kitchen

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free