Iterative design of morphological binary image operators (2000)
- Authors:
- USP affiliated authors: HIRATA, NINA SUMIKO TOMITA - IME ; BARRERA, JUNIOR - IME
- Unidade: IME
- DOI: 10.1117/1.1327178
- Subjects: COMPUTAÇÃO GRÁFICA; PROCESSAMENTO DE IMAGENS
- Keywords: filter design; mathematical morphology; optimal filters; pattern recognition
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: Bellingham
- Date published: 2000
- Source:
- Título do periódico: Optical Engineering
- ISSN: 0091-3286
- Volume/Número/Paginação/Ano: v. 39, n. 12, p. 3106-3123, 2000
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: bronze
-
ABNT
HIRATA, Nina Sumiko Tomita e DOUGHERTY, Edward R. e BARRERA, Júnior. Iterative design of morphological binary image operators. Optical Engineering, v. 39, n. 12, p. 3106-3123, 2000Tradução . . Disponível em: https://doi.org/10.1117/1.1327178. Acesso em: 19 set. 2024. -
APA
Hirata, N. S. T., Dougherty, E. R., & Barrera, J. (2000). Iterative design of morphological binary image operators. Optical Engineering, 39( 12), 3106-3123. doi:10.1117/1.1327178 -
NLM
Hirata NST, Dougherty ER, Barrera J. Iterative design of morphological binary image operators [Internet]. Optical Engineering. 2000 ; 39( 12): 3106-3123.[citado 2024 set. 19 ] Available from: https://doi.org/10.1117/1.1327178 -
Vancouver
Hirata NST, Dougherty ER, Barrera J. Iterative design of morphological binary image operators [Internet]. Optical Engineering. 2000 ; 39( 12): 3106-3123.[citado 2024 set. 19 ] Available from: https://doi.org/10.1117/1.1327178 - Automatic programming of binary morphological machines by design of statistically optimal operators in the context of computational learning theory
- A unifying view for stack filter design based on graph search methods
- Bayesian switching algorithm for the optimal increasing binary filter
- High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI)
- Identification of input-free finite lattice dynamical systems under envelope constraints
- Basis computation algorithms
- Automatic programming of morphological machines by PAC learning
- Multi-resolution classification trees in OCR design
- Modeling temporal morphological systems via lattice dynamical systems
- The incremental splitting of intervals algorithm for the design of binary image operators
Informações sobre o DOI: 10.1117/1.1327178 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
