| dc.creator | Miranda, PAV | |
| dc.creator | Falcao, AX | |
| dc.date | 2009 | |
| dc.date | OCT | |
| dc.date | 2014-11-15T00:45:41Z | |
| dc.date | 2015-11-26T17:18:01Z | |
| dc.date | 2014-11-15T00:45:41Z | |
| dc.date | 2015-11-26T17:18:01Z | |
| dc.date.accessioned | 2018-03-29T00:05:51Z | |
| dc.date.available | 2018-03-29T00:05:51Z | |
| dc.identifier | Journal Of Mathematical Imaging And Vision. Springer, v. 35, n. 2, n. 128, n. 142, 2009. | |
| dc.identifier | 0924-9907 | |
| dc.identifier | WOS:000268191700003 | |
| dc.identifier | 10.1007/s10851-009-0159-9 | |
| dc.identifier | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/81093 | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/81093 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/81093 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1282584 | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.description | Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) | |
| dc.description | 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. | |
| dc.description | 35 | |
| dc.description | 2 | |
| dc.description | 128 | |
| dc.description | 142 | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.description | Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.description | Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) | |
| dc.description | FAPESP [05/598080, 07/52015-0] | |
| dc.description | CNPq [302617/2007-8, 472402/2007-2] | |
| dc.language | en | |
| dc.publisher | Springer | |
| dc.publisher | Dordrecht | |
| dc.publisher | Holanda | |
| dc.relation | Journal Of Mathematical Imaging And Vision | |
| dc.relation | J. Math. Imaging Vis. | |
| dc.rights | fechado | |
| dc.rights | http://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0 | |
| dc.source | Web of Science | |
| dc.subject | Image segmentation based on optimum-path forest | |
| dc.subject | Graph-cut segmentation | |
| dc.subject | Image foresting transform | |
| dc.subject | Graph-based image segmentation | |
| dc.subject | Relative Fuzzy Connectedness | |
| dc.subject | Object Definition | |
| dc.subject | Multiple Objects | |
| dc.subject | Normalized Cuts | |
| dc.subject | Algorithms | |
| dc.subject | Transform | |
| dc.subject | Volumes | |
| dc.subject | 3-d | |
| dc.title | Links Between Image Segmentation Based on Optimum-Path Forest and Minimum Cut in Graph | |
| dc.type | Artículos de revistas | |
