Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 251

The DOI matches its Crossref record.

Classification of binary random patterns

Abend, K., Harley, T., Kanal, L.·1965·IEEE Transactions on Information Theory

Abstract

In various pattern-recognition problems such as classification of photographic data, preprocessing operations result in a two-dimensional array of binary random variables. An optimal recipe for classifying such patterns is described. It combines the use of an orthonormal expansion for the logarithm of probability functions, with the generation of a joint probability distribution from lower-order marginals. The unwieldy nature of the optimal recipe leads to the consideration of dependence represented by a Markov chain and a two-dimensional analog called a Markov mesh. The Markov chain has a "reflecting" property in that therth order nonstationary chain implies that a point depends on itsrnearest neighbors on each side. By scanning along a grid-filling curve so that the2rneighbors of a point are geometrically close to it, certain spatial dependencies are obtained. The grid-filling curves are sequences of functions which have Hilbert "space-filling" curves as their limit. This simple approach does not provide for many of the spatial dependencies that should be considered. A novel extension of Markov chain methods into two dimensions leads to the Markov mesh which economically takes care of a much larger class of spatial dependencies. Likelihood ratio classification based on Markov chain and Markov mesh assumptions requires the estimation of a much smaller number of parameters than the general case. The development presented in this paper is new and need not be restricted to binary variables.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.1965.1053827

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 251

Metadata

Authors
Abend, K., Harley, T., & Kanal, L.
Venue
IEEE Transactions on Information Theory
Published
1965-10
Volume
11
Issue
4
Pages
538-544
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2073385196
Cited by
251
References
0
FWCI
2.78
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Classification of binary random patterns. https://app.cochat.ai/papers/10.1109/tit.1965.1053827
The paper
Abend, K., Harley, T., & Kanal, L. (1965). Classification of binary random patterns. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1965.1053827

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.