Informatika i Ee Primeneniya [Informatics and its Applications]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Inform. Primen.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Informatika i Ee Primeneniya [Informatics and its Applications], 2021, Volume 15, Issue 2, Pages 82–88
DOI: https://doi.org/10.14357/19922264210212
(Mi ia732)
 

This article is cited in 1 scientific paper (total in 1 paper)

Compression algorithms for force volume data I: Coding of prediction errors

D. V. Sushko

Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Full-text PDF (234 kB) Citations (1)
References:
Abstract: The author considers the problem of reversible (lossless) compression of force volume data which are the three-dimensional arrays with 16-bit integer elements. Such arrays are the result of atomic force microscopy scanning of microobjects in the force mapping mode. The author proposes reversible compression algorithms of force volume data based on the universal arithmetic coding of their prediction errors. The author uses two methods of universal coding. The first method based on the statistical model of the source with the calculable sequence of states implies the decomposition of an error prediction sequence into two subsequences which are coded independently. The second method implies a choice of the appropriate weight while constructing the code probabilities used in arithmetic coding. The author constructs bit rate estimations for the proposed algorithms for five test arrays. The results show that combination of the universal coding methods mentioned above makes significant reduction of the bit rate. The bit rates of the most efficient algorithm among proposed practically applicable algorithms for the test arrays are 3.9285, 3.5268, 3.5024, 4.2813, and 4.2246 bit/pixel.
Keywords: atomic force microscope, force volume data, reversible compression, arithmetic coding, universal coding.
Received: 30.12.2020
Document Type: Article
Language: Russian
Citation: D. V. Sushko, “Compression algorithms for force volume data I: Coding of prediction errors”, Inform. Primen., 15:2 (2021), 82–88
Citation in format AMSBIB
\Bibitem{Sus21}
\by D.~V.~Sushko
\paper Compression algorithms for force volume data~I: Coding of prediction errors
\jour Inform. Primen.
\yr 2021
\vol 15
\issue 2
\pages 82--88
\mathnet{http://mi.mathnet.ru/ia732}
\crossref{https://doi.org/10.14357/19922264210212}
Linking options:
  • https://www.mathnet.ru/eng/ia732
  • https://www.mathnet.ru/eng/ia/v15/i2/p82
    Cycle of papers
    This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Информатика и её применения
    Statistics & downloads:
    Abstract page:100
    Full-text PDF :153
    References:17
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024