An efficient algorithm to update non-flat and incremental attributes in morphological trees (2022)
- Authors:
- Autor USP: HASHIMOTO, RONALDO FUMIO - IME
- Unidade: IME
- DOI: 10.1016/j.patrec.2022.09.005
- Assunto: PROCESSAMENTO DE IMAGENS
- Keywords: Morphological trees; Attribute filters; Incremental Attributes
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Pattern Recognition Letters
- ISSN: 0167-8655
- Volume/Número/Paginação/Ano: v. 163, p. 47-54, 2022
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
GOBBER, Charles F e HASHIMOTO, Ronaldo Fumio e ALVES, Wonder Alexandre Luz. An efficient algorithm to update non-flat and incremental attributes in morphological trees. Pattern Recognition Letters, v. 163, p. 47-54, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2022.09.005. Acesso em: 27 abr. 2024. -
APA
Gobber, C. F., Hashimoto, R. F., & Alves, W. A. L. (2022). An efficient algorithm to update non-flat and incremental attributes in morphological trees. Pattern Recognition Letters, 163, 47-54. doi:10.1016/j.patrec.2022.09.005 -
NLM
Gobber CF, Hashimoto RF, Alves WAL. An efficient algorithm to update non-flat and incremental attributes in morphological trees [Internet]. Pattern Recognition Letters. 2022 ; 163 47-54.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.patrec.2022.09.005 -
Vancouver
Gobber CF, Hashimoto RF, Alves WAL. An efficient algorithm to update non-flat and incremental attributes in morphological trees [Internet]. Pattern Recognition Letters. 2022 ; 163 47-54.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.patrec.2022.09.005 - 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
- Evaluation of the impact of initial positions obtained by clustering algorithms on the straight line segments classifier
- Is cross-validation better than resubstitution for ranking genes?
- Growing genetic regulatory networks from seed genes
- Inference of restricted stochastic Boolean GRN' s by Bayesian error and entropy based criteria
- A new training algorithm for pattern recognition technique based on straight line segments
- A Monte Carlo approach to measure the robustness of Boolean networks
- Growing seed genes from time series data and thresholded Boolean networks with perturbation
Informações sobre o DOI: 10.1016/j.patrec.2022.09.005 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 3123921.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
