Building networks for image segmentation using particle competition and cooperation
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Tipo de documento: | Artigo de conferência |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1007/978-3-319-62392-4_16 http://hdl.handle.net/11449/170014 |
Resumo: | Particle competition and cooperation (PCC) is a graph-based semi-supervised learning approach. When PCC is applied to interactive image segmentation tasks, pixels are converted into network nodes, and each node is connected to its k-nearest neighbors, according to the distance between a set of features extracted from the image. Building a proper network to feed PCC is crucial to achieve good segmentation results. However, some features may be more important than others to identify the segments, depending on the characteristics of the image to be segmented. In this paper, an index to evaluate candidate networks is proposed. Thus, building the network becomes a problem of optimizing some feature weights based on the proposed index. Computer simulations are performed on some real-world images from the Microsoft GrabCut database, and the segmentation results related in this paper show the effectiveness of the proposed method. |
id |
UNSP_8413a007ec1ef1249cfd4d9e36e2eea5 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/170014 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Building networks for image segmentation using particle competition and cooperationComplex networksImage segmentationParticle competition and cooperationParticle competition and cooperation (PCC) is a graph-based semi-supervised learning approach. When PCC is applied to interactive image segmentation tasks, pixels are converted into network nodes, and each node is connected to its k-nearest neighbors, according to the distance between a set of features extracted from the image. Building a proper network to feed PCC is crucial to achieve good segmentation results. However, some features may be more important than others to identify the segments, depending on the characteristics of the image to be segmented. In this paper, an index to evaluate candidate networks is proposed. Thus, building the network becomes a problem of optimizing some feature weights based on the proposed index. Computer simulations are performed on some real-world images from the Microsoft GrabCut database, and the segmentation results related in this paper show the effectiveness of the proposed method.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)São Paulo State University (UNESP)São Paulo State University (UNESP)FAPESP: #2016/05669-4CNPq: #475717/2013-9Universidade Estadual Paulista (Unesp)Breve, Fabricio [UNESP]2018-12-11T16:48:45Z2018-12-11T16:48:45Z2017-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject217-231http://dx.doi.org/10.1007/978-3-319-62392-4_16Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10404, p. 217-231.1611-33490302-9743http://hdl.handle.net/11449/17001410.1007/978-3-319-62392-4_162-s2.0-85027115765Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)0,295info:eu-repo/semantics/openAccess2021-10-23T21:44:18Zoai:repositorio.unesp.br:11449/170014Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T20:02:36.231096Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Building networks for image segmentation using particle competition and cooperation |
title |
Building networks for image segmentation using particle competition and cooperation |
spellingShingle |
Building networks for image segmentation using particle competition and cooperation Breve, Fabricio [UNESP] Complex networks Image segmentation Particle competition and cooperation |
title_short |
Building networks for image segmentation using particle competition and cooperation |
title_full |
Building networks for image segmentation using particle competition and cooperation |
title_fullStr |
Building networks for image segmentation using particle competition and cooperation |
title_full_unstemmed |
Building networks for image segmentation using particle competition and cooperation |
title_sort |
Building networks for image segmentation using particle competition and cooperation |
author |
Breve, Fabricio [UNESP] |
author_facet |
Breve, Fabricio [UNESP] |
author_role |
author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) |
dc.contributor.author.fl_str_mv |
Breve, Fabricio [UNESP] |
dc.subject.por.fl_str_mv |
Complex networks Image segmentation Particle competition and cooperation |
topic |
Complex networks Image segmentation Particle competition and cooperation |
description |
Particle competition and cooperation (PCC) is a graph-based semi-supervised learning approach. When PCC is applied to interactive image segmentation tasks, pixels are converted into network nodes, and each node is connected to its k-nearest neighbors, according to the distance between a set of features extracted from the image. Building a proper network to feed PCC is crucial to achieve good segmentation results. However, some features may be more important than others to identify the segments, depending on the characteristics of the image to be segmented. In this paper, an index to evaluate candidate networks is proposed. Thus, building the network becomes a problem of optimizing some feature weights based on the proposed index. Computer simulations are performed on some real-world images from the Microsoft GrabCut database, and the segmentation results related in this paper show the effectiveness of the proposed method. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017-01-01 2018-12-11T16:48:45Z 2018-12-11T16:48:45Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/conferenceObject |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1007/978-3-319-62392-4_16 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10404, p. 217-231. 1611-3349 0302-9743 http://hdl.handle.net/11449/170014 10.1007/978-3-319-62392-4_16 2-s2.0-85027115765 |
url |
http://dx.doi.org/10.1007/978-3-319-62392-4_16 http://hdl.handle.net/11449/170014 |
identifier_str_mv |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10404, p. 217-231. 1611-3349 0302-9743 10.1007/978-3-319-62392-4_16 2-s2.0-85027115765 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 0,295 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
217-231 |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808129153723006976 |