Efficient connected alternating sequential filters based on component trees (2025)
Fonte: Discrete Geometry and Mathematical Morphology. DGMM 2025. Lecture Notes in Computer Science. Nome do evento: International Conference on Discrete Geometry and Mathematical Morphology - DGMM. Unidade: IME
Assuntos: ESTRUTURAS DE DADOS, OPERADORES E COMPILADORES, ALGORITMOS
ABNT
ALVES, Wonder Alexandre Luz et al. Efficient connected alternating sequential filters based on component trees. Discrete Geometry and Mathematical Morphology. DGMM 2025. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://repositorio.usp.br/directbitstream/cbe2bed3-d534-4032-bfcc-c3e5380014d8/3259076.pdf. Acesso em: 02 nov. 2025. , 2025APA
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. Discrete Geometry and Mathematical Morphology. DGMM 2025. Lecture Notes in Computer Science. Cham: Springer. Recuperado de https://repositorio.usp.br/directbitstream/cbe2bed3-d534-4032-bfcc-c3e5380014d8/3259076.pdfNLM
Alves WAL, Passat N, Silva DJ da, Morimitsu A, Hashimoto RF. Efficient connected alternating sequential filters based on component trees [Internet]. Discrete Geometry and Mathematical Morphology. DGMM 2025. Lecture Notes in Computer Science. 2025 ;[citado 2025 nov. 02 ] Available from: https://repositorio.usp.br/directbitstream/cbe2bed3-d534-4032-bfcc-c3e5380014d8/3259076.pdfVancouver
Alves WAL, Passat N, Silva DJ da, Morimitsu A, Hashimoto RF. Efficient connected alternating sequential filters based on component trees [Internet]. Discrete Geometry and Mathematical Morphology. DGMM 2025. Lecture Notes in Computer Science. 2025 ;[citado 2025 nov. 02 ] Available from: https://repositorio.usp.br/directbitstream/cbe2bed3-d534-4032-bfcc-c3e5380014d8/3259076.pdf
