| 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 # | |
| IT | 2013-01-21 15:35 |
Tokyo | Univ. of Electro-Communications | Cross Coding Based On LZ78 Code and its Application Takahito Kashihara (Univ. of Tokushima), Yasutada Oohama (Univ. of Electro-Communications)  IT2012-57 |
Takeuchi and Oohama proposed a universal similarity metric based on a new encoding method called the cross coding. The... [more] |
IT2012-57 pp.47-52 |
| 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 |
| HCGSYMPO (2nd) |
2012-12-10 - 2012-12-12 |
Kumamoto | Kumamoto-Shintoshin-plaza | Re-coloring methods based on visual effects and color vision characteristics Harumi Saito, Masahiro Watanabe, Yoko Asano (NTT) |
It is said that utilizing red as an indicator of emphasis and so on is not very effective because red looks very dark wi... [more] | |
| IT | 2012-01-20 16:25 |
Ibaraki | University of Tsukuba | Source Coding with Side Information Based on Incremental Parsing and Arithmetic Coding Daisuke Hamada, Shigeaki Kuzuoka (Wakayama Univ.) IT2011-44 |
In this paper, we consider a lossless source coding problem where the common side information is available at both of ... [more] |
IT2011-44 pp.31-36 |
| 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 |
| 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 |
| IT, ISEC, WBS | 2010-03-05 16:35 |
Nagano | Nagano-Engineering Campus, Shinshu University | Construction of wiretap codes from ordinary channel codes Masahito Hayashi (Tohoku Univ./National Univ. of Singapore), Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2009-144 ISEC2009-152 WBS2009-123 |
From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with t... [more] |
IT2009-144 ISEC2009-152 WBS2009-123 pp.461-465 |
| ITE-MMS, ITE-CE, MRIS | 2010-01-22 09:30 |
Osaka | A Study about Shooting-miss Factors and Assist Functions of Camcoders
-- A quest for camcoders which assist amateur users develop shooting skills. -- Yoshihiro Morioka, Eiji Yamauchi, Hiroji Takebayashi, Kenji Matsuura (Panasonic) MR2009-55 |
Since the functionality and universal design of video camcorders have been improved year after year, it becomes easier f... [more] | MR2009-55 pp.35-38 |
|
| IT | 2009-05-29 14:40 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Relations between Universal FV and FF Source Codes Shigeaki Kuzuoka (Wakayama Univ.) IT2009-2 |
Universal lossless source coding for general sources are considered. Our results reveal that the definition of the univ... [more] |
IT2009-2 pp.7-12 |
| WBS, IT, ISEC | 2009-03-09 16:20 |
Hokkaido | Hakodate Mirai Univ. | Relationship among Conditional Complexities of Individual Sequences Yuki Tanaka, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2008-64 ISEC2008-122 WBS2008-77 |
Conditional complexities of individual sequences are known as lower bounds on the compression rate attainable by some cl... [more] | IT2008-64 ISEC2008-122 WBS2008-77 pp.129-136 |
| WBS, IT, ISEC | 2009-03-10 09:00 |
Hokkaido | Hakodate Mirai Univ. | A proof of universality of the source coding by most frequent match Yangao Lin, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2008-96 ISEC2008-154 WBS2008-109 |
In the grammar based code proposed by Kieffer and Yang, for a given data string, we first produce a context-free grammar... [more] | IT2008-96 ISEC2008-154 WBS2008-109 pp.343-348 |
| WBS, IT, ISEC | 2009-03-10 09:25 |
Hokkaido | Hakodate Mirai Univ. | A Necessary and Sufficient Condition for the Existence of a Universal Fixed-Rate Lossless Code Shigeaki Kuzuoka (Wakayama Univ.) IT2008-97 ISEC2008-155 WBS2008-110 |
In this paper, a generalized version of fixed-rate lossless source coding, that is, $\varepsilon$-source coding of gener... [more] | IT2008-97 ISEC2008-155 WBS2008-110 pp.349-354 |
| WBS, IT, ISEC | 2009-03-10 09:50 |
Hokkaido | Hakodate Mirai Univ. | Universal Lossless Source Coding Based on Sequential Grammar Transforms Masaki Jono, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2008-98 ISEC2008-156 WBS2008-111 |
The grammar-based code proposed by Kieffer and Yang is a large class of universal codes. Usually, the grammar-based cod... [more] |
IT2008-98 ISEC2008-156 WBS2008-111 pp.355-362 |
| ISEC, IT, WBS | 2008-02-29 10:20 |
Tokyo | A Construction of Channel Code, Joint Source-Channel Code, and Universal Code for Arbitrary Stationary Memoryless Channels using Sparse Matrices Shigeki Miyake, Jun Muramatsu (NTT) IT2007-53 ISEC2007-150 WBS2007-84 |
A channel code is constructed using sparse matrices for stationary memoryless channels that do not necessarily have a s... [more] |
IT2007-53 ISEC2007-150 WBS2007-84 pp.29-36 |
|
| IT | 2008-01-17 15:50 |
Tokyo | Waseda Univ. | Universal Coding Theorem for Relay Channels Toshifumi Sakai, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2007-29 |
Relay channels are known as a model of multihop wireless networks which are often studied. In relay channels, the sende... [more] |
IT2007-29 pp.25-30 |
| IT | 2006-07-27 15:25 |
Chiba | Univ. of Tokyo | Fixed-Slope Universal Lossy Coding for Individual Sequences Shigeaki Kuzuoka, Tomohiko Uyematsu (Tokyo Inst. of Tech.) |
In a theory of lossy coding of individual sequences, two kinds of coding schemes, the fixed-rate coding and the fixed-d... [more] |
IT2006-32 pp.43-48 |
| WBS, IT, ISEC | 2006-03-16 08:30 |
Aichi | Nagoya Univ. | A Generalized-LSB Embedding Model for Universal Lossless Data Embedding Hidetoshi Yokoo, Shingo Mamada (Gunma Univ.) |
(To be available after the conference date) [more] | IT2005-85 ISEC2005-142 WBS2005-99 pp.123-128 |
| IT | 2005-07-22 15:20 |
Osaka | Osaka Prefecture Univ. | An Algorithm of Bayes Coding for FSMX Sources to Reduce Required Memory Size Akira Nakano, Naoto Kobayashi, Toshiyasu Matsushima (Waseda Univ.) |
Bayes code is one of universal source codings, such that a class of the probabilistic model of source is known but the p... [more] | IT2005-50 pp.47-52 |
[Return to Top Page]