Skip to main content
SpringerLink
Log in

ɛ-Entropy data compression

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

A method of compressing images by coding is described, in which, at the first stage the value of the ɛ-entropy of a class of functions corresponding to sequences of images is computed, and at the second stage suboptimal probabilistic coding is used.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. Ya. Tryrigin, “Optimal digital coding of sequences of complex television images,” Preprint, Institute of Mathematics, Ukr. SSR Academy of Sciences 91.13 (1991).

  2. D. A. Huffman, “Designing minimal redundancy codes,” Cybernetics Reports, Issue 3, 79–87 (1961).

  3. C. Shannon, Information Theory and Cybernetics [Russian translation], Inostr-lit, Moscow (1963).

    Google Scholar 

  4. “Digital encoding of graphs,” Trans. Inst. élektrotekh. Radioelektr.,68, No. 7 (1980).

  5. A. K. Jain, “Compressing videodata,” Ibid.,69, No. 3, 71–117 (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Ukrainian Academy of Science, Kiev

    I. Ya. Tyrygin

Authors
  1. I. Ya. Tyrygin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 44, No. 11, pp. 1598–1604, November, 1992.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tyrygin, I.Y. ɛ-Entropy data compression. Ukr Math J 44, 1473–1479 (1992). https://doi.org/10.1007/BF01071523

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01071523

Keywords

Search

Navigation