Region-Based Segmentation: Fuzzy Connectedness, Graph Cut and Related Algorithms

  • Ciesielski K
  • Udupa J
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, we will review the current state of knowledge on regionbased digital image segmentation methods. More precisely, we will concentrate on the four families of such algorithms: (a) The leading theme here will be the framework of fuzzy connectedness (FC) methods. (b) We will also discuss in detail the family of graph cut (GC) methods and their relations to the FC family of algorithms. The GC methodology will be of special importance to our presentation, since we will emphasize the fact that the methods discussed here can be formalized in the language of graphs and GCs. The other two families of segmentation algorithms we will discuss consist of (c) watershed (WS) and (d) the region growing level set (LS) methods. Examples from medical image segmentation applications with different FC algorithms are also included.

Cite

CITATION STYLE

APA

Ciesielski, K. C., & Udupa, J. K. (2010). Region-Based Segmentation: Fuzzy Connectedness, Graph Cut and Related Algorithms (pp. 251–278). https://doi.org/10.1007/978-3-642-15816-2_10

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