| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| EMM, IT | 2023-05-12 13:25 |
Kyoto | Rakuyu Kaikan (Kyoto Univ. Yoshida-South Campus) (Primary: On-site, Secondary: Online) |
Equivalences among Some Information Measures for Individual Sequences and Their Applications for Fixed-Length Coding Problems Tomohiko Uyematsu (Tokyo Tech.), Tetsunao Matsuta (Saitama Univ.)  IT2023-12 EMM2023-12 |
This paper proposes three new information measures for individual sequences and clarifies their properties. Our new ... [more] |
IT2023-12 EMM2023-12 pp.61-66 |
| IT, RCS, SIP | 2023-01-24 10:25 |
Gunma | Maebashi Terrsa (Primary: On-site, Secondary: Online) |
An improved context tree switching method by dynamic expansion and pruning of context tree Masaya Ootsu, Hideki Yagi (UEC) IT2022-36 SIP2022-87 RCS2022-215 |
The Context Tree Weighting (CTW) method is a sequential lossless universal coding algorithm for tree sources with good p... [more] | IT2022-36 SIP2022-87 RCS2022-215 pp.42-47 |
| WBS, IT, ISEC | 2021-03-04 10:55 |
Online | Online | An Efficient Bayes Coding Algorithm for the Source Based on Context Tree Models that Vary from Section to Section Koshi Shimada, Shota Saito, Toshiyasu Matsushima (Waseda Univ.) IT2020-115 ISEC2020-45 WBS2020-34 |
In this paper, we present an efficient coding algorithm for a non-stationary source based on context tree models that ve... [more] | IT2020-115 ISEC2020-45 WBS2020-34 pp.19-24 |
| IT, ISEC, WBS | 2019-03-07 10:55 |
Tokyo | University of Electro-Communications | A Two-Step LZY Code by Excluding the Nodes Which Will Not be Used from the Candidate Set Mitsuharu Arimnura (Shonan Inst. Tech.) IT2018-92 ISEC2018-98 WBS2018-93 |
When blocks are parsed and encoded incrementally in the LZY code, which is a variation of the LZ78 code, the newly parse... [more] | IT2018-92 ISEC2018-98 WBS2018-93 pp.103-108 |
| IT, EMM | 2018-05-17 14:25 |
Tokyo | Ookayama Campus, Tokyo Institute of Technology | A Two-Step Source Code Using the Parsing Count of LZ78 Code as the First Step Mitsuharu Arimura (Shonan Inst. Tech.), Hiroshi Nagaoka (Univ. of Electro-Communications) IT2018-2 EMM2018-2 |
The redundancy of a two-step source code has been analyzed using the shape of the parsing tree of the Lempel-Ziv-Yokoo c... [more] | IT2018-2 EMM2018-2 pp.7-12 |
| WBS, IT, ISEC | 2018-03-08 10:15 |
Tokyo | Katsusika Campas, Tokyo University of Science | Evaluation of the Worst-Case Redundancy of Strongly Universal FV Source Codes Using the Source Approximation and the Asymptotically Sufficient Statistic Mitsuharu Arimura (Shonan Inst. Tech.), Hiroshi Nagaoka (Univ. of Electro-Comm.) IT2017-106 ISEC2017-94 WBS2017-87 |
The universality of some variations of two-step lossless source codes using asymptotically sufficient statistics were pr... [more] | IT2017-106 ISEC2017-94 WBS2017-87 pp.19-24 |
| IT | 2017-07-13 16:20 |
Chiba | Chiba University | [Invited Talk]
Compression by Substring Enumeration and its Related Methods Hidetoshi Yokoo (Gunma Univ.) IT2017-26 |
This paper surveys the universal data compression method known as Compression by Substring Enumeration (CSE), developed ... [more] | IT2017-26 pp.55-60 |
| IT, ISEC, WBS | 2016-03-10 10:40 |
Tokyo | The University of Electro-Communications | Redundancy of Bayesian Code with Markov Fractal Prior Distributions Naoya Matsukami, Tsutomu Kawabata (UEC) IT2015-103 ISEC2015-62 WBS2015-86 |
Bayesian code method is used as a standard in realizing a universal noiseless source code. For a memoryless source, a mi... [more] | IT2015-103 ISEC2015-62 WBS2015-86 pp.13-17 |
| COMP | 2015-09-01 11:00 |
Nagano | Generalization of Efficient Implementation of Compression by Substring Enumeration
-- Finite Alphabet and Explicit Phase Awareness -- Shumpei Sakuma, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2015-18 |
CSE (Compression by Substring Enumeration), a lossless universal compression scheme was introduced by Dub'e and Beaudoin... [more] | COMP2015-18 pp.13-20 |
|
| PRMU, IBISML, IPSJ-CVIM [detail] | 2014-09-02 16:15 |
Ibaraki | Rates of convergence of the universal Bayesian measure for continuous data Takanori Ayano, Joe Suzuki (Osaka Univ.) PRMU2014-53 IBISML2014-34 |
It is very important to estimate the probability of the data series accurately for applying MDL information criterion. ... [more] |
PRMU2014-53 IBISML2014-34 pp.143-146 |
|
| IT | 2014-07-17 17:40 |
Hyogo | Kobe University | [Invited Talk]
How to Observe Probability Distribution of Self-Information
-- as viewed under different resolutions of $n^{-1}$ and $n^{-1/2}$ -- Toshiyasu Matsushima (Waseda Univ.) IT2014-26 |
Several problems in Information Theory are investigated by asymptotic approximations of the probability of self-informat... [more] | IT2014-26 pp.83-88 |
| IT, ISEC, WBS | 2013-03-07 10:30 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Universal Coding for Asynchronous Slepian-Wolf Coding Systems Tetsunao Matsuta, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2012-62 ISEC2012-80 WBS2012-48 |
Slepian-Wolf (SW) coding system is the most fundamental source coding system in multi-terminal information theory. In t... [more] | IT2012-62 ISEC2012-80 WBS2012-48 pp.1-6 |
| IT, ISEC, WBS | 2013-03-07 11:45 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Order Estimator of Stationary Markov Sources Using Codeword Length of Universal Code Shinji Kanazawa, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2012-65 ISEC2012-83 WBS2012-51 |
Merhav et al. studied the problem of estimating the order of stationary Markov sources. They proposed an order estimator... [more] | IT2012-65 ISEC2012-83 WBS2012-51 pp.19-24 |
| IT | 2013-01-21 16:15 |
Tokyo | Univ. of Electro-Communications | Improvement of the symbol decomposition algorithm and its application to the word-valued sources Yuta Tadaki, Tsutomu Kawabata (The Univ. of Electro-Communications) IT2012-58 |
We consider the text compression based on probabilistic modeling. For a fixed length source alphabet, the symbol decomp... [more] |
IT2012-58 pp.53-57 |
| IT | 2012-01-20 16:50 |
Ibaraki | University of Tsukuba | An Information-Theoretic Interpretation of the CSE Lossless Compression Scheme Hidetoshi Yokoo (Gunma Univ.) IT2011-45 |
It has been shown that an off-line lossless compression algorithm, known as Compression by Substring Enumeration (CSE), ... [more] | IT2011-45 pp.37-42 |
| ISEC, IT, WBS | 2011-03-04 09:25 |
Osaka | Osaka University | A Practical Algorithm of Universal Source Coding by the Most Frequent Substring Tsuki Saito, Tetsunao Matsuta, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech) IT2010-105 ISEC2010-109 WBS2010-84 |
In the grammar based code proposed by Kieffer and Yang, a context-free grammar which only produces the input sequence is... [more] | IT2010-105 ISEC2010-109 WBS2010-84 pp.243-248 |
| ISEC, IT, WBS | 2011-03-04 09:50 |
Osaka | Osaka University | A Generalized MDL Criterion and its Application to Learning Bayesian Network Structure
-- When Both Discrete and Continuous Data are Present -- Joe Suzuki (Osaka Univ.) IT2010-106 ISEC2010-110 WBS2010-85 |
We propose the MDL principle without assuming the source to be discrete. As an application, we consider estimation of B... [more] |
IT2010-106 ISEC2010-110 WBS2010-85 pp.249-254 |
| IT | 2010-05-21 15:45 |
Tokushima | the University of Tokushima | A Universal Decoding Scheme for Distributed Lossless Data Compression Shigeaki Kuzuoka (Wakayama Univ.) IT2010-8 |
A distributed source coding problem, which includes Slepian-Wolf coding problem as a special case, is considered. A dec... [more] |
IT2010-8 pp.39-44 |
| IT, ISEC, WBS | 2010-03-04 17:00 |
Nagano | Nagano-Engineering Campus, Shinshu University | Universal Slepian-Wolf Coding for General Sources Shigeaki Kuzuoka (Wakayama Univ.) IT2009-100 ISEC2009-108 WBS2009-79 |
Slepian-Wolf (S-W) coding for general correlated sources is considered. Our main result demonstrates the following fact... [more] |
IT2009-100 ISEC2009-108 WBS2009-79 pp.187-191 |
| IT, ISEC, WBS | 2010-03-05 14:40 |
Nagano | Nagano-Engineering Campus, Shinshu University | Redundancy analysis of the universal source code with a singular prior Tatsuya Hashimoto, Tsutomu Kawabata (Univ. of Electro-Comm.) IT2009-125 ISEC2009-133 WBS2009-104 |
We consider the universal source coding with the class of source whose probability is parameterized over a continuous sp... [more] | IT2009-125 ISEC2009-133 WBS2009-104 pp.349-352 |
[Return to Top Page]