| 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 # | |
| IE, ITS, ITE-MMS, ITE-ME, ITE-AIT [detail] | 2023-02-21 15:30 |
Hokkaido | Hokkaido Univ. | A Study on Adaptation Methods for Universal Deep Image Compression Koki Tsubota, Kiyoharu Aizawa (UTokyo)  ITS2022-56 IE2022-73 |
In this study, we tackle universal deep image compression, which aims to compress images in arbitrary domains such as li... [more] | ITS2022-56 IE2022-73 pp.77-82 |
| 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 |
| QIT (2nd) |
2022-12-09 18:15 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
Secure multi-party quantum computation based on triorthogonal quantum error-correcting codes Petr Mishchenko, Keita Xagawa (NTT) |
Secure multi-party quantum computation (MPQC) protocol is a versatile tool that enables error-free distributed quantum c... [more] | |
| 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, EMM | 2016-05-20 11:05 |
Hokkaido | Otaru Economic Center | Construction of A Two-Step Universal VV Code Using a Sufficient Statistic Extracted from a VF Code Mitsuharu Arimura (Shonan Inst. Tech.), Hiroshi Nagaoka (Univ. of Electro-Communications) IT2016-13 EMM2016-13 |
In this paper, some theorems which give relationships between a sufficient statistic and the universality of a VV source... [more] | IT2016-13 EMM2016-13 pp.75-80 |
| 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 |
|
| OME | 2015-05-29 16:20 |
Tokyo | Kikai-Shinko-Kaikan Bldg | The Entropy and Probability in Information Theories
-- How Dr. John von Neumann explained in his Illinois Univ. Lectures in Dec. 1949 -- Kimiaki Tokumaru (Natural Philosopher) OME2015-23 |
Dr. von Neumann delivered lectures in December 1949 at Illinois University and in his 3rd lecture, “The Statistical Theo... [more] | OME2015-23 pp.25-30 |
| QIT (2nd) |
2015-05-26 16:40 |
Osaka | Osaka University | The Entropy and Probability in Information Theories
-- How Dr. John von Neumann explained in his Illinois Univ. Lectures in Dec. 1949 -- Kimiaki Tokumaru (Natural Philosopher) |
Dr. von Neumann delivered lectures in December 1949 at Illinois University and in his 3rd lecture, “The Statistical Theo... [more] | |
| 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 14:25 |
Hyogo | Kobe University | Extended LZW codes with Modified Reduplicative Parsing Yuta Takabayashi, Hirosuke Yamamoto (Univ. of Tokyo) IT2014-19 |
The LZW code is categorized as the so-called dictionary method in the universal data compression codes and is used in G... [more] | IT2014-19 pp.43-48 |
| 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 | 2013-07-25 14:30 |
Tokyo | Nishi-Waseda campus, Waseda University | A Data Compression Scheme based on Reduplicative Parsing for Binary Sources Shigeru Maya, Hirosuke Yamamoto (Univ. of Tokyo) IT2013-14 |
The incremental parsing used in the LZ78 code can be implemented by the incremental parsing tree, and Yokoo showed that... [more] |
IT2013-14 pp.17-22 |
| 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, ISEC, WBS | 2013-03-07 13:40 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Maximum Redundancy of Lossless Data Compression via Substring Enumeration for Markov Sources Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. Tech.), Yuki Shima (Univ. of Fukui) IT2012-76 ISEC2012-94 WBS2012-62 |
Dub\'{e} and Beaudoin proposed a technique of lossless data compression called compression via substring enumeration (CS... [more] | IT2012-76 ISEC2012-94 WBS2012-62 pp.95-100 |
[Return to Top Page]