グローバルナビゲーションへ

本文へ

バナーエリアへ

フッターへ



ホーム > 教員情報 > 大学院 電気情報工学専攻 > 有村 光晴 講師

有村 光晴 講師


[担当課程]
博士前期課程

[取得学位]
博士(工学)東京大学(課程),1999年3月

研究テーマ

  • 情報理論、特にシャノン理論に関連する研究
  • データ圧縮アルゴリズムに関する研究
  • 情報理論に基づいた画像処理アルゴリズムに関する研究

主な研究業績

<著書>
  1. 白木善尚編, 村松純, 岩田賢一, 有村光晴, 渋谷智治著, 「情報理論」, オーム社, 2008年9月.

<論文>
  1. Ken-ichi Iwata and Mitsuharu Arimura, "Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet," IEICE Trans. Fundamentals, Vol. E99-A, No. 12, pp. 2130-2135, Dec., 2016.
  2. Mitsuharu Arimura, "Average Coding Rate of a Multi-Shot Tunstall Code with an Arbitrary Parsing Tree Sequence," IEICE Trans. Fundamentals, Vol. E99-A, No. 12, pp. 2281-2285, Dec., 2016.
  3. Mitsuharu Arimura, "Almost Sure Convergence Coding Theorems of One-shot and Multi-shot Tunstall Codes for Stationary Memoryless Sources," IEICE Trans. Fundamentals, Vol. E98-A, No. 12, pp. 2393-2406, Dec., 2015.
  4. Ken-ichi Iwata, Mitsuharu Arimura and Yuki Shima, "Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for k-th Order Markov Sources," IEICE Trans. Fundamentals, Vol. E97-A, No. 8, pp. 1754 1760, Aug., 2014.
  5. Mitsuharu Arimura, Hiroki Koga and Ken-ichi Iwata, "Redundancy-Optimal FF Codes for a General Source and its Relationships to the Rate-Optimal FF Codes," IEICE Trans. Fundamentals, Vol. E96-A, No. 12, pp. 2332-2342, Dec. 2013.
  6. Mitsuharu Arimura, Hiroki Koga and Ken-ichi Iwata, "A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code," IEICE Trans. Fundamentals, Vol. E96-A, No. 12, pp. 2443-2446, Dec. 2013.
  7. Mitsuharu Arimura, "On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources," IEICE Trans. Fundamentals, Vol. E93-A, No. 11, pp. 1904-1911, Nov. 2010.
  8. Mitsuharu Arimura and Hirosuke Yamamoto, "Asymptotic Redundancy of the MTF Scheme for Stationary Ergodic Sources," IEEE Transactions on Information Theory, Vol. 51, No. 11, pp. 3742-3752, Nov. 2005.
  9. Mitsuharu Arimura and Hirosuke Yamamoto, "Asymptotic Optimality of the Block Sorting Data Compression Algorithm," IEICE Trans. Fundamentals, Vol. E81-A, No. 10, pp. 2117-2122, Oct. 1998.
  10. Mitsuharu Arimura, Hirosuke Yamamoto, and Suguru Arimoto, "A Bitplane Tree Weighting Method for Lossless Compression of Gray Scale Images," IEICE Trans. Fundamentals, Vol. E80-A, No. 11, pp. 2268-2271, Nov. 1997.
<査読付き国際会議予稿集>
  1. Mitsuharu Arimura, "A Variable-to-Fixed Length Lossless Source Code Optimizing a Different Criterion of Average Coding Rate from Tunstall Code," Proc. 2016 International Symposium on Information Theory and its Applications (ISITA2016), pp. 667-671, Monterey, California, USA, Oct. 30-Nov. 2, 2016.
  2. Mitsuharu Arimura, "A Grammar-Based Compression Using a Variation of Chomsky Normal Form of Context Free Grammar," Proc. 2016 International Symposium on Information Theory and its Applications (ISITA2016), pp.~246-250, Monterey, California, USA, Oct. 30-Nov. 2, 2016.
  3. Mitsuharu Arimura and Hiroshi Nagaoka, "A Two-Step Universal VV Code Using an Asymptotically Sufficient Statistic Extracted from a VF Code," Proc. 2016 International Symposium on Information Theory and its Applications (ISITA2016), pp. 6-10, Monterey, California, USA, Oct. 30-Nov. 2, 2016.
  4. Ken-ichi Iwata and Mitsuharu Arimura, "Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet," Proc. 2015 Data Compression Conference (DCC2015), p. 452, Snowbird, Utah, USA, April 7-9, 2015.
  5. Mitsuharu Arimura, "On the Coding Rate of a Multishot Tunstall Code for Stationary Memoryless Sources," Proc. 2014 International Symposium on Information Theory and its Applications (ISITA2014), pp. 284 288, Melbourne, Australia, Oct. 26 29, 2014.
  6. Mitsuharu Arimura and Ken-ichi Iwata, "On Variable-to-Fixed Length Coding of a General Source with Infinite Alphabet," Proc. 2012 International Symposium on Information Theory and its Applications (ISITA2012), pp. 485-488, Honolulu, Hawaii, USA, Oct. 28-31, 2012.
  7. Ken-ichi Iwata, Mitsuharu Arimura, and Yuki Shima, "On the Maximum Redundancy of CSE for I.I.D. Sources," Proc. 2012 International Symposium on Information Theory and its Applications (ISITA2012), pp. 489-492, Honolulu, Hawaii, USA, Oct. 28-31, 2012.
  8. Hiroki Koga, Mitsuharu Arimura, and Ken-ichi Iwata, "Coding Theorems on the Worst-Case Redundancy of Fixed-Length Coding for a General Source," Proc. 2011 IEEE International Symposium on Information Theory (ISIT2011), pp. 1434-1438, Saint Petersberg, Russia, July 31-Aug. 5, 2011.
  9. Ken-ichi Iwata, Mitsuharu Arimura, and Yuki Shima, "An Improvement in Lossless Data Compression via Substring Enumeration," Proc. 10th IEEE/ACIS International Conference on Computer and Information Science (ICIS2011), pp. 219-223, Sanya, Hainan Island, China, May 16-18, 2011.
  10. Mitsuharu Arimura and Ken-ichi Iwata, "The Minimum Achievable Redundancy Rate of Fixed-to-Fixed Length Source Codes for General Sources," Proc. 2010 International Symposium on Information Theory and its Applications (ISITA2010), pp. 595-600, Taichung, Taiwan, Oct. 17-20, 2010.
  11. Mitsuharu Arimura and Ken-ichi Iwata, "On the Achievable Redundancy Rate of Fixed Length Source Code for General Sources," Proc. 2010 IEEE International Symposium on Information Theory (ISIT2010), pp. 126-130, Austin, TX, USA, June 13-18, 2010.
  12. Mitsuharu Arimura and Hiroshi Nagaoka, "An Extension of Asymptotically Sufficient Statistic Method for Pointwise Strong Universality," Proc. 2005 IEEE International Symposium on Information Theory (ISIT2005), pp. 505-509, Adelaide, Australia, Sept. 4-9, 2005.
  13. Mitsuharu Arimura and Hiroshi Nagaoka, "Asymptotically Sufficient Statistic Method for Evaluation of Pointwise Redundancy of FV Source Codes," Proc. 2004 International Symposium on Information Theory and its Applications (ISITA2004), pp. 769-774, Parma, Italy, Oct. 10-13, 2004.
  14. Mitsuharu Arimura and Hiroshi Nagaoka, "General Conditions for Existence of Weakly Universal FV Source Codes," Proc. 2003 IEEE International Symposium on Information Theory (ISIT2003), p. 110, Yokohama, Japan, June 29-July 4, 2003.
  15. Mitsuharu Arimura and Hirosuke Yamamoto, "Redundancy for the MTF Scheme for Stationary Ergodic Sources," Proc. 2002 IEEE International Symposium on Information Theory (ISIT2002), p. 289, Lausanne, Switzerland, June 30-July 5, 2002.
  16. Mitsuharu Arimura and Hirosuke Yamamoto, "Almost Sure Convergence Coding Theorem for Block Sorting Data Compression Algorithm," Proc. 1998 International Symposium on Information Theory and its Applications (ISITA98), pp. 286-289, Mexico City, Mexico, Oct. 14-16, 1998.
  17. Mitsuharu Arimura, Hirosuke Yamamoto, and Suguru Arimoto, "A Bitplane Tree Weighting Method for Gray Scale Images," Proc. 1996 International Symposium on Information Theory and its Applications (ISITA96), pp. 104-107, Victoria, B.C., Canada, Sept. 17-20, 1996.

<訳書>
  1. 山本博資, 古賀弘樹, 有村光晴, 岩本貢訳, 「情報理論 基礎と広がり」, 共立出版, 2012. (原著: Thomas M. Cover and Joy A. Thomas, Elements of Information Theory, 2nd Ed., John Wiley & Sons, Inc., 2006.)

<受賞など>
  1. 情報理論とその応用学会 奨励賞 (2000年)
  2. 電子情報通信学会 シニア会員認定 (2009年)
  3. 電子情報通信学会 基礎・境界ソサイエティ 貢献賞 (2013年)
  4. 湘南工科大学 工学研究科ベストティーチャーズ賞 (2016年)

ページの先頭へ戻る