Computing entropy maps of finite-automaton-encoded binary images

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free