Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||Graph Cut And Image Segmentation Using Mean Cut By Means Of An Agglomerative Algorithm|
De Carvalho M.A.G.
Da Costa A.L.
|Abstract:||Graph partitioning, or graph cut, has been studied by several authors as a tool for image segmentation. It refers to partitioning a graph into several subgraphs such that each of them represents a meaningful object of interest in the image. In this work we propose a hierarchical agglomerative clustering algorithm driven by the cut and mean cut criteria. Some preliminary experiments were performed using the benchmark of Berkeley BSDS500 with promising results. Copyright © 2014 SCITEPRESS - Science and Technology Publications. All rights reserved.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.