Classification of binary random patterns

DOI10.1109/TIT.1965.1053827MaRDI QIDQ5337676zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

information, communication

Cited in

(13)

• Prior specification for binary Markov mesh models
• An analytic solution for estimating two-dimensional hidden Markov models
• Integration of Markov mesh models and data assimilation techniques in complex reservoirs
• A multiple-try Metropolis-Hastings algorithm with tailored proposals
• How to Pretend That Correlated Variables Are Independent by Using Difference Observations
• Image analysis with partially ordered Markov models.
• The use of context in pattern recognition
• On a nonparametric resampling scheme for Markov random fields
• Facies modeling using a Markov mesh model specification
• Texture synthesis and nonparametric resampling of random fields
• The pattern discrimination problem from the perspective of relation theory
• Least-square methods in abstract pattern recognition
• Ensemble updating of categorical state vectors

This page was built for publication: Classification of binary random patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5337676)