| 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 | 2019-05-24 09:30 |
Hokkaido | Asahikawa International Conference Hall | A Consideration on Extended Ternary Memoryless Sources with a Simple Construction of Binary Compact Codes Nozomi Miya (Aoyama Gakuin Univ.), Takahiro Yoshida (Yokohama College of Commerce), Hajime Jinushi (Aoyama Gakuin Univ.)  IT2019-7 EMM2019-7 |
The complexity of Huffman procedure grows with exponential order of $n$ for the $n$-th degree extended memoryless source... [more] | IT2019-7 EMM2019-7 pp.31-36 |
| WIT, IPSJ-AAC | 2019-03-10 10:20 |
Ibaraki | Tsukuba University of Technology | A Selection Scheme of a Communication Aid using Optimal Alphabetic Code Satoshi Koyama (Hirosaki Univ.) WIT2018-81 |
Coding-based selection scheme is used by the severely motor disabled. Row-collumn scanning method alse can be seen as o... [more] | WIT2018-81 pp.125-130 |
| SIP, IT, RCS | 2018-01-22 11:15 |
Kagawa | Sunport Hall Takamatsu | A Consideration on Conditions of Extended Binary Memoryless Sources where Different Huffman Codes are Constructed
-- A Case that Combined Symbols Belong to the Same Group in the First and Second Steps of the Reduction -- Nozomi Miya (Aoyama Gakuin Univ.), Takahiro Yoshida (Yokohama College of Commerce), Hajime Jinushi (Aoyama Gakuin Univ.) IT2017-61 SIP2017-69 RCS2017-275 |
Different Huffman codes, i.e., different codeword sets constructed in Huffman coding are given for $n$-th degree extende... [more] | IT2017-61 SIP2017-69 RCS2017-275 pp.37-42 |
| IT | 2017-11-28 16:35 |
Niigata | Hotel Shiratama-no-Yu Senkei | [Invited Talk]
AIFV Codes and Their Extended Codes Hirosuke Yamamoto (Univ. of Tokyo) IT2017-54 |
In source coding based on a code tree, it was concluded from Kraft's and McMilan's theorems that the Huffman code is t... [more] |
IT2017-54 pp.19-26 |
| SIS, IPSJ-AVM | 2017-10-12 13:40 |
Nara | Todaiji Culture Center | A New Method of Lossless Coding for Binary Holographic Interference Fringes Takahiro Nishigaito, Mitsuji Muneyasu, Kyoji Matsushima, Soh Yoshida (Kansai Univ.), Akira Taguchi (Tokyo City Univ.) SIS2017-23 |
Computer generating holography (CGH) is one of the promising 3D imaging techniques. However the resolution of holographi... [more] | SIS2017-23 pp.13-16 |
| IT | 2017-09-08 14:25 |
Yamaguchi | Centcore Yamaguchi Hotel | Dynamic AIFV coding using a dynamic Huffman code Tomotaka Hiraoka, Hirosuke Yamamoto (The Univ. of Tokyo) IT2017-46 |
Since AIFV codes attain better compression rate than Huffman codes, dynamic AIFV codes are expected to attain better com... [more] | IT2017-46 pp.43-48 |
| RCS, RCC, ASN, NS, SR (Joint) |
2016-07-21 09:50 |
Aichi | Evaluation of control quality of wireless feedback control systems with Huffman coding that limits the maximum code length Atsushi Nagata, Kentaro Kobayashi, Hiraku Okada, Masaaki Katayama (Nagoya Univ.) RCC2016-17 |
In this paper, we discuss the reduction of the amount of transmission data in wireless feedback control systems. Because... [more] | RCC2016-17 pp.29-34 |
|
| RCC, ITS, WBS | 2015-12-17 10:30 |
Okinawa | Okinawa Industry Support Center | [Poster Presentation]
A study on Huffman coding scheme considering importance of control data for wireless feedback control systems Atsushi Nagata, Kentaro Kobayashi, Okada Hiraku, Masaaki Katayama (Nagoya Univ.) WBS2015-48 ITS2015-20 RCC2015-50 |
This study addresses Huffman coding to reduce the amount of transmitted control information in wireless feedback control... [more] | WBS2015-48 ITS2015-20 RCC2015-50 pp.55-60 |
| SIS, IPSJ-AVM | 2015-09-03 14:00 |
Osaka | Kansai Univ. | A Study on Lossless coding for Binary Holographic Interference Fringes Takahiro Nishigaito, Mitsuji Muneyasu, Kyoji Matsushima (Kansai Univ.), Akira Taguchi (Tokyo City Univ.) SIS2015-19 |
This paper studies a compression technique for binary holographic interference fringes. Computer generating holography i... [more] | SIS2015-19 pp.25-30 |
| RCC, ASN, RCS, NS, SR (Joint) |
2015-07-29 11:10 |
Nagano | JA Naganoken Bldg. | Performance evaluation of wireless feedback control systems with Huffman coding under data rate constraint Atsushi Nagata, Kentaro Kobayashi, Hiraku Okada, Masaaki Katayama (Nagoya Univ.) RCC2015-18 |
This study addresses Huffman coding to reduce the amount of transmitted control information in wireless feedback control... [more] | RCC2015-18 pp.7-11 |
| EMM | 2013-05-25 09:00 |
Kochi | Kochijyo Hall | [Tutorial Lecture]
Information Hiding for Digital Images
-- Hiding message into JPEG images -- Michiharu Niimi (Kyushu Inst. of Tech.) EMM2013-9 |
Information hiding for digital images is a technique to embed message into image data. The researches for information ... [more] |
EMM2013-9 pp.49-54 |
| SIS | 2013-03-07 10:00 |
Shizuoka | Create Hamamatsu | Study of image enlargement method using steganography techniques. Yuko Ishida, Hiroshi Yasukawa (Aichi Prefectural Univ.) |
Most image enlargement method are based on the estimation of frequency components from the low-resolution image.However ... [more] | SIS2012-46 pp.5-10 |
| IT | 2012-05-25 14:00 |
Fukuoka | A consideration on characteristics of Huffman codes for binary memoryless sources Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.) IT2012-1 |
We consider characteristics of Huffman codes for extended binary memoryless sources. The construction of Huffman codes c... [more] | IT2012-1 pp.1-6 |
|
| ICD | 2009-12-14 13:30 |
Shizuoka | Shizuoka University (Hamamatsu) | [Poster Presentation]
Associative-Memory-Based LSI with Adaptive-Learning Capability Akio Kawabata, Wataru Imafuku, Tania Ansari, Hans Juergen Mattausch, Tetsushi Koide (Hiroshima Univ.) ICD2009-93 |
When pattern recognition is achieved by conventional techniques, processing time becomes long and it is difficult to de... [more] | ICD2009-93 pp.89-94 |
| WBS | 2008-10-10 12:15 |
Yamaguchi | Yamaguchi Univ. | Spread Spectrum System Using Two-Valued Coding of Real-Valued Self-Orthogonal Finite-Length Sequences Yoshihiro Tanada, Masashi Ohwaki, Shoji Nakamichi, Yuya Teramoto, Yasuaki Ikegami (Daiichi Inst. of Tech.) WBS2008-45 |
Pseudonoise sequences for spread spectrum communication or radar system are desired to be the finite-length sequences wi... [more] | WBS2008-45 pp.87-92 |
| IT | 2008-09-11 14:30 |
Okinawa | Culture Resort Festone (Okinawa) | An Improvement for Lossless Data Compression Based on Grammatical Inference Bayu Yudistira, Koji Iwanuma, Hidetomo Nabeshima (Univ of Yamanashi) IT2008-22 |
Recently, the research on grammatical-inference data compression method has been done actively, such as Sequitur algorit... [more] | IT2008-22 pp.13-18 |
| ICD, SIP, IE, IPSJ-SLDM | 2006-10-26 11:30 |
Miyagi | Super parallel SIMD processor with CAM based high-speed pattern matching capability Yutaka Kono, Takeshi Kumaki, Masakatsu Ishizaki, Masaharu Tagami, Tetsushi Koide, Hans Juergen Mattausch (Hiroshima Univ.), Takayuki Gyohten, Hideyuki Noda, Yasuto Kuroda, Katsumi Dosaka, Kazutami Arimoto, Kazunori Saito (Renesas) |
A super parallel SIMD processor has been developed for handling the increasing amount of multimedia data efficiently. ... [more] |
SIP2006-90 ICD2006-116 IE2006-68 pp.39-44 |
|
| ICD, CPM | 2005-01-28 13:30 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A decompressor with buffer for test compression / decompression Michihiro, Masakuni Ochi, Hideyuki Ichihara, Tomoo Inoue (Hiroshima City Univ.) |
Test compression / decompression scheme using variable-length coding, e.g., Huffman coding, is effective in reducing the... [more] | CPM2004-168 ICD2004-213 pp.35-40 |
[Return to Top Page]