Recent advances on graph-based image segmentation techniques
- Publication Type:
- Chapter
- Citation:
- Graph-Based Methods in Computer Vision: Developments and Applications, 2012, pp. 140 - 154
- Issue Date:
- 2012-12-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2011007510OK.pdf | 2.29 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Image segmentation techniques using graph theory has become a thriving research area in computer vision community in recent years. This chapter mainly focuses on the most up-to-date research achievements in graph-based image segmentation published in top journals and conferences in computer vision community. The representative graph-based image segmentation methods included in this chapter are classified into six categories: minimum-cut/maximum-flow model (called graph-cut in some literatures), random walk model, minimum spanning tree model, normalized cut model and isoperimetric graph partitioning. The basic rationales of these models are presented, and the image segmentation methods based on these graph-based models are discussed as the main concern of this chapter. Several performance evaluation methods for image segmentation are given. Some public databases for testing image segmentation algorithms are introduced and the future work on graph-based image segmentation is discussed at the end of this chapter. © 2013, IGI Global.
Please use this identifier to cite or link to this item: