Title :
Finite state models of constrained 2D data
Author_Institution :
COM, Tech. Univ. Denmark, Lyngby, Denmark
fDate :
27 June-2 July 2004
Abstract :
This paper considers a class of discrete finite alphabet 2D fields that can be characterized using tools front finite state machines and Markov chains. These fields have several properties that greatly simplify the analysis of 2D coding methods.
Keywords :
Markov processes; constraint theory; encoding; finite state machines; probability; 2D coding method; Markov chain; constrained 2D data; discrete finite alphabet; finite state machine; Analytical models; Automata; Probability distribution;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365198
