| Texto completo | |
| Autor(es): |
Silva, Dennis J.
;
Kosinka, Jiri
;
Hashimoto, Ronaldo F.
;
Roerdink, Jos B. T. M.
;
Morimitsu, Alexandre
;
Alves, Wonder A. L.
Número total de Autores: 6
|
| Tipo de documento: | Artigo Científico |
| Fonte: | PATTERN RECOGNITION LETTERS; v. 187, p. 7-pg., 2024-11-29. |
| Resumo | |
A component tree is a graph representation that encodes the connected components of the upper or lower level sets of a grayscale image. Consequently, the nodes of a component tree represent binary images of the encoded connected components. There exist various algorithms that efficiently extract information and attributes of nodes of a component tree by incrementally exploiting the subset relation encoding in the tree. However, to the best of our knowledge, there is no such incremental approach to extract the contours of the nodes. In this paper, we propose an efficient incremental method to compute the contours of the nodes of a component tree by counting the edges (sides) of contour pixels. In addition, we discuss our method's time complexity. We also experimentally show that our proposed method is faster than the standard approach based on node reconstruction. (AU) | |
| Processo FAPESP: | 15/22308-2 - Representações intermediárias em Ciência Computacional para descoberta de conhecimento |
| Beneficiário: | Roberto Marcondes Cesar Junior |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |
| Processo FAPESP: | 18/15652-7 - Segmentação de imagens baseada em restrições de formas por meio dos últimos levelings |
| Beneficiário: | Wonder Alexandre Luz Alves |
| Modalidade de apoio: | Auxílio à Pesquisa - Regular |