Classification of binary random patterns
From MaRDI portal
Publication:5337676
DOI10.1109/TIT.1965.1053827zbMath0129.11801OpenAlexW2073385196MaRDI QIDQ5337676
Kenneth Abend, Thomas J. Jun. Harley, Laveen N. Kanal
Publication date: 1965
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1965.1053827
Related Items (13)
An analytic solution for estimating two-dimensional hidden Markov models ⋮ Facies modeling using a Markov mesh model specification ⋮ On a nonparametric resampling scheme for Markov random fields ⋮ Texture synthesis and nonparametric resampling of random fields ⋮ How to Pretend That Correlated Variables Are Independent by Using Difference Observations ⋮ The pattern discrimination problem from the perspective of relation theory ⋮ Integration of Markov mesh models and data assimilation techniques in complex reservoirs ⋮ The use of context in pattern recognition ⋮ Image analysis with partially ordered Markov models. ⋮ A multiple-try Metropolis-Hastings algorithm with tailored proposals ⋮ Least-square methods in abstract pattern recognition ⋮ Prior specification for binary Markov mesh models ⋮ Ensemble updating of categorical state vectors
This page was built for publication: Classification of binary random patterns
