A compact tree representation of an antidictionary
In both theoretical analysis and practical use for an antidictionary coding algorithm, an
important problem is how to encode an antidictionary of an input source. This paper …
important problem is how to encode an antidictionary of an input source. This paper …
Lossless compression of grayscale and colour images using multidimensional CSE
D Dubé - 2019 11th International Symposium on Image and …, 2019 - ieeexplore.ieee.org
Originally, compression by substring enumeration (CSE) is a lossless compression
technique that is intended for strings of bits. As such, the original version is one-dimensional …
technique that is intended for strings of bits. As such, the original version is one-dimensional …
Compression by substring enumeration using sorted contingency tables
This paper proposes two variants of improved Compression by Substring Enumeration
(CSE) with a finite alphabet. In previous studies on CSE, an encoder utilizes inequalities …
(CSE) with a finite alphabet. In previous studies on CSE, an encoder utilizes inequalities …
Compression by substring enumeration with a finite alphabet using sorting
This paper proposes two variants of improved Compression by Substring Enumeration
(CSE) with a finite alphabet. In previous studies on CSE, an encoder utilizes inequalities …
(CSE) with a finite alphabet. In previous studies on CSE, an encoder utilizes inequalities …
Two-dimensional source coding by means of subblock enumeration
A technique of lossless compression via substring enumeration (CSE) is a well-known
lossless compression algorithm for a one-dimensional (1D) source. The CSE uses a …
lossless compression algorithm for a one-dimensional (1D) source. The CSE uses a …
A Universal Two-Dimensional Source Coding by Means of Subblock Enumeration
The technique of lossless compression via substring enumeration (CSE) is a kind of
enumerative code and uses a probabilistic model built from the circular string of an input …
enumerative code and uses a probabilistic model built from the circular string of an input …
部分列数え上げデータ圧縮法とその周辺―オフライン無ひずみユニバーサル符号の架け橋として―
横尾英俊 - 電子情報通信学会基礎・境界ソサイエティFundamentals …, 2018 - jstage.jst.go.jp
抄録 2010 年に提案された部分列数え上げデータ圧縮法は, 無ひずみデータ圧縮法の代表例である
ジブ・レンペル符号と同様, 情報源の確率構造についての事前知識を前提としないユニバーサル …
ジブ・レンペル符号と同様, 情報源の確率構造についての事前知識を前提としないユニバーサル …
反辞書を用いたデータ圧縮法とその周辺
太田隆博 - 専修ネットワーク& インフォメーション, 2021 - senshu-u.repo.nii.ac.jp
This paper surveys a data compression method as data compression using antidictionaries
(DCA) and its related topics. DCA uses a set of minimal forbidden (or absent) words called …
(DCA) and its related topics. DCA uses a set of minimal forbidden (or absent) words called …
[PDF][PDF] 部分文字列数え上げ圧縮法の効率的な実現と応用に関する研究
佐久間俊平 - 2017 - tohoku.repo.nii.ac.jp
情報技術の発達により様々なデータが日々生成され続け, 情報が氾濫した現代は
「ビッグデータ時代」 と呼ばれている. これらのデータを有効活用していくうえで …
「ビッグデータ時代」 と呼ばれている. これらのデータを有効活用していくうえで …