Color Image Segmentation in Both Feature andImage Spaces

Color Image Segmentation in Both Feature andImage Spaces

Shengyang Dai (Northwestern University, USA) and Yu-Jin Zhang (Tsinghua University, Bejing, China)
Copyright: © 2006 |Pages: 19
DOI: 10.4018/978-1-59140-753-9.ch010
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

One critical problem in image segmentation is how to explore the information in both feature and image space and incorporate them together. One approach in this direction is reported in this chapter. Watershed algorithm is traditionally applied on image domain but it fails to capture the global color distribution information. A new technique is to apply first the watershed algorithm in feature space to extract clusters with irregular shapes, and then to use feature space analysis in image space to get the final result by minimizing a global energy function based on Markov random field theory. Two efficient energy minimization algorithms: Graph cuts and highest confidence first (HCF) are explored under this framework. Experiments with real color images show that the proposed two-step segmentation framework is efficient and has been successful in various applications.

Complete Chapter List

Search this Book:
Reset