ROBUST TWO-DIMENSIONAL TREE ENCODING OF IMAGES.

James W. Modestino, V. Bhaskaran

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

A class of robust two-dimensional (2-D) tree coding procedures are described for efficient encoding of monochrome images. The encoding filter is designed on the basis of ensemble properties of a particular class of stochastic random fields which have been shown to provide a useful model for typical imagery data. The (M; K',L') algorithm is used in instrumenting the 2-D tree search. Results are demonstrated for both synthetic images and a number of head-and-shoulders images. These results demonstrate the effectiveness of 2-D tree encoding using fairly moderate search intensities and the inherent robustness of 2-D tree encoding more generally. In particular, it is demonstrated that, by logical design of the encoding filter under an appropriate stochastic modeling assumption, the 2-D tree encoder provides relatively efficient performance for a rather wide range of real-world imagery.

Original languageEnglish
Pages (from-to)1786-1798
Number of pages13
JournalIEEE Transactions on Communications
VolumeCOM-29
Issue number12
StatePublished - Dec 1 1981

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Modestino, J. W., & Bhaskaran, V. (1981). ROBUST TWO-DIMENSIONAL TREE ENCODING OF IMAGES. IEEE Transactions on Communications, COM-29(12), 1786-1798.

ROBUST TWO-DIMENSIONAL TREE ENCODING OF IMAGES. / Modestino, James W.; Bhaskaran, V.

In: IEEE Transactions on Communications, Vol. COM-29, No. 12, 01.12.1981, p. 1786-1798.

Research output: Contribution to journalArticle

Modestino, JW & Bhaskaran, V 1981, 'ROBUST TWO-DIMENSIONAL TREE ENCODING OF IMAGES.', IEEE Transactions on Communications, vol. COM-29, no. 12, pp. 1786-1798.
Modestino JW, Bhaskaran V. ROBUST TWO-DIMENSIONAL TREE ENCODING OF IMAGES. IEEE Transactions on Communications. 1981 Dec 1;COM-29(12):1786-1798.
Modestino, James W. ; Bhaskaran, V. / ROBUST TWO-DIMENSIONAL TREE ENCODING OF IMAGES. In: IEEE Transactions on Communications. 1981 ; Vol. COM-29, No. 12. pp. 1786-1798.
@article{b9b5620ccfb74a58bb6d9bcc5bb974a4,
title = "ROBUST TWO-DIMENSIONAL TREE ENCODING OF IMAGES.",
abstract = "A class of robust two-dimensional (2-D) tree coding procedures are described for efficient encoding of monochrome images. The encoding filter is designed on the basis of ensemble properties of a particular class of stochastic random fields which have been shown to provide a useful model for typical imagery data. The (M; K',L') algorithm is used in instrumenting the 2-D tree search. Results are demonstrated for both synthetic images and a number of head-and-shoulders images. These results demonstrate the effectiveness of 2-D tree encoding using fairly moderate search intensities and the inherent robustness of 2-D tree encoding more generally. In particular, it is demonstrated that, by logical design of the encoding filter under an appropriate stochastic modeling assumption, the 2-D tree encoder provides relatively efficient performance for a rather wide range of real-world imagery.",
author = "Modestino, {James W.} and V. Bhaskaran",
year = "1981",
month = "12",
day = "1",
language = "English",
volume = "COM-29",
pages = "1786--1798",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

T1 - ROBUST TWO-DIMENSIONAL TREE ENCODING OF IMAGES.

AU - Modestino, James W.

AU - Bhaskaran, V.

PY - 1981/12/1

Y1 - 1981/12/1

N2 - A class of robust two-dimensional (2-D) tree coding procedures are described for efficient encoding of monochrome images. The encoding filter is designed on the basis of ensemble properties of a particular class of stochastic random fields which have been shown to provide a useful model for typical imagery data. The (M; K',L') algorithm is used in instrumenting the 2-D tree search. Results are demonstrated for both synthetic images and a number of head-and-shoulders images. These results demonstrate the effectiveness of 2-D tree encoding using fairly moderate search intensities and the inherent robustness of 2-D tree encoding more generally. In particular, it is demonstrated that, by logical design of the encoding filter under an appropriate stochastic modeling assumption, the 2-D tree encoder provides relatively efficient performance for a rather wide range of real-world imagery.

AB - A class of robust two-dimensional (2-D) tree coding procedures are described for efficient encoding of monochrome images. The encoding filter is designed on the basis of ensemble properties of a particular class of stochastic random fields which have been shown to provide a useful model for typical imagery data. The (M; K',L') algorithm is used in instrumenting the 2-D tree search. Results are demonstrated for both synthetic images and a number of head-and-shoulders images. These results demonstrate the effectiveness of 2-D tree encoding using fairly moderate search intensities and the inherent robustness of 2-D tree encoding more generally. In particular, it is demonstrated that, by logical design of the encoding filter under an appropriate stochastic modeling assumption, the 2-D tree encoder provides relatively efficient performance for a rather wide range of real-world imagery.

UR - http://www.scopus.com/inward/record.url?scp=0019709493&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019709493&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0019709493

VL - COM-29

SP - 1786

EP - 1798

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 12

ER -