Finite automata are being used to encode images. Applications of this technique include image compression, and extraction of self similarity information and Hausdorff dimension of the encoded image. J Jürgensen and Staiger [7] proposed a method by which the local Hausdorff dimension of the encoded image could be effectively computed. This paper describes the first implementation of this procedure and presents some experimental results showing local entropy maps computed from images represented by finite automata.
CITATION STYLE
Eramian, M. G. (2001). Computing entropy maps of finite-automaton-encoded binary images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2214, pp. 81–90). Springer Verlag. https://doi.org/10.1007/3-540-45526-4_8
Mendeley helps you to discover research relevant for your work.