Automatic programming of binary morphological machines by design of statistically optimal operators in the context of computational learning theory (1996)
- Autores:
- Autores USP: BARRERA, JUNIOR - IME ; HIRATA, NINA SUMIKO TOMITA - IME
- Unidade: IME
- Assunto: METODOLOGIA E TÉCNICAS DE COMPUTAÇÃO
- Idioma: Inglês
- Imprenta:
-
ABNT
BARRERA, Júnior e DOUGHERTY, Edward R e HIRATA, Nina Sumiko Tomita. Automatic programming of binary morphological machines by design of statistically optimal operators in the context of computational learning theory. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/eba8ff38-ea3d-4331-a24c-7e42464ed790/907285.pdf. Acesso em: 24 abr. 2024. , 1996 -
APA
Barrera, J., Dougherty, E. R., & Hirata, N. S. T. (1996). Automatic programming of binary morphological machines by design of statistically optimal operators in the context of computational learning theory. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/eba8ff38-ea3d-4331-a24c-7e42464ed790/907285.pdf -
NLM
Barrera J, Dougherty ER, Hirata NST. Automatic programming of binary morphological machines by design of statistically optimal operators in the context of computational learning theory [Internet]. 1996 ;[citado 2024 abr. 24 ] Available from: https://repositorio.usp.br/directbitstream/eba8ff38-ea3d-4331-a24c-7e42464ed790/907285.pdf -
Vancouver
Barrera J, Dougherty ER, Hirata NST. Automatic programming of binary morphological machines by design of statistically optimal operators in the context of computational learning theory [Internet]. 1996 ;[citado 2024 abr. 24 ] Available from: https://repositorio.usp.br/directbitstream/eba8ff38-ea3d-4331-a24c-7e42464ed790/907285.pdf - Iterative design of morphological binary image operators
- 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
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 907285.pdf | Direct link |
Como citar
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
