Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Links Between Image Segmentation Based on Optimum-Path Forest and Minimum Cut in Graph
Author: Miranda, PAV
Falcao, AX
Abstract: Image segmentation can be elegantly solved by optimum-path forest and minimum cut in graph. Given that both approaches exploit similar image graphs, some comparative analysis is expected between them. We clarify their differences and provide their comparative analysis from the theoretical point of view, for the case of binary segmentation (object/background) in which hard constraints (seeds) are provided interactively. Particularly, we formally prove that some optimum-path forest methods from two distinct region-based segmentation paradigms, with internal and external seeds and with only internal seeds, indeed minimize some graph-cut measures. This leads to a proof of the necessary conditions under which the optimum-path forest algorithm and the min-cut/max-flow algorithm produce exactly the same segmentation result, allowing a comparative analysis between them.
Subject: Image segmentation based on optimum-path forest
Graph-cut segmentation
Image foresting transform
Graph-based image segmentation
Country: Holanda
Editor: Springer
Rights: fechado
Identifier DOI: 10.1007/s10851-009-0159-9
Date Issue: 2009
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000268191700003.pdf3.48 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.