Fields from Markov chains

被引：1

作者：

Justesen, J ^{[1
]}

机构：

[1] Tech Univ Denmark, COM, DK-2800 Lyngby, Denmark

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2005年 / 51卷 / 12期

关键词：

Markov chain; Markov random field; two-dimensional (2-D) field;

D O I：

10.1109/TIT.2005.858988

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A simple construction of two-dimensional (2-D) fields is presented. Rows and columns are outcomes of the same Markov chain. The entropy can be calculated explicitly.

引用

页码：4358 / 4362

页数：5

共 9 条

[1] Stationary Markov random fields on a finite rectangular lattice [J].

Champagnat, F ;

Idier, J ;

Goussard, Y .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (07) :2901-2916

[2] Entropy bounds for constrained two-dimensional random fields [J].

Forchhammer, S ;

Justesen, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (01) :118-127

[3] Codes for digital recorders [J].

Immink, KAS ;

Siegel, PH ;

Wolf, JK .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2260-2299

[4] Simple models of two-dimensional information sources and codes [J].

Justesen, J ;

Shtarkov, YM .

1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, :412-412

[5]

JUSTESEN J, 1998, CODES CURVES SIGNALS

[6] UNILATERAL MARKOV-FIELDS [J].

PICKARD, DK .

ADVANCES IN APPLIED PROBABILITY, 1980, 12 (03) :655-671

[7] CURIOUS BINARY LATTICE PROCESS [J].

PICKARD, DK .

JOURNAL OF APPLIED PROBABILITY, 1977, 14 (04) :717-731

[8] Efficient coding schemes for the hard-square model [J].

Roth, RM ;

Siegel, PH ;

Wolf, JK .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (03) :1166-1176

[9] A MATHEMATICAL THEORY OF COMMUNICATION [J].

SHANNON, CE .

BELL SYSTEM TECHNICAL JOURNAL, 1948, 27 (03) :379-423

← 1 →