Soft image segmentation by weighted linked pyramid

  • Prewer D
  • Kitchen L
Citations of this article
Mendeley users who have this article in their library.
Get full text


This paper introduces the notion of softsegmentation and the use of a weightedlinkedpyramid 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 softsegmentation is a more natural way to segment digital image data than crisp segmentation. One method of deriving a softsegmentation from a weightedlinkedpyramid is shown. We introduce methods for comparing a softsegmentation with a crisp one and show that in some ways the softsegmentation is better.




Prewer, D., & Kitchen, L. (2001). Soft image segmentation by weighted linked pyramid. Pattern Recognition Letters, 22(2), 123–132.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free