Graph-based image segmentation with shape priors and Local Band constraints

Detalhes bibliográficos
Autor(a) principal: Braz, Caio de Moraes
Data de Publicação: 2023
Tipo de documento: Tese
Idioma: eng
Título da fonte: Biblioteca Digital de Teses e Dissertações da USP
Texto Completo: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-23102023-185505/
Resumo: The goal of this work is to describe an efficient algorithm for finding a binary segmentation of an image such that: the indicated object satisfies a novel high-level prior, called Local Band, LB, constraint; the returned segmentation is optimal, with respect to an appropriate graph cut measure, among all segmentations satisfying the given LB constraint. The new algorithm has two stages: expanding the number of arcs of a standard edge-weighted graph of an image; applying to this new weighted graph an algorithm known as an Oriented Image Foresting Transform, OIFT. In our theoretical investigations, we discuss the theoretical relationships of LB with other shape constraints and prove that OIFT algorithm belongs to a class of General Fuzzy Connectedness algorithms and so, has several good theoretical properties, like robustness for seed placement. The extension of the graph constructed in the first stage ensures, as we prove, that the resulted object indeed satisfies the given LB constraint. For purposes of computational efficiency, we consider the least number of arcs needed to guarantee the constraint. This graph construction is flexible enough to allow combining it with other high-level constraints. For the particular case of LB with infinite radius, this case called Band constraint, we also present an efficient algorithm, with proof of correctness, which can be applied directly to the original image graph. Finally, we experimentally demonstrate that the LB constraint gives competitive results as compared to Geodesic Star Convexity, Boundary Band, and Hedgehog Shape Prior, all implemented within OIFT framework and applied to various scenarios involving natural and medical images.
id USP_465e2fd710fc040e2e6a4b08681bff5d
oai_identifier_str oai:teses.usp.br:tde-23102023-185505
network_acronym_str USP
network_name_str Biblioteca Digital de Teses e Dissertações da USP
repository_id_str 2721
spelling Graph-based image segmentation with shape priors and Local Band constraintsSegmentação de imagens baseada em grafos com modelos de forma e restrições de banda localBoundary band constraintGraph-cut segmentationHedgehog shape priorHedgehog shape priorImage foresting transformRestrição de bandaSegmentação por corte em grafosTransformada imagem-florestaThe goal of this work is to describe an efficient algorithm for finding a binary segmentation of an image such that: the indicated object satisfies a novel high-level prior, called Local Band, LB, constraint; the returned segmentation is optimal, with respect to an appropriate graph cut measure, among all segmentations satisfying the given LB constraint. The new algorithm has two stages: expanding the number of arcs of a standard edge-weighted graph of an image; applying to this new weighted graph an algorithm known as an Oriented Image Foresting Transform, OIFT. In our theoretical investigations, we discuss the theoretical relationships of LB with other shape constraints and prove that OIFT algorithm belongs to a class of General Fuzzy Connectedness algorithms and so, has several good theoretical properties, like robustness for seed placement. The extension of the graph constructed in the first stage ensures, as we prove, that the resulted object indeed satisfies the given LB constraint. For purposes of computational efficiency, we consider the least number of arcs needed to guarantee the constraint. This graph construction is flexible enough to allow combining it with other high-level constraints. For the particular case of LB with infinite radius, this case called Band constraint, we also present an efficient algorithm, with proof of correctness, which can be applied directly to the original image graph. Finally, we experimentally demonstrate that the LB constraint gives competitive results as compared to Geodesic Star Convexity, Boundary Band, and Hedgehog Shape Prior, all implemented within OIFT framework and applied to various scenarios involving natural and medical images.O objetivo deste trabalho é descrever um algoritmo eficiente para encontrar uma segmentação binária de uma imagem tal que: o objeto indicado satisfaz uma nova restrição de alto nível, chamada restrição de banda local, LB; a segmentação devolvida é ótima, em respeito a uma medida de corte em grafos apropriada, entre todas as segmentações que satisfaçam a restrição LB dada. O novo algoritmo tem dois estágios: expandir o número de arcos de um grafo tradicional de imagem; aplicando a este novo grafo com pesos, um algoritmo conhecido como Transformada Imagem-Floresta Orientada, OIFT. Em nossos trabalhos teóricos, discutimos as relações teóricas da LB com outras restrições de forma e provamos que o algoritmo da OIFT pertence a uma classe de algoritmos gerais de conexão difusa (\\textit{General Fuzzy Connectedness}) e, portanto, possui várias propriedades teóricas, como robustez ao posicionamento de sementes. A extensão do grafo construído no primeiro estágio garante, como provamos, que o objeto resultante realmente satisfaz a restrição LB dada. Para efeitos de eficiência computacional, consideramos o menor número de arcos possível necessário para garantir a restrição. Esta construção de grafo é flexível o suficiente para permitir combiná-la com outras restrições de alto nível. Para o caso particular da LB com raio infinito, caso este chamado de restrição de banda, também apresentamos um algoritmo eficiente, com prova de corretude, que pode ser aplicado diretamente sobre o grafo de imagem original. Finalmente, demonstramos experimentalmente que a restrição LB possui resultados competitivos quando comparada com a convexidade geodésica em estrela, restrição de banda de borda e \\textit{Hedgehog Shape Prior}, todos implementados dentro do arcabouço da OIFT e aplicados a vários cenários envolvendo imagens naturais e médicas.Biblioteca Digitais de Teses e Dissertações da USPMiranda, Paulo Andre Vechiatto deBraz, Caio de Moraes2023-03-03info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisapplication/pdfhttps://www.teses.usp.br/teses/disponiveis/45/45134/tde-23102023-185505/reponame:Biblioteca Digital de Teses e Dissertações da USPinstname:Universidade de São Paulo (USP)instacron:USPLiberar o conteúdo para acesso público.info:eu-repo/semantics/openAccesseng2023-10-31T22:15:02Zoai:teses.usp.br:tde-23102023-185505Biblioteca Digital de Teses e Dissertaçõeshttp://www.teses.usp.br/PUBhttp://www.teses.usp.br/cgi-bin/mtd2br.plvirginia@if.usp.br|| atendimento@aguia.usp.br||virginia@if.usp.bropendoar:27212023-10-31T22:15:02Biblioteca Digital de Teses e Dissertações da USP - Universidade de São Paulo (USP)false
dc.title.none.fl_str_mv Graph-based image segmentation with shape priors and Local Band constraints
Segmentação de imagens baseada em grafos com modelos de forma e restrições de banda local
title Graph-based image segmentation with shape priors and Local Band constraints
spellingShingle Graph-based image segmentation with shape priors and Local Band constraints
Braz, Caio de Moraes
Boundary band constraint
Graph-cut segmentation
Hedgehog shape prior
Hedgehog shape prior
Image foresting transform
Restrição de banda
Segmentação por corte em grafos
Transformada imagem-floresta
title_short Graph-based image segmentation with shape priors and Local Band constraints
title_full Graph-based image segmentation with shape priors and Local Band constraints
title_fullStr Graph-based image segmentation with shape priors and Local Band constraints
title_full_unstemmed Graph-based image segmentation with shape priors and Local Band constraints
title_sort Graph-based image segmentation with shape priors and Local Band constraints
author Braz, Caio de Moraes
author_facet Braz, Caio de Moraes
author_role author
dc.contributor.none.fl_str_mv Miranda, Paulo Andre Vechiatto de
dc.contributor.author.fl_str_mv Braz, Caio de Moraes
dc.subject.por.fl_str_mv Boundary band constraint
Graph-cut segmentation
Hedgehog shape prior
Hedgehog shape prior
Image foresting transform
Restrição de banda
Segmentação por corte em grafos
Transformada imagem-floresta
topic Boundary band constraint
Graph-cut segmentation
Hedgehog shape prior
Hedgehog shape prior
Image foresting transform
Restrição de banda
Segmentação por corte em grafos
Transformada imagem-floresta
description The goal of this work is to describe an efficient algorithm for finding a binary segmentation of an image such that: the indicated object satisfies a novel high-level prior, called Local Band, LB, constraint; the returned segmentation is optimal, with respect to an appropriate graph cut measure, among all segmentations satisfying the given LB constraint. The new algorithm has two stages: expanding the number of arcs of a standard edge-weighted graph of an image; applying to this new weighted graph an algorithm known as an Oriented Image Foresting Transform, OIFT. In our theoretical investigations, we discuss the theoretical relationships of LB with other shape constraints and prove that OIFT algorithm belongs to a class of General Fuzzy Connectedness algorithms and so, has several good theoretical properties, like robustness for seed placement. The extension of the graph constructed in the first stage ensures, as we prove, that the resulted object indeed satisfies the given LB constraint. For purposes of computational efficiency, we consider the least number of arcs needed to guarantee the constraint. This graph construction is flexible enough to allow combining it with other high-level constraints. For the particular case of LB with infinite radius, this case called Band constraint, we also present an efficient algorithm, with proof of correctness, which can be applied directly to the original image graph. Finally, we experimentally demonstrate that the LB constraint gives competitive results as compared to Geodesic Star Convexity, Boundary Band, and Hedgehog Shape Prior, all implemented within OIFT framework and applied to various scenarios involving natural and medical images.
publishDate 2023
dc.date.none.fl_str_mv 2023-03-03
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/doctoralThesis
format doctoralThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://www.teses.usp.br/teses/disponiveis/45/45134/tde-23102023-185505/
url https://www.teses.usp.br/teses/disponiveis/45/45134/tde-23102023-185505/
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv
dc.rights.driver.fl_str_mv Liberar o conteúdo para acesso público.
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Liberar o conteúdo para acesso público.
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.coverage.none.fl_str_mv
dc.publisher.none.fl_str_mv Biblioteca Digitais de Teses e Dissertações da USP
publisher.none.fl_str_mv Biblioteca Digitais de Teses e Dissertações da USP
dc.source.none.fl_str_mv
reponame:Biblioteca Digital de Teses e Dissertações da USP
instname:Universidade de São Paulo (USP)
instacron:USP
instname_str Universidade de São Paulo (USP)
instacron_str USP
institution USP
reponame_str Biblioteca Digital de Teses e Dissertações da USP
collection Biblioteca Digital de Teses e Dissertações da USP
repository.name.fl_str_mv Biblioteca Digital de Teses e Dissertações da USP - Universidade de São Paulo (USP)
repository.mail.fl_str_mv virginia@if.usp.br|| atendimento@aguia.usp.br||virginia@if.usp.br
_version_ 1809091026633097216