IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Unsupervised and Supervised Image Segmentation Using Graph Partitioning

Unsupervised and Supervised Image Segmentation Using Graph Partitioning
View Sample PDF
Author(s): Charles-Edmond Bichot (Université de Lyon, France)
Copyright: 2013
Pages: 23
Source title: Graph-Based Methods in Computer Vision: Developments and Applications
Source Author(s)/Editor(s): Xiao Bai (Beihang University, China), Jian Cheng (Chinese Academy of Sciences, China)and Edwin Hancock (University of York, UK)
DOI: 10.4018/978-1-4666-1891-6.ch004

Purchase

View Unsupervised and Supervised Image Segmentation Using Graph Partitioning on the publisher's website for pricing and purchasing information.

Abstract

Image segmentation is an important research area in computer vision and its applications in different disciplines, such as medicine, are of great importance. It is often one of the very first steps of computer vision or pattern recognition methods. This is because segmentation helps to locate objects and boundaries into images. The objective of segmenting an image is to partition it into disjoint and homogeneous sets of pixels. When segmenting an image it is natural to try to use graph partitioning, because segmentation and partitioning share the same high-level objective, to partition a set into disjoints subsets. However, when using graph partitioning for segmenting an image, several big questions remain: What is the best way to convert an image into a graph? Or to convert image segmentation objectives into graph partitioning objectives (not to mention what are image segmentation objectives)? What are the best graph partitioning methods and algorithms for segmenting an image? In this chapter, the author tries to answer these questions, both for unsupervised and supervised image segmentation approach, by presenting methods and algorithms and by comparing them.

Related Content

R. N. Ravikumar, S. Aarthi, Valisher Sapayev, Alijon Esanov. © 2026. 32 pages.
Md Mehedi Hasan Emon, Tahsina Khan. © 2026. 34 pages.
Zerin Tasnim, Md Mahdi Hasan Ahid, Md. Adnan Rahman, Mohammad Mofasserul Islam, Md. Nafis Fuad, Abu Bakar Abdul Hamid. © 2026. 34 pages.
P. S. Venkateswaran, S. Jeyakumar, S. Devi Kamatchi, S. Manimaran. © 2026. 36 pages.
Aliza, Abdullah, Muhammad Usman. © 2026. 32 pages.
Rohit Yadav. © 2026. 22 pages.
Salam Al E'mari, Yousef Sanjalawe, Fuad Fataftah. © 2026. 30 pages.
Body Bottom