Efficient component-hypertree construction based on hierarchy of partitions (2020)
- Authors:
- USP affiliated authors: HASHIMOTO, RONALDO FUMIO - IME ; MORIMITSU, ALEXANDRE - IME
- Unidade: IME
- DOI: 10.1016/j.patrec.2020.02.032
- Subjects: PROCESSAMENTO DE IMAGENS; ALGORITMOS PARA IMAGENS
- Keywords: mathematical morphology; component-hypertree; component tree; connected operators; hierarchy of partitions
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Pattern Recognition Letters
- ISSN: 0167-8655
- Volume/Número/Paginação/Ano: v. 135, p. 30-37, 2020
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
- Licença: other-oa
-
ABNT
MORIMITSU, Alexandre et al. Efficient component-hypertree construction based on hierarchy of partitions. Pattern Recognition Letters, v. 135, p. 30-37, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2020.02.032. Acesso em: 04 out. 2024. -
APA
Morimitsu, A., Passat, N., Alves, W. A. L., & Hashimoto, R. F. (2020). Efficient component-hypertree construction based on hierarchy of partitions. Pattern Recognition Letters, 135, 30-37. doi:10.1016/j.patrec.2020.02.032 -
NLM
Morimitsu A, Passat N, Alves WAL, Hashimoto RF. Efficient component-hypertree construction based on hierarchy of partitions [Internet]. Pattern Recognition Letters. 2020 ; 135 30-37.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.patrec.2020.02.032 -
Vancouver
Morimitsu A, Passat N, Alves WAL, Hashimoto RF. Efficient component-hypertree construction based on hierarchy of partitions [Internet]. Pattern Recognition Letters. 2020 ; 135 30-37.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.patrec.2020.02.032 - Ultimate levelings with strategy for filtering undesirable residues based on machine learning
- Incremental bit-quads count in tree of shapes
- Incremental attribute computation in component-hypertrees
- Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies
- Computação incremental e eficiente de sequências de árvores de componentes
- Algorithms and data structure for component-hypertrees of gray-level images
- Extraction of numerical residues in families of levelings
- An extension of an algorithm for finding sequential decomposition of erosions and dilations
- Incremental and efficient computation of families of component trees
- Biological sequence analysis using complex networks and entropy maximization: a case study in SARS-CoV-2
Informações sobre o DOI: 10.1016/j.patrec.2020.02.032 (Fonte: oaDOI API)
Download do texto completo
Tipo | Nome | Link | |
---|---|---|---|
2998237.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas