Efficient connected alternating sequential filters based on component trees (2025)
- Authors:
- USP affiliated authors: HASHIMOTO, RONALDO FUMIO - IME ; SILVA, DÊNNIS JOSÉ DA - IME ; MORIMITSU, ALEXANDRE - IME
- Unidade: IME
- DOI: 10.1007/978-3-032-09544-2_15
- Subjects: ESTRUTURAS DE DADOS; OPERADORES E COMPILADORES; ALGORITMOS
- Keywords: Árvores de componentes
- Language: Inglês
- Imprenta:
- Source:
- Título: Lecture Notes in Computer Science
- ISSN: 0302-9743
- Volume/Número/Paginação/Ano: v. 16296, p. 210-223, 2025
- Conference titles: International Conference on Discrete Geometry and Mathematical Morphology - DGMM
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
ALVES, Wonder Alexandre Luz et al. Efficient connected alternating sequential filters based on component trees. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-032-09544-2_15. Acesso em: 27 dez. 2025. , 2025 -
APA
Alves, W. A. L., Passat, N., Silva, D. J. da, Morimitsu, A., & Hashimoto, R. F. (2025). Efficient connected alternating sequential filters based on component trees. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-032-09544-2_15 -
NLM
Alves WAL, Passat N, Silva DJ da, Morimitsu A, Hashimoto RF. Efficient connected alternating sequential filters based on component trees [Internet]. Lecture Notes in Computer Science. 2025 ; 16296 210-223.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1007/978-3-032-09544-2_15 -
Vancouver
Alves WAL, Passat N, Silva DJ da, Morimitsu A, Hashimoto RF. Efficient connected alternating sequential filters based on component trees [Internet]. Lecture Notes in Computer Science. 2025 ; 16296 210-223.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1007/978-3-032-09544-2_15 - Ultimate levelings with strategy for filtering undesirable residues based on machine learning
- Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies
- Incremental attribute computation in component-hypertrees
- Incremental bit-quads count in tree of shapes
- Incremental component tree contour computation
- Efficient component-hypertree construction based on hierarchy of partitions
- Interactive image manipulation using morphological trees and spline-based skeletons
- Incremental bit-quads count in component trees: theory, algorithms, and optimization
- Differential maximum euclidean distance transform computation in component trees
- Contagem incremental de padrões locais em árvores de componentes para cálculo de atributos
Informações sobre o DOI: 10.1007/978-3-032-09544-2_15 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3259076.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
