English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30204
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Colour image segmentation solving hard-constraints on graph partitioning greedy algorithms

AuthorsVergés Llahí, Jaume; Climent Vilaro, Juan; Sanfeliu, Alberto
KeywordsPattern recognition: Computer vision
Computer vision
Issue Date2000
PublisherInstitute of Electrical and Electronics Engineers
Citation15th International Conference on Pattern Recognition: 625-628 (2000)
AbstractA graph partitioning greedy algorithm is presented. This algorithm avoids the hard-constraints of others similar approaches such as the impossibility for some regions to grow after certain step of the algorithm and the uniqueness of the solution. Nevertheless, it allows attaining global results by local approximations using a generalised concept of not over-segmentation, which includes an energy function, and eliminating the not sub-segmentation criterion using a probabilistic criterion similar to that of annealing. The high-variability region problems such as borders are also eliminated identifying them and distributing their pixels among the other neighbour regions. Thus, it is possible to keep the time complexity of usual graph partitioning greedy algorithm and avoiding its high variability region problems, obtaining better results.
DescriptionInternational Conference on Pattern Recognition (ICPR), 2000, Barcelona (España)
Appears in Collections:(IRII) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
doc1.pdf517,29 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.