New reduced discrete Euclidean nD medial axis with optimal algorithm

dc.creatorSaúde, André Vital
dc.date.accessioned2017-02-16T11:42:24Z
dc.date.available2017-02-16T11:42:24Z
dc.date.issued2011-01-01
dc.description.abstractSkeletons have been playing an important role in shape analysis since the introduction of the medial axis in the sixties. The original medial axis definition is in the continuous Euclidean space. It is a skeleton with the following characteristics: centered, thin, homotopic (it has the same topology as the object), and reversible (sufficient for the reconstruction of the object). The discrete version of the Euclidean medial axis (MA) is also reversible and centered, but no longer homotopic nor thin. The combination of the MA with homotopic thinning algorithms can result in a topology preserving, reversible skeleton. However, such combination may generate thicker skeletons, and the choice of the thinning algorithm is not obvious. A robust and well defined framework for fast homotopic thinning available in the literature is defined in the domain of abstract complexes. Since the abstract complexes are represented in a doubled resolution grid, some authors have extended the MA to a doubled resolution grid and defined the discrete Euclidean medial axis in higher resolution (HMA). The HMA can be combined with the thinning framework defined on abstract complexes. Other authors have given an alternative definition of medial axis, which is a subset of the MA, called reduced discrete medial axis (RDMA). The RDMA is reversible, thinner than the MA, and it can be computed in optimal time. In this paper, we extend the RDMA to the doubled resolution grid and we define the high-resolution RDMA (HRDMA). We provide an optimal algorithm to compute the HRDMA. The HRDMA can be combined with the thinning framework defined on abstract complexes. The skeleton obtained by such combination is provided with strong characteristics, not found in the literature.pt_BR
dc.description.provenanceSubmitted by Euzébio Pinto (euzebio.pinto@biblioteca.ufla.br) on 2017-02-16T11:38:20Z No. of bitstreams: 0en
dc.description.provenanceApproved for entry into archive by Euzébio Pinto (euzebio.pinto@biblioteca.ufla.br) on 2017-02-16T11:42:24Z (GMT) No. of bitstreams: 0en
dc.description.provenanceMade available in DSpace on 2017-02-16T11:42:24Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-01-01en
dc.identifier.citationSAÚDE, A. V. New reduced discrete Euclidean nD medial axis with optimal algorithm. Pattern Recognition Letters, Amsterdam, v. 32, n. 1, p. 91-99, Jan. 2011pt_BR
dc.identifier.urihttps://repositorio.ufla.br/handle/1/12274
dc.identifier.urihttp://www.sciencedirect.com/science/article/pii/S0167865510000644?np=y&npKey=a7379a552798ed3c01ce849a0dd59eae685277cd9d009433ab361babbf580ff9pt_BR
dc.languageen_USpt_BR
dc.publisherInternational Association for Pattern Recognitionpt_BR
dc.rightsrestrictAccesspt_BR
dc.sourcePattern Recognition Letterspt_BR
dc.subjectComputer algorithmspt_BR
dc.subjectEuclidean distance (Computer science)pt_BR
dc.subjectMedial axispt_BR
dc.subjectSkeleton (Computer Science)pt_BR
dc.subjectAlgorítmos computacionaispt_BR
dc.subjectDistância euclideana (Computação)pt_BR
dc.titleNew reduced discrete Euclidean nD medial axis with optimal algorithmpt_BR
dc.typeArtigopt_BR

Arquivos

Licença do pacote

Agora exibindo 1 - 1 de 1
Carregando...
Imagem de Miniatura
Nome:
license.txt
Tamanho:
953 B
Formato:
Item-specific license agreed upon to submission
Descrição: