Dynamic Markov compression: Difference between revisions

Revision as of 17:38, 13 November 2007

Latest revision as of 14:26, 14 August 2025

(23 intermediate revisions by 19 users not shown)

Line 1:

{{Short description|Lossless data compression algorithm}}

'''Dynamic Markov Compressioncompression''' ('''DMC''') is a lossless [[data compression]] [[algorithm]] developed by [[Gordon Cormack]] and [[Nigel Horspool]] .<ref>Gordon Cormack and Nigel Horspool, "Data Compression using Dynamic Markov Modelling", Computer Journal 30:6 (December 1987)</ref>. It uses predictive [[arithmetic coding]] similar to [[prediction by partial matching]] (PPM), except that the input is predicted one bit at a time (rather than one byte at a time). DMC has a good compression ratio and moderate speed, similar to PPM, but requires somewhat more memory and is not widely implemented. Some recent implementations include the experimental compression programs [http://cs.fit.edu/~mmahoney/compression/text.html#1781 hook] by Nania Francesco Antonio, [https://web.archive.org/web/20091026235047/http://de.geocities.com/ocamyd/ ocamyd] by Frank Schwellinger, and as a submodel in [[PAQ|paq8l]] by Matt Mahoney. These are based on the [https://web.archive.org/web/20070630111546/http://plg.uwaterloo.ca/~ftp/dmc/dmc.c 1993 implementation] in C by Gordon Cormack.

== Algorithm ==

Line 5 ⟶ 6:

DMC predicts and codes one bit at a time. It differs from [[prediction by partial matching|PPM]] in that it codes bits rather than bytes, and from [[context mixing]] algorithms such as [[PAQ]] in that there is only one context per prediction. The predicted bit is then coded using [[arithmetic coding]].

=== Arithmetic Codingcoding ===

A bitwise arithmetic coder such as DMC has two components, a predictor and an arithmetic coder. The predictor accepts an ''n''-bit input string ''x'' = ''x''₁''x''₂...''x''_''n'' and assigns it a probability ''p''(''x''), expressed as a product of a series of predictions, ''p''(''x''₁)''p''(''x''₂'''|'''''x''₁)''p''(''x''₃'''|'''''x''₁''x''₂) ... ''p''(''x''_''n'''''|''' ''x''₁''x''₂...''x''_{''n-''&ndash;1}). The arithmetic coder maintains two high precision binary numbers, ''p''_low and ''p''_high, representing the possible range for the total probability that the model would assign to all strings lexicographically less than ''x'', given the bits of ''x'' seen so far. The compressed code for ''x'' is ''p''_''x'', the shortest bit string representing a number between ''p''_low and ''p''_high. It is always possible to find a number in this range no more than one bit longer than the [[Claude Shannon|Shannon]] limit, log₂ &nbsp;1 '''/''' ''p''(''x''). One such number can be obtained from ''p''_high by dropping all of the trailing bits after the first bit that differs from ''p''_low.

Compression proceeds as follows. The initial range is set to ''p''_low = 0, ''p''_high = 1. For each bit, the predictor estimates ''p''₀ = ''p''(''x''_''i'' = 0'''|'''''x''₁''x''₂...''x''_{''i-''&ndash;1}) and ''p''₁ = 1 - &nbsp;&minus;&nbsp;''p''₀, the probability of a 0 or 1, respectively. The arithmetic coder then divides the current range, (''p''_low, &nbsp;''p''_high) into two parts in proportion to ''p''₀ and ''p''₁. Then the subrange corresponding to the next bit ''x''_''i'' becomes the new range.

For decompression, the predictor makes an identical series of predictions, given the bits decompressed so far. The arithmetic coder makes an identical series of range splits, then selects the range containing ''p''_''x'' and outputs the bit ''x''_''i'' corresponding to that subrange.

In practice, it is not necessary to keep ''p''_low and ''p''_high in memory to high precision. As the range narrows, the leading bits of both numbers will be the same, and can be output immediately.

=== DMC Modelmodel ===

The DMC predictor is a table which maps (bitwise) contexts to a pair of counts, ''n''₀ and ''n''₁, representing the number of zeros and ones previously observed in this context. Thus, it predicts that the next bit will be a 0 with probability ''p''₀ = ''n''₀ '''/''' ''n'' = ''n''₀ '''/''' (''n''₀ &nbsp;+ &nbsp;''n''₁) and 1 with probability ''p''₁ = 1 - &nbsp;&minus;&nbsp;''p''₀ = ''n''₁ '''/''' ''n''. In addition, each table entry has a pair of pointers to the contexts obtained by appending either a 0 or a 1 to the right of the current context (and possibly dropping bits on the left). Thus, it is never necessary to look up the current context in the table; it is sufficient to maintain a pointer to the current context and follow the links.

In the original DMC implementation, the initial table is the set of all contexts of length 8 to 15 bits that begin on a byte boundary. The initial state is any of the 8 bit contexts. The counts are floating point numbers initialized to a small nonzero constant such as 0.2. The counts are not initialized to zero in order to allow values to be coded even if they have not been seen before in the current context.

Modeling is the same for compression and decompression. For each bit, ''p''₀ and ''p''₁ are computed, bit ''x''_''i'' is coded or decoded, the model is updated by adding 1 to the count corresponding to ''x''_''i'', and the next context is found by traversing the link corresponding to ''x''_''i''.

=== Adding Newnew Contextscontexts ===

DMC as described above is equivalent to an order-1 context model. However, it is normal to add longer contexts to improve compression. If the current context is A, and the next context B would drop bits on the left, then DMC may add (clone) a new context C from B. C represents the same context as A after appending one bit on the right as with B, but without dropping any bits on the left. The link from A will thus be moved from B to point to C. B and C will both make the same prediction, and both will point to the same pair of next states. The total count, ''n'' = ''n''₀ &nbsp;+ &nbsp;''n''₁ for C will be equal to the count ''n''_''x'' for A (for input bit &nbsp;''x''), and that count will be subtracted from B.

For example, suppose that state A represents the context 11111. On input bit 0, it transitions to state B representing context 110, obtained by dropping 3 bits on the left. In context A, there have been 4 zero bits and some number of one bits. In context B, there have been 3 zeros and 7 ones (''n ''&nbsp;= &nbsp;10), which predicts ''p''₁ = 0.7.

{| class="wikitable"

|-

! State

! ''n''₀

! ''n''₁

! next₀

! next₁

Line 50 ⟶ 51:

|}

C is cloned from B. It represents context 111110. Both B and C predict ''p''₁ = 0.7, and both go to the same next states, E and F. The count for C is ''n'' = 4, equal to ''n''₀ for A. This leaves ''n'' = 6 for B.

{| class="wikitable"

|-

! State

! ''n''₀

! ''n''₁

! next₀

! next₁

Line 86 ⟶ 87:

== External links ==

* [http://www.cs.uvic.ca/~nigelh/Publications/DMC.pdf Data Compression Using Dynamic Markov Modelling]

* Google Developers YouTube channel: [https://www.youtube.com/watch?v=05RFEGWNxts Compressor Head Episode 3 (Markov Chain Compression)] {{plays audio}}

{{Compression Methods}}

[[Category:Lossless compression algorithms]]

[[Category:Markov models]]

[[Category:Data compression]]