Path-value functions for which Dijkstra’s algorithm returns optimal mapping (2018)
- Authors:
- Autor USP: MIRANDA, PAULO ANDRE VECHIATTO DE - IME
- Unidade: IME
- DOI: 10.1007/s10851-018-0793-1
- Subjects: PROCESSAMENTO DE IMAGENS; VISÃO COMPUTACIONAL
- Keywords: Dijkstra’s algorithm; graph-search algorithms; image foresting transform; connectivity functions
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Journal of Mathematical Imaging and Vision
- ISSN: 0924-9907
- Volume/Número/Paginação/Ano: v. 60, n. 7, p. 1025–1036, 2018
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
CIESIELSKI, Krzysztof Chris e FALCÃO, Alexandre Xavier e MIRANDA, Paulo André Vechiatto de. Path-value functions for which Dijkstra’s algorithm returns optimal mapping. Journal of Mathematical Imaging and Vision, v. 60, n. 7, p. 1025–1036, 2018Tradução . . Disponível em: https://doi.org/10.1007/s10851-018-0793-1. Acesso em: 18 abr. 2024. -
APA
Ciesielski, K. C., Falcão, A. X., & Miranda, P. A. V. de. (2018). Path-value functions for which Dijkstra’s algorithm returns optimal mapping. Journal of Mathematical Imaging and Vision, 60( 7), 1025–1036. doi:10.1007/s10851-018-0793-1 -
NLM
Ciesielski KC, Falcão AX, Miranda PAV de. Path-value functions for which Dijkstra’s algorithm returns optimal mapping [Internet]. Journal of Mathematical Imaging and Vision. 2018 ; 60( 7): 1025–1036.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1007/s10851-018-0793-1 -
Vancouver
Ciesielski KC, Falcão AX, Miranda PAV de. Path-value functions for which Dijkstra’s algorithm returns optimal mapping [Internet]. Journal of Mathematical Imaging and Vision. 2018 ; 60( 7): 1025–1036.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1007/s10851-018-0793-1 - A case analysis of the impact of prior center of gravity estimation over skull-stripping algorithms in MR images
- TSS & TSB: tensor scale descriptors within circular sectors for fast shape retrieval
- Relative fuzzy connectedness on directed graphs and its application in a hybrid method for interactive image segmentation
- Object segmentation by oriented image foresting transform with connectivity constraints
- Towards interactive image segmentation by dynamic and iterative spanning forest
- Intelligent understanding of user interaction in image segmentation
- Oriented image foresting transform segmentation with connectivity constraints
- Edge detection robust to intensity inhomogeneity: a 7T MRI case study
- Seed robustness of oriented relative fuzzy connectedness: core computation and its applications
- Oriented relative fuzzy connectedness: theory, algorithms, and its applications in hybrid image segmentation methods
Informações sobre o DOI: 10.1007/s10851-018-0793-1 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2879101.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
