A system/graph theoretical analysis of attractor coders

This paper provides links between the young field of attractor coding and the well-established fields of systems theory and graph theory. Attractor decoders are modeled as linear systems whose stability is both necessary and sufficient for convergence of the decoder. This stability is dictated by the location of the eigenvalues of the sparse state transition matrix of the system. The relationship between these eigenvalues, spatial causality of the system, and the patterns of interdependency between signal elements (or image pixels) is investigated for several cases using concepts from graph and matrix theory.

[1]  Gary B. Lamont,et al.  Digital control systems--theory, hardware, software , 1985 .

[2]  Steven J. Leon.  Linear Algebra With Applications , 1980 .

[3]  T. B. Boffey,et al.  Applied Graph Theory , 1973 .

[4]  Bernd Hürtgen,et al.  On the problem of convergence in fractal coding schemes , 1994, Proceedings of 1st International Conference on Image Processing.

[5]  Arnaud E. Jacquin,et al.  A novel fractal block-coding technique for digital images , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[6]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[7]  Thomas S. Huang,et al.  Fractal-based techniques for a generalized image coding method , 1994, Proceedings of 1st International Conference on Image Processing.

[8]  Mohammad Gharavi-Alkhansari.  Fractal-Based Image and Video Coding Using Matching Pursuit , 1997 .

[9]  Chi-Tsong Chen,et al.  Linear System Theory and Design , 1995 .

[10]  Albert F. Lawrence,et al.  Fractal Image Encoding , 1992 .