Sorry, you need to enable JavaScript to visit this website.

Lossless Data Compression

A high efficient cascade coder with predictor blending method for lossless audio compression


In this paper, the improvement of the cascaded prediction method was presented. The prediction method with backward adaptation and extended Ordinary Least Square (OLS+) was presented. An own approach to implementation of the effective context-dependent constant component removal block was used. Also the improved adaptive arithmetic coder with short, medium and long-term adaptation was used and the experiment was carried out comparing the results with other known lossless audio coders against which our method obtained the best efficiency.

Paper Details

Authors:
Grzegorz Ulacha, Cezary Wernik
Submitted On:
28 March 2020 - 4:45pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Session:
Document Year:
Cite

Document Files

Ulacha_Wernik_DCC_2020_POSTER.pdf

(41)

Keywords

Additional Categories

Subscribe

[1] Grzegorz Ulacha, Cezary Wernik, "A high efficient cascade coder with predictor blending method for lossless audio compression", IEEE SigPort, 2020. [Online]. Available: http://sigport.org/5045. Accessed: Aug. 06, 2020.
@article{5045-20,
url = {http://sigport.org/5045},
author = {Grzegorz Ulacha; Cezary Wernik },
publisher = {IEEE SigPort},
title = {A high efficient cascade coder with predictor blending method for lossless audio compression},
year = {2020} }
TY - EJOUR
T1 - A high efficient cascade coder with predictor blending method for lossless audio compression
AU - Grzegorz Ulacha; Cezary Wernik
PY - 2020
PB - IEEE SigPort
UR - http://sigport.org/5045
ER -
Grzegorz Ulacha, Cezary Wernik. (2020). A high efficient cascade coder with predictor blending method for lossless audio compression. IEEE SigPort. http://sigport.org/5045
Grzegorz Ulacha, Cezary Wernik, 2020. A high efficient cascade coder with predictor blending method for lossless audio compression. Available at: http://sigport.org/5045.
Grzegorz Ulacha, Cezary Wernik. (2020). "A high efficient cascade coder with predictor blending method for lossless audio compression." Web.
1. Grzegorz Ulacha, Cezary Wernik. A high efficient cascade coder with predictor blending method for lossless audio compression [Internet]. IEEE SigPort; 2020. Available from : http://sigport.org/5045

Reverse Multi-Delimiter Compression Codes


An enhanced version of a recently introduced family of variable length binary codes with multiple pattern delimiters is presented and discussed. These codes are complete, universal, synchronizable, they have monotonic indexing and allow a standard search in compressed files. Comparing the compression rate on natural language texts demonstrates that introduced codes appear to be much superior to other known codes with similar properties. A fast byte-aligned decoding algorithm is constructed, which operates much faster than the one for Fibonacci codes.

Paper Details

Authors:
Anatoly Anisimov
Submitted On:
29 March 2020 - 4:53am
Short Link:
Type:
Event:
Presenter's Name:
Session:
Document Year:
Cite

Document Files

presentation.pptx

(52)

Keywords

Additional Categories

Subscribe

[1] Anatoly Anisimov, "Reverse Multi-Delimiter Compression Codes", IEEE SigPort, 2020. [Online]. Available: http://sigport.org/5039. Accessed: Aug. 06, 2020.
@article{5039-20,
url = {http://sigport.org/5039},
author = {Anatoly Anisimov },
publisher = {IEEE SigPort},
title = {Reverse Multi-Delimiter Compression Codes},
year = {2020} }
TY - EJOUR
T1 - Reverse Multi-Delimiter Compression Codes
AU - Anatoly Anisimov
PY - 2020
PB - IEEE SigPort
UR - http://sigport.org/5039
ER -
Anatoly Anisimov. (2020). Reverse Multi-Delimiter Compression Codes. IEEE SigPort. http://sigport.org/5039
Anatoly Anisimov, 2020. Reverse Multi-Delimiter Compression Codes. Available at: http://sigport.org/5039.
Anatoly Anisimov. (2020). "Reverse Multi-Delimiter Compression Codes." Web.
1. Anatoly Anisimov. Reverse Multi-Delimiter Compression Codes [Internet]. IEEE SigPort; 2020. Available from : http://sigport.org/5039

Re-Pair in Small Space


Re-Pair is a grammar compression scheme with favorably good compression rates. The computation of Re-Pair comes with the cost of maintaining large frequency tables, which makes it hard to compute Re-Pair on large scale data sets. As a solution for this problem we present, given a text of length n whose characters are drawn from an integer alphabet, an O(n^2) time algorithm computing Re-Pair in n lg max(n, τ) bits of working space including the text space, where τ is the number of terminals and non-terminals.

Paper Details

Authors:
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto
Submitted On:
31 March 2020 - 1:53am
Short Link:
Type:
Event:
Presenter's Name:
Session:
Document Year:
Cite

Document Files

Poster

(54)

Keywords

Additional Categories

Subscribe

[1] Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto, "Re-Pair in Small Space", IEEE SigPort, 2020. [Online]. Available: http://sigport.org/5032. Accessed: Aug. 06, 2020.
@article{5032-20,
url = {http://sigport.org/5032},
author = {Dominik Köppl; Tomohiro I; Isamu Furuya; Yoshimasa Takabatake; Kensuke Sakai; Keisuke Goto },
publisher = {IEEE SigPort},
title = {Re-Pair in Small Space},
year = {2020} }
TY - EJOUR
T1 - Re-Pair in Small Space
AU - Dominik Köppl; Tomohiro I; Isamu Furuya; Yoshimasa Takabatake; Kensuke Sakai; Keisuke Goto
PY - 2020
PB - IEEE SigPort
UR - http://sigport.org/5032
ER -
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto. (2020). Re-Pair in Small Space. IEEE SigPort. http://sigport.org/5032
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto, 2020. Re-Pair in Small Space. Available at: http://sigport.org/5032.
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto. (2020). "Re-Pair in Small Space." Web.
1. Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto. Re-Pair in Small Space [Internet]. IEEE SigPort; 2020. Available from : http://sigport.org/5032

Practical Repetition-Aware Grammar Compression


The goal of grammar compression is to construct a small sized context free grammar which uniquely generates the input text data. Among grammar compression methods, RePair is known for its good practical compression performance. MR-RePair was recently proposed as an improvement to RePair for constructing small-sized context free grammar for repetitive text data. However, a compact encoding scheme has not been discussed for MR-RePair. We propose a practical encoding method for MR-RePair and show its effectiveness through comparative experiments.

Paper Details

Authors:
Submitted On:
25 March 2020 - 8:36pm
Short Link:
Type:
Event:
Session:
Document Year:
Cite

Document Files

main.pdf

(45)

Keywords

Additional Categories

Subscribe

[1] , "Practical Repetition-Aware Grammar Compression", IEEE SigPort, 2020. [Online]. Available: http://sigport.org/5030. Accessed: Aug. 06, 2020.
@article{5030-20,
url = {http://sigport.org/5030},
author = { },
publisher = {IEEE SigPort},
title = {Practical Repetition-Aware Grammar Compression},
year = {2020} }
TY - EJOUR
T1 - Practical Repetition-Aware Grammar Compression
AU -
PY - 2020
PB - IEEE SigPort
UR - http://sigport.org/5030
ER -
. (2020). Practical Repetition-Aware Grammar Compression. IEEE SigPort. http://sigport.org/5030
, 2020. Practical Repetition-Aware Grammar Compression. Available at: http://sigport.org/5030.
. (2020). "Practical Repetition-Aware Grammar Compression." Web.
1. . Practical Repetition-Aware Grammar Compression [Internet]. IEEE SigPort; 2020. Available from : http://sigport.org/5030