A unifying view for stack filter design based on graph search methods (2005)
- Authors:
- USP affiliated authors: HIRATA, NINA SUMIKO TOMITA - IME ; BARRERA, JUNIOR - IME
- Unidade: IME
- DOI: 10.1016/j.patcog.2005.02.018
- Assunto: COMPUTAÇÃO GRÁFICA
- Keywords: Stack filter; Positive boolean function; Threshold decomposition; Mathematical morphology; Filter design; Boolean lattice; Graph search methods
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Pattern Recognition
- ISSN: 0031-3203
- Volume/Número/Paginação/Ano: v. 38, n. 11, p. 2088-2098, 2005
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
HIRATA, Nina Sumiko Tomita e BARRERA, Júnior. A unifying view for stack filter design based on graph search methods. Pattern Recognition, v. 38, n. 11, p. 2088-2098, 2005Tradução . . Disponível em: https://doi.org/10.1016/j.patcog.2005.02.018. Acesso em: 27 dez. 2025. -
APA
Hirata, N. S. T., & Barrera, J. (2005). A unifying view for stack filter design based on graph search methods. Pattern Recognition, 38( 11), 2088-2098. doi:10.1016/j.patcog.2005.02.018 -
NLM
Hirata NST, Barrera J. A unifying view for stack filter design based on graph search methods [Internet]. Pattern Recognition. 2005 ; 38( 11): 2088-2098.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1016/j.patcog.2005.02.018 -
Vancouver
Hirata NST, Barrera J. A unifying view for stack filter design based on graph search methods [Internet]. Pattern Recognition. 2005 ; 38( 11): 2088-2098.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1016/j.patcog.2005.02.018 - Iterative design of morphological binary image operators
- Bayesian switching algorithm for the optimal increasing binary filter
- High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI)
- Automatic programming of binary morphological machines by design of statistically optimal operators in the context of computational learning theory
- 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.1016/j.patcog.2005.02.018 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
