工学博士, 大阪大学

Information Data Analysis

Information Theory

Analysis of Algorithms

Data Structure and Algorithms

Graph Theory

Advanced Networking

Video Compression

Source Coding

情報データ解析

情報理論

アルゴリズム解析

データ構造とアルゴリズム

グラフ理論

ネットワーク応用

動画像圧縮

情報源符号化

Manufacturing technology (mechanical, electrical/electronic, chemical engineering), Communication and network engineering

Informatics, Database science

Informatics, Mathematical informatics

01 Apr. 2016
University of Electro-Communications, Grad. School of Informatics and Engineering, Professor

01 Apr. 2005 - 31 Mar. 2016
The University of Electro-Communications, Graduate School of Information Systems, Professor

01 Apr. 2005
Grad. School of Inform. Systems, University of Electro-Communications, Professor

Mar. 1983
Osaka University, Graduate School, Division of Engineering Science, 物理系専攻

Mar. 1980
Osaka University, Graduate School, Division of Engineering Science, 物理系専攻

Mar. 1978
Osaka University, Faculty of Engineering Science, 生物工学科

01 May 2013 - 30 Apr. 2015
副会長, 電子情報通信学会基礎境界ソサエティ, Society

Jan. 2010 - Dec. 2010
SITA2010プログラム委員長, 情報理論とその応用学会, Society

Jan. 2010 - Dec. 2010
情報理論とその応用学会副会長, 情報理論とその応用学会, Society

Jan. 2008 - Dec. 2009
Chair of IEEE Information Theory Society Japan Chapter, IEEE, Society

Jan. 2007 - Dec. 2008
国際担当, 情報理論とその応用学会, Society

Jan. 2005 - Dec. 2005
英文論文誌Ａ小特集号ゲスト編集委員長, 電子情報通信学会, Society

Apr. 2005 - Oct. 2005
第２８回情報理論とその応用シンポジウムプログラム委員長, 情報理論とその応用学会, Society

May 2003 - Apr. 2005
大会幹事, 電子情報通信学会, Society

Jan. 2005
情報理論とその応用学会評議員, 情報理論とその応用学会, Society

Jan. 2003 - Dec. 2004
企画理事, 情報理論とその応用学会, Society

Jun. 2003 - May 2004
論文誌編集委員会理論グループ主査, 情報処理学会, Society

Jun. 2000 - May 2004
論文誌編集委員会理論グループ委員, 情報処理学会, Society

Jun. 2002 - May 2003
論文誌編集委員会理論グループ副査, 情報処理学会, Society

Apr. 1989 - Mar. 1993
企画幹事, 情報理論とその応用学会, Society

Compression by Substring Enumeration Using Sorted Contingency Tables
Takahiro Ota; Hiroyoshi Morita; Akiko Manada
IEICE Information, E103-A, 6, Jun. 2020, Peer-reviwed
Scientific journal, English

六角形格子上の積符号を用いた符号化変調方式によるPAPRの低減
北原 裕久; 森田 啓義; 眞田 亜紀子
電子情報通信学会論文誌, 電子情報通信学会, J103-B, 5, 184-197, May 2020, Peer-reviwed
Scientific journal, Japanese

On the 10BASE-T1S preamble for multidrop
Gergely Huszak; Hiroyoshi Morita
Proc. of 2019 Global Information Infrastructure and Networking Symposium (GIIS), IEEE, 1-6, 18 Dec. 2019, Peer-reviwed
International conference proceedings, English

Double Nearest-Neighbor Error Correcting Codes on Hexagonal Signal Constellation
Hiroyoshi Morita
Proc. 2019 IEEE International Symposium on Information Theory, ISIT 2019, IEEE, 1617-1621, 07 Jul. 2019, Peer-reviwed
International conference proceedings, English

A Universal Two-Dimensional Source Coding by Means of Subblock Enumeration
Takahiro Ota; Hiroyoshi Morita; Akiko Manada
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, IEICE, E102.A, 2, 440-449, Feb. 2019, Peer-reviwed
Scientific journal, English

Graph Theoretical Analysis on Distributed Line Graphs for Peer-to-Peer Networks
Akiko Manada; Hiroyoshi Morita
IEEE Trans. on Network Science and Engineering, IEEE, 6, 3, 326-335, 2019, Peer-reviwed
Scientific journal, English

Compression by Substring Enumeration with a Finite Alphabet Using Sorting
Takahiro Ota; Hiroyoshi Morita; Akiko Manada
Proc. of ISITA2018, IEICE, 1, 587-591, 28 Oct. 2018, Peer-reviwed
International conference proceedings, English

Analysis of Walking Body Using Kinect2 and Application of Integer Code to WBAN
Hirohisa Kitahara; Hiroyoshi Morita; Akiko Manada
Proc. of 13th EAI International Conference on Body Area Networks, 1, 1, 1-7, 02 Oct. 2018, Peer-reviwed
International conference proceedings, English

On the Capacity of Write-Constrained Memories
Tetsuya Kobayashi; Hiroyoshi Morita; Akiko Manada
IEEE Transactions on Information Theory, IEEE, 64, 7, 5101-5109, 15 Aug. 2017, Peer-reviwed
Research society, English

Two-Dimensional Source Coding by Means of Subblock Enumeration
Takahiro Ota; Hiroyoshi Morita
Proc. of ISIT 2017, 306-310, 26 Jun. 2017, Peer-reviwed
International conference proceedings, English

On the Capacities of Balanced Codes with Run-Length Constraints
Akiko Manada; Hiroyoshi Morita
Proc. of ISIT 2017, IEEE, 1391-1395, 26 Jun. 2017, Peer-reviwed
International conference proceedings, English

A Compact Tree Representation of an Antidictionary
Takahiro Ota; Hiroyoshi Morita
IEICE Trans. on Fundamentals,, The Institute of Electronics, Information and Communication Engineers, Vol.E100-A, No. 9, 1973-1984, 2017, Peer-reviwed,

In both theoretical analysis and practical use for an antidictionary coding algorithm, an important problem is how to encode an antidictionary of an input source. This paper presents a proposal for a compact tree representation of an antidictionary built from a circular string for an input source. We use a technique for encoding a tree in the compression via substring enumeration to encode a tree representation of the antidictionary. Moreover, we propose a new two-pass universal antidictionary coding algorithm by means of the proposal tree representation. We prove that the proposed algorithm is asymptotic optimal for a stationary ergodic source.

Scientific journal, English

A Grouping Based on Local Girths for the Group Shuffled Belief Propagation Decoding
Akiko Manada; Kyohei Yoshida; Hiroyoshi Morita; Ryuichi Tatasukawa
IEEE COMMUNICATIONS LETTERS, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 20, 11, 2133-2136, Nov. 2016, Peer-reviwed, Low-density parity-check codes have been known to exhibit good error correcting performance by using with the belief propagation (BP) decoding. The group shuffled BP decoding, which is a modification of the BP decoding, can exhibit a better performance than BP decoding by suitably grouping variable nodes in a Tanner graph. In this letter, we propose a new grouping of variable nodes based on local girths and evaluate its performance.
Scientific journal, English

A Finite Graph Representation for Two-Dimensional Finite Type Constrained Systems
Takahiro Ota; Akiko Manada; Hiroyoshi Morita
Proc. of ISiTA2016, IEICE, 51-55, 30 Oct. 2016, Peer-reviwed
International conference proceedings, English

A Two-Dimensional Antidictionary Automaton for a Toric Surface
Takahiro Ota; Akiko Manada; Hiroyoshi Morita
Proc. ISITA2016, IEICE, 71-75, 30 Oct. 2016, Peer-reviwed
International conference proceedings, English

Nearest-Neighbor Error Correcting Codes on a Hexagonal Signal Constellation
Hiroyoshi Morita
2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), IEEE, 2480-2484, 2015, Peer-reviwed, We propose a new class of single error correcting linear codes suitable for a two dimensional hexagonal constellation. The proposed code is a linear subspace of Z(6n+1)(n) where n is code length and 6n + 1 is a prime number. It corrects a single error in the set {+/-1, +/-alpha(n), +/-alpha(2n)} where alpha is a primitive element of Z(6n+1)(x). Moreover, we apply the proposed code to a two dimensional hexagonal constellation and show that it corrects an error such that a transmitted symbol moves to one of its nearest neighbors over the hexagonal constellation at the decoder side. We also consider an extension of the proposed code to double nearest neighbor error correcting codes. Some examples of such codes obtained by computer-assisted search are presented.
International conference proceedings, English

On Rate Tradeoffs for Erasable Write-Once Memory Codes
Tetsuya Kobayashi; Hiroyoshi Morita; Akiko Manada
2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), IEEE, 1312-1316, 2015, Peer-reviwed, To formulate rewriting operations on flash memory, we extend Write-Once Memory (WOM) and introduce Erasable WOM (EWOM) which allows block erasures, and then we define codes to rewrite on them. To measure performances of EWOM codes, we introduce the rate tradeoff pair, which is derived from the sum rate. We give an outer bound of the region of the possible tradeoff pairs for a certain class of EWOM's. We also propose fixed-rate EWOM codes called WOM2E codes that utilize existing WOM codes. It reveals that WOM2E scheme is optimal in terms of rate tradeoff pair when the block size of EWOM is "infinity."
International conference proceedings, English

On a Two-Dimensional Antidictionary Construction Using Suffix Tries
Takahiro Ota; Hiroyoshi Morita
2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), IEEE, 2974-2978, 2015, Peer-reviwed, Antidictionaries are in particular useful for source coding. In one dimension, for an input string, there are fast construction algorithms of an antidictionary in which a suffix tree that stores all the substrings of the string is utilized. However, in two dimension (2D), for an n x n input square or rectangle, there is no fast construction algorithm of an antidictionary except a straight-forward algorithm in O(n(8)) time.
In this paper, we propose a 2D suffix trie which stores all the subrectangles of an input rectangle and present an algorithm to construct a 2D suffix trie in O(n(4) log n) time. A 2D suffix trie consists of two suffix tries with suffix links rowwise and columnwise. Moreover, we propose a fast construction algorithm of a two-dimensional antidictionary using a 2D suffix trie in O(n(5) log n) time, and their effectivenesses are demonstrated by simulation results.
International conference proceedings, English

認証鍵の生成・管理のための多次元インデックス法
董 際国; 森田啓義
電子情報通信学会和文論文誌D, J98-D, 1, 206-213, 2015, Peer-reviwed
Scientific journal, Japanese

On a Two-Dimensional Antidictionary
Takahiro Ota; Hiroyoshi Morita
Proc. of ISITA2014, IEICE, 289-293, 26 Oct. 2014, Peer-reviwed
International conference proceedings, English

On Some Properties of Distributed Line Graphs
Akiko Manada; Hiroyoshi Morita
Proc. of ISITA2014, IEICE, 386-390, 26 Oct. 2014, Peer-reviwed
International conference proceedings, English

Position Modulation Code for Non-Binary Write-Once Memories
Tetsuya Kobayashi; Hiroyoshi Morita; Akiko Manada
Proc. of ISITA2014, IEICE, 613-617, 26 Oct. 2014, Peer-reviwed
International conference proceedings, English

Dynamic construction of an antidictionary with linear complexity
Takahiro Ota; Hirotada Fukae; Hiroyoshi Morita
THEORETICAL COMPUTER SCIENCE, ELSEVIER SCIENCE BV, 526, 20, 108-119, Mar. 2014, Peer-reviwed, An antidictionary is in particular useful for data compression. Static construction algorithms of antidictionaries with linear complexity have been proposed. However, the construction algorithms do not work in a dynamic manner with linear complexity. In this paper, we propose a dynamic construction algorithm of an antidictionary with linear complexity. The proposed algorithm uses two linear construction algorithms of suffix trees proposed by Weiner and Ukkonen, individually. It is proved that the proposed algorithm works with linear complexity. Moreover, its effectiveness is demonstrated by simulation results. (C) 2014 Elsevier B.V. All rights reserved.
Scientific journal, English

An Antidictionary Construction Algorithm with Linear Complexity Using Array
Hirotada Fukae; Takahiro Ota; Hiroyoshi Morita
電子情報通信学会論文誌 A, The Institute of Electronics, Information and Communication Engineers, J97-A, 1, 33-44, Jan. 2014, Peer-reviwed, 反辞書とは,一般的な辞書とは異なり,入力系列上で未出現の記号列を集めた辞書である.Crochemoreらが提案した反辞書法で用いられ,同期符号や不整脈検出などにも応用が提案されている.しかし,反辞書の構築は,計算量が線形とはいえ係数が大きく,膨大な記憶量と計算時間を必要とする.本論文では,より効率的に反辞書を構築できる,配列を用いる手法を提案した.計算機実験では,従来の接尾辞木を用いた手法と比較して,計算時間が約20分の1,記憶量が約2.5分の1であることがわかった.
Scientific journal, Japanese

On the Capacity of Write-Constrained Memories
Tetsuya Kobayashi; Hiroyoshi Morita; Akiko Manada
2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), IEEE, 2252-2256, 2014, Peer-reviwed, Rivest and Shamir introduced Write-Once Memory (WOM), a model of storage devices whose storage elements have restrictions on state transitions, and they presented some coding methods to reuse WOM. An interesting question about WOM is how efficiently we can reuse it with the best coding method, and as an answer to the question, Fu and Han Vinck determined the capacity of Fiat and Shamir's generalized WOM. In this paper, we extend their results, introducing Write-Constrained Memory (WCM) that considers state transition cost, and determining the capacity of WCM under a certain type of cost constraints.
International conference proceedings, English

High-accuracy time-variant recommender system with Number-Score curve
Kazushige Hiroi; Hiroyoshi Morita
2014 IEEE Fourth International Conference on Consumer Electronics Berlin (ICCE-Berlin), IEEE, 106-110, 2014, Peer-reviwed, Recommender systems are becoming more effective as information becomes extensive. Conventional recommender systems show a list of recommended items, but the number of recommended items shown must be limited in some systems. For example, the recommender system for TV programs in a hard disk recorder has only a limited user interface and hardware resources, such as a remote controller, low display resolution, and limited hard disk capacity. Moreover, recommended TV programs must be changed in accordance with the time and day in this system. Thus, for these "time-variant" recommender systems, items must be recommended as accurately as possible within the limited number of recommended items. In this paper, we propose a high-accuracy time-variant recommender system with a "Number-Score curve", which indicates the relationship between the recommendation score and the number of recommended items. We examine a recommender system for TV programs in the hard disk recorder that can achieve 82% precision and 78% recall for the recommended results with the Number-Score curve.
International conference proceedings, English

On a Universal Antidictionary Coding for Stationary Ergodic Sources with Finite Alphabet
Takahiro Ota; Hiroyoshi Morita
2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), IEEE, 294-298, 2014, Peer-reviwed, This paper shows that a two- pass universal antidictionary coding method is asymptotically optimal for stationary ergodic sources with a finite alphabet. To prove the results, we propose a new compact tree representation of an antidictionary. We also extend the lossless compression algorithm proposed by Dube and Beaudoin, called CSE, from the binary alphabet to the q-ary alphabet (q >= 2), which we utilize to efficiently compress the antidictionary of an input sequence to be encoded.
International conference proceedings, English

On the Irreducibility of Certain Shifts of Finite Type
Tetsuya Kobayashi; Akiko Manada; Takahiro Ota; Hiroyoshi Morita
IEICE Trans. on Fundamentals, E96, 12, 2415-2421, Dec. 2013, Peer-reviwed
Scientific journal, English

Real-Time and Memory-Efficient Arrhythmia Detection in ECG Monitors Using Antidictionary Coding
Takahiro OTA; Hiroyoshi Morita; Adriaan J. de L; van Wijngaarden
IEICE Trans. on Fundamentals, E96, 12, 2343--2350, Dec. 2013, Peer-reviwed
Scientific journal, English

Semantic Analysis of Structured High-definition MPEG-2 Soccer Video Using Bayesian Network
Jiang Feihu; Hiroyoshi Morita; Akiko Manada
Proc. Information Systems International Conference (ISICO) 2013, 483-490, Dec. 2013, Peer-reviwed
International conference proceedings, English

On Antidictionary Coding Based on Compacted Substring Automaton
Takahiro Ota; Hiroyosi Morita
Proc. of 2013 IEEE International Symposium on Information Theory, 1754-1758, Jul. 2013, Peer-reviwed
International conference proceedings, English

ロジスティック写像の諸性質：発散，収束，周期性
董 際国; 森田 啓義
電子情報通信学会論文誌 A, J96-A, 2, 90-99, Feb. 2013, Peer-reviwed
Scientific journal, Japanese

A Geographic Location-Based Distributed Routing System
Kumiko Kobayashi; I Gusti Bagus; Baskara Nugraha; Hiroyoshi Morita
IEICE Trans. Commun., E96-B, 1, 88-98, Jan. 2013, Peer-reviwed
Scientific journal, English

An XOR Encoding for Wireless Body Area Networks
Keigo Yokota; Akiko Manada; Hiroyoshi Morita
Proc. 8th International Conference on Body Area Networks (BodyNets2013), 999-999, 2013, Peer-reviwed
International conference proceedings, English

On Real-Time Arrhythmia Detection in ECG Monitors Using Antidictionary Coding
Takahiro Ota; Hiroyoshi Morita
Proc. of ISITA2012, 194-198, Oct. 2012, Peer-reviwed
International conference proceedings, English

On Fast and Memory-Efficient Construction of an Antidictionary Array
Hirotada Fukae; Takahiro Ota; Hiroyoshi Morita
Proc. of 2012 IEEE International Symposium on Information Theory, 1097-1101, Jul. 2012, Peer-reviwed
International conference proceedings, English

Random Numbers Generation by means of Integer logistic map and mixing operation
Jiguo Dong; Hiroyoshi Moria
電子情報通信学会論文誌, The Institute of Electronics, Information and Communication Engineers, J94-A, 12, pp. 923-931, Dec. 2011, Peer-reviwed, 整数演算を用いて計算精度nビットのロジスティック写像x_=4x_t(1-x_t)を計算し,計算過程に存在する2nビットの内部状態を利用した撹拌方法に基づく擬似乱数生成法を提案した.また,生成した乱数列に対し,初期値敏感性をハミング距離の収束の速さで提案法とMTと比較を行い,提案法の効果を示した.そして,計算精度n=128ビットで生成される2進数列に対し,統計的検定を行い,一様性をもつとの結論を得た.
Scientific journal, Japanese

URL

A Collective Intelligence Based Approach to Business-to-Business E-Marketplaces
Youssef Iguider; Hiroyoshi Morita
International Journal of computer Science Issues, 8, 5, 12-19, Sep. 2011, Peer-reviwed
Scientific journal, English

On the Dynamic Construction of an Antidictionary with Linear Complexity
Takahiro Ota; Hiroyoshi Morita; Hirotada Fukae
ISIT2011: 2011 IEEE International Symposium on Information Theory Proceedings, 2519-2523, Jul. 2011, Peer-reviwed
International conference proceedings, English

An Efficient Construction of Antidictionary Using Suffix Array
Hiroyoshi Morita; Hirotada Fukae; Takahiro Ota
Proc. of the workshop AEW7, 7th-Asia-Europe Workshop "Concepts in Information Theory", 79-81, Jul. 2011
International conference proceedings, English

A collective intelligence based business-matching and recommending system for next generation e-marketplaces
Youssef Iguider; Hiroyoshi Morita
ISCI 2011 - 2011 IEEE Symposium on Computers and Informatics, 489-494, 2011, Peer-reviwed, The present work proposes and describes a novel approach to business-matching and recommending systems, for the next-generation e-marketplaces, with a focus on the needs and realities of small business. The proposed matching system makes use of Collective Intelligence (IC) means to identify and recommend the best matching business opportunities for the user. At first, the content of business proposals and companies' profiles are parsed and indexed. The search engine starts by expanding the keyword of interest, to enable an intuitive-like search. The look-up results are then filtered based on a compatibility scoring mechanism. The customized business-matching results and recommendations are later served to the user via a novel visual interactive graphical interface. A prototype system applying the proposed and described approach is currently being developed and experimentally tested, to fully demonstrate the capabilities of the proposed system on real-world data. Although the prototype is at an early stage, the initial experiments show promising results. © 2011 IEEE.
International conference proceedings, English

On (+1/-1) Error Correctable Integer Codes
Hristo Kostadinov; Hiroyoshi Morita; Nikolai Manev
IEICE Trans. on Fundamentals, E93-A, 12, 2758-2761, Dec. 2010, Peer-reviwed
Scientific journal, English

On-Line Electrocardiogram Lossless Compression Using Antidictionary Codes for a Finite Alphabet
Takahiro Ota; Hiroyoshi Morita
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, E93D, 12, 3384-3391, Dec. 2010, Peer-reviwed, An antidictionary is particularly useful for data compression and on line electrocardiogram (ECG) lossless compression algorithms using antidictionaries have been proposed They work in real time with constant memory and give better compression ratios than traditional lossless data compression algorithms while they only deal with ECG data on a binary alphabet This paper proposes on line ECG lossless compression for a given data on a finite alphabet The proposed algorithm gives not only better compression ratios than those algorithms but also uses less computational space than they do Moreover the proposed algorithm work in real time Its effectiveness is demonstrated by simulation results
Scientific journal, English

Realizing and Evaluating Mutual Anonymity in P2P Networks
Chigusa Kawashima; I.G.B; Baskara Nugraha; Hiroyoshi Morita; Todorka Alexandrova
Proc. of ISITA2010, 66-71, Oct. 2010
International conference proceedings, English

On the Adaptive Antidictionary Code Using Minimal Forbidden Words with Constant Lengths
Takahiro Ota; Hiroyoshi Morita
Proc. of ISITA2010, 72-77, Oct. 2010, Peer-reviwed
International conference proceedings, English

Soft Decoding of Integer Codes and Their Application to Coded Modulation
Hristo Kostadinov; Hiroyoshi Morita; Noboru Iijima; A. J. Han Vinck; Nikolai Manev
IEICE Trans. Fundamentals, E93-A, 7, 1363-1370, Jul. 2010, Peer-reviwed
Scientific journal, English

Branch Prediction Based on Antidictionary Tree
西新幹彦; 森田啓義; 太田隆博
電子情報通信学会論文誌, The Institute of Electronics, Information and Communication Engineers, J93-A, 3, 204-206, Mar. 2010, Peer-reviwed, パイプライン処理によるマイクロプロセッサの高速化の効果を十分に生かすためには,分岐成立の有無を高い精度で予測することが必要である.計算機資源に制限をおかないという条件のもとで,吉瀬と岩田は分岐成立の有無を実行順に並べた二元系列に対してJacquetらの手法でパターンマッチングに基づく分岐予測を行い,高い精度を達成した.の手法は定常ミクシング情報源に対して漸近的に最良な予測をすることが理論的に保証されている.一方,Ota and Moritaは接尾辞木を拡張した反辞書木と呼ばれる構造を用いて,パターンマッチングに相当する処理を線形の計算時間で行うモデリング手法を提案している.そこで本論文では,線形時間で同等の結果を得るために,の手法を分岐予測に適用することを提案する.実験の結果,とほぼ同等の予測精度を達成しつつ,実行時間は50分の1から5400分の1程度に短縮された.
Scientific journal, Japanese

Asymptotic Optimality of Antidictionary Codes
Takahiro Ota; Hiroyoshi Morita
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, IEEE, 101-105, 2010, Peer-reviwed, An antidictionary code is a lossless compression algorithm using an antidictionary which is a set of minimal words that do not occur as substrings in an input string. The code was proposed by Crochemore et al. in 2000, and its asymptotic optimality has been proved with respect to only a specific information source, called balanced binary source that is a binary Markov source in which a state transition occurs with probability 1/2 or 1. In this paper, we prove the optimality of both static and dynamic antidictionary codes with respect to a stationary ergodic Markov source on finite alphabet such that a state transition occurs with probability p (0 < p <= 1).
International conference proceedings, English

MULTIPLE OBJECT TRACKING ON STATIC SURVEILLANCE VIDEO USING FIELD-BASED PREDICTION INFORMATION IN MPEG-2 VIDEO
I. Gusti Bagus Baskara Nugraha; Suwen Weng; Hiroyoshi Morita
2010 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, IEEE, 4625-4628, 2010, Peer-reviwed, We present new algorithms to detect and track multiple moving objects in a static surveillance video that uses MPEG-2 compression. The algorithm detects moving objects based on the location of field-based motion estimated macroblocks in inter-prediction frames, and tracks their movements along video scene by using an extension of Kalman filter that uses the objects' velocity information. Experiments show that the algorithm outputs highly accurate results in various scenarios.
International conference proceedings, English

Length of Minimal Forbidden Words on a Stationary Ergodic Source
Takahiro Ota; Hiroyoshi Morita
Proc. 2009 IEEE International Symposium on Information Theory, 537-540, Jul. 2009, Peer-reviwed
International conference proceedings, English

On \pm 1-error correctable integer residue codes
Hristo Kostadinov; Nikolai L. Manev; Hiroyoshi Morita
Proc. of Sixth International Workshop on Optimal Codes and Related Topics, pp.117--125, Jun. 2009, Peer-reviwed
International conference proceedings, English

Transcoding-after-Smoothing System for VBR MPEG Video Streaming
I Gusti Bagus; Baskara Nugraha; Hiroyoshi Morita
IEICE Transactions on Information and Systems, The Institute of Electronics, Information and Communication Engineers, E92-D, 2, 298-309, Feb. 2009, Peer-reviwed, Delivering video streaming service over the Internet encounters some challenges. Two of them are heterogeneity of networks capacity and variability of video data rate. The capacity of network segments are constrained. Meanwhile, the rate of video data to be transmitted is highly variable in order to get near-constant images quality. Therefore, to send variable bit rate (VBR) video data over capacity-constrained network, its bit rate should be adjusted. In this paper a system to adjust the transmission bit rate of VBR MPEG video data called Transcoding-after-Smoothing (TaS), which is a combination of bit rate transcoding and bit rate smoothing algorithm, is proposed. The system smoothes out transmission rate of video data while at the same time also performs transcoding on some video frames when necessary in order to keep the transmission bit rate below a certain threshold value. Two kinds of TaS methods are proposed. One method does not have transcoding preference, while the other method uses frame type preference where an intra-coded frame is the last one that will be transcoded. These methods are implemented in our video server where a VBR video data is accessed by a client. Our experiment results show that the first TaS method yields significant reduction in the number of transcoded frames compared with the second TaS method and conventional frame-level transcoding. However, the second method performs better in minimizing the quality distortion.

Scientific journal, English

On-line Electrocardiogram Lossless Compression Using Antidictionary-Based Methods
Takahiro Ota; Hiroyoshi Morita
Proc. of Third International Symposium on Medical Information and Communication Technologies, day 2, 11:30-11:45, Feb. 2009, Peer-reviwed
International conference proceedings, English

On the Sliding Window Variations of Antidictionary Data Compression Using Dynamic Suffix Trees
Takahiro Ota; Hiroyoshi Morita
Proc. of International Symposium on Information Theory and its Applications, ISITA 2008, 1105-1110, Dec. 2008, Peer-reviwed
International conference proceedings, English

Double Error Correctable Integer Code and its Application to QAM
Hristo Kostadinov; Hiroyoshi Morita; Noburo Iijima; Nikolai Manev
Proc. of International Symposium on Information Theory and its Applications, ISITA2008, 566-571, Dec. 2008, Peer-reviwed
International conference proceedings, English

On Increasing the Number of Usrs in (t,n) Threshold Secret Sharing Schemes
Todorka Alexandrova; Hiroyoshi Morita
IEICE Trans Fundamentals, E91-A, 8, 2138--2150, Aug. 2008, Peer-reviwed
Scientific journal, English

Double \pm 1-error correctable codes and their applications to modulation schemes
Hristo Kostadinov; Nikolai L. Manev; Hiroyoshi Morita
Proc. Eleventh International Workshop on Algebraic and Combinatroial Coding Theory, 53-58, Jun. 2008, Peer-reviwed
International conference proceedings, English

On the Electrocardiogram Lossless Data Compression Using Almost Antidictionaries
Takahiro OTA; Hiroyoshi Morita
長野県工科短期大学校紀要, 11, 21-27, Mar. 2008, Peer-reviwed
Research institution, English

On Some Properties of the (t, n) Threshold Secret Sharing Schemes Based on the Generalized Vector Space Construction
Todorka Alexandrova; Hiroyoshi Morita
2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, IEEE, 30-35, 2008, Peer-reviwed, In this paper some of the properties of the (t, n) threshold secret sharing schemes, based on the generalized vector space construction, are discussed. The relations between the size of the shares and the number of the users n in the (t, n) threshold secret sharing schemes are presented. Moreover, it is shown how a qualified set of users can efficiently recover the secret in case of (2, n) and (3, n) threshold secret sharing schemes, exploiting the regular structure of the matrices corresponding to each of the n users.
International conference proceedings, English

On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree
Takahiro Ota; Hiroyoshi Morita
IEICE Trans. Fundamentals, E90-A, 11, 2533-2539, Nov. 2007, Peer-reviwed
Scientific journal, English

On Single Cross Error Correcting Integer Codes with Minimum-Energy Signal Constellations
Hiroyoshi Morita; Ko Kamada; Adiraan van Wijngaarden; Hristo Kostadinov
Proc. of the 2007 IEEE International Symposium of Information Theory, 26-30, Jun. 2007, Peer-reviwed
International conference proceedings, English

On the On-line Arithmetic Coding Based on Antidictionarie with Linear Complexity
Takahiro Ota; Hiroyoshi Morita
Proc. of the 2007 IEEE International Symposium on Information Theory, 86-90, Jun. 2007, Peer-reviwed
International conference proceedings, English

On Stochastic Model for Generating Process of Codewords of Arithmetic Code
西新 幹彦; 渡邊 大; 森田 啓義
電子情報通信学会論文誌A, The Institute of Electronics, Information and Communication Engineers, J90-A, 2, 170-174, Feb. 2007, Peer-reviwed, 算術符号を用いた符号化では,情報源系列の先頭部分を見ることによって符号語の先頭部分を決めることができる.本論文では,清報原系列のシンボルを一つずつ入力したときの符号語の生成過程や復号系列の生成過程を観測した実験結果を示し,その結果をもとにそれらが幾何分布の性質をもっていることを示す.また,符号化と復号化に伴う遅延を観測した実験結果から,実時間伝送システムで安定した再生をするための初期遅延のしきい値を求める.
Scientific journal, Japanese

On Construction of Reversible Variable-Length Codes Including Resynchronization Markers as Codewords
Dongzhao Sun; Hiroyoshi Morita; Mikihiko Nishiara
Proc. of ISITA2006, 12-16, Nov. 2006, Peer-reviwed
International conference proceedings, English

Perfect (2,n) Threshold Secret Sharing Systems Based on Binary Matrices with Constant Column Weight
Todorka Alexandrova; Hiroyoshi Morita
Proc. of ISITA2006, 386-391, Oct. 2006, Peer-reviwed
International conference proceedings, English

On Signal Constellation of Single Cross Error Correcting Integer Codes
Hiroyoshi Morita; Adriaan J; van Wijngaarden
Proc. of Workshop on Concepts in Information Theory, AEW5, 7-9, Oct. 2006
International conference proceedings, English

Data Compression Using Antidictionary Trees - A New Approach for Source Coding
Hiroyoshi Morita
Proc. of International Symposium on Advanced Robotics and Machine Intelligence, 68, Oct. 2006
International conference proceedings, English

A Hybrid Multicast Communication System for Internet Video Broadcasting
I Gusti Bagus; Baskara Nugraha; Mikihiko Nishiara; Hiroyoshi Morita
Transactions on Electrical Eng., Electronics, and Communications, 4, 2, 103-111, Aug. 2006, Peer-reviwed
Scientific journal, English

On the Construction of Integer Codes with Minimal Signal Point Constellations
Hiroyoshi Morita; Adriaan J; van Wijngaarden; Albert Geyser
Proc. of ISIT 2006, 1075-1079, Jul. 2006, Peer-reviwed
International conference proceedings, English

On the Construction of an Antidictionary of a Binary String with Linear Complexity
Takahiro Ota; Hiroyoshi Morita
Proc. of ISIT 2006, 2343-2347, Jul. 2006, Peer-reviwed
International conference proceedings, English

Multicast communication for video broadcasting service over IPv4 network using IP option
I. Gusti Bagus Baskara Nugraha; Sumiya Marugami; Mikihiko Nishiaira; Hiroyoshi Morita
IEICE TRANSACTIONS ON COMMUNICATIONS, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, E89B, 5, 1570-1580, May 2006, Peer-reviwed, In this paper, we propose a protocol, for multicast communication called Multicast Datagrarn Transfer Protocol (MDTP) to provide multicast for video broadcasting service on the Internet. MDTP is a one-to-many multicast communication protocol, which is constructed based on IPv4 unicast protocol by utilizing IP Router Alert Option, and it uses unicast addressing and unicast routing protocol. A mechanism is presented to allow a router to remove identical video stream, to duplicate a video stream, and to forward each copy of the duplicated video stream to its destinations. Ordinary IP routers that do not support MDTP will treat the MDTP packets as normal unicast packets. Hence, gradual deployment is possible without tunneling technique. With a delegation mechanism, MDTP router is also able to handle request from clients, and serve the requested video stream. The simulation results show that the average bandwidth usage of MDTP is close to the average bandwidth usage of IP multicast. MDTP also has greater efficiency than XCAST, and its efficiency becomes significant for a large number of clients.
Scientific journal, English

On Multiple Smoothed Transmission of MPEG Video Streams
Dongzhao Sun; Mikihiko Nishiara; Hiroyoshi Morita
IEICE Trans. Fundamentals, E88-A, 10, 2844-2851, Oct. 2005, Peer-reviwed
Scientific journal, English

A Hybrid Multicast Communication System for Internet Video Broadcasting
I G. B; B. Nugraha; M. Nishiara; H. Morita
Proc. International Symposium on Communications and Information Technologies 2005, 13-18, Oct. 2005, Peer-reviwed
International conference proceedings, English

Cut Detection in MPEG2 Compressed Data Using Macro Block Types
Shingo Aoki; Hiroyoshi Morita; Yoshitake Aramata; Mikihiko NIshiara
情報処理学会論文誌：コンピュータビジョンとイメージメディア, Information Processing Society of Japan (IPSJ), 46, SIG15, 51-58, Oct. 2005, Peer-reviwed, We propose a method to detect both of instantaneous and dissolved shots from MPEG2 data without decoding the entire volume of video signals. The proposed method consists of two detection algorithms in a hierarchical fashion. One algorithm coarsely detects shots in GOP unit by extracting I-frame information from the MPEG data stream. The other identifies the exact boundary between shots in frame unit using detailed information on types of macro blocks contained in the data stream. The proposed method perform faster and more efficient than traditional ones. Experimental results on some video data show that our method achieved 90〜95% detection rate with about quoter of normal playback time for detecting instantaneous shots. Moreover, it suppressed the erroneous detection rate within 5%. As for dissolved shots, the proposed method attained more than 80% detection rate over all the video used in the experiment and the mean of detection ability is about 20% higher than the traditional ones.
Scientific journal, Japanese

A tight upper bound on the size of the antidictionary of a binary string
Hiroyoshi Morita; Takahiro Ota
Proc. of 2005 International Conference on Analysis of Algorithms, 391-396, Jun. 2005, Peer-reviwed
International conference proceedings, English

On optimal scale upper bound in wavelet-based estimation for hurst index of fractional Brownian motion
Shuhji Kawasakiy; Hiroyoshi Moritaz
Journal of Interdisciplinary Mathematics, 8, 2, 195-214, 2005, Peer-reviwed, We give an evaluation of limit variance σ2H,J in the central limit theorem for waveletbased estimator of the Hurst index of fractional Brownian motion (FBM). σ2H,J is the variance of a certain linear sum (with respect to scale j) of random variables. As a result, contribution to variance of the linear form turns out to be mostly its diagonal part components, which can be considered as a form of frequency localization (FL) property of wavelet coefficients of FBM. This FL property, together with specifiability of small J behavior of σ2H,J, is applied to determine the optimal upper bound of scale j used in the estimation. © Taru Publications.
Scientific journal, English

On multimode polarity-switch codes of rate 1-1/n
H Morita; M Satoh; AJ van Wijngaarden
2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, IEEE, 387-391, 2005, Peer-reviwed, A new class of DC-free codes of odd length is presented. The new codes, related to polarity-switch (PS) codes, make use of a redefinition of the running digital sum. The spectral efficiency of the new codes is determined, and it is shown that they provide better power suppression in the low-frequency region than classical PS codes.
International conference proceedings, English

Derivation on Bit Error Probability of Coded QAM using Integer Codes
Hristo Kostadinov; Hiroyoshi Morita; Nikolai Manev
IEICE Trans. Fundamentals, E87-A, 12, 3397-3403, Dec. 2004, Peer-reviwed
Scientific journal, English

On Source Conversion using Arithmetic Codes
Hiroyoshi Morita; M. Hosh; K. Kobayashi
Proc. of Workshop on Concepts in Information Theory, 13-15, Oct. 2004
International conference proceedings, English

Interval Algorithm, Arithmetic Coding, and Shift Operator
Mamoru Hoshi; Hiroyoshi Morita; Kingo Kobayashi
Proc. of Workshop on Concepts in Information Theory, 39-42, Oct. 2004
International conference proceedings, English

Trees and Tableaux
Kingo Kobayashi; Hiroyoshi Morita; Mamoru Hoshi
Proc. of Workshop on Concepts in Information Theory, 53-54, Oct. 2004
International conference proceedings, English

On Soft Decoding of Coded QAM using Integer Codes
Hiroyoshi Morita; A. J. Han Vinck; Hristo Kostadinov
Proc. of 2004 International Symposium on Information Theory and its Applications, 1321-1325, Oct. 2004, Peer-reviwed
International conference proceedings, English

Multicast communication for scalable video application using IP option
I. G. B; Baskara Nugraha; Sumiya Marugami; Mikihiko Nishiara; Hiroyoshi Morita
Proc. of International Symposium on Communications and Information Technologies 2004, 13-18, Oct. 2004, Peer-reviwed
International conference proceedings, English

反辞書を用いた心電図の１パス無ひずみ圧縮
太田 隆博; 森田 啓義
電子通信学会論文誌(A), J87-A, 9, 1187-1195, Sep. 2004, Peer-reviwed
Scientific journal, Japanese

Derivation on Bit Error Probability of Coded QAM using Integer Codes
Hristo Kostadinov; Hiroyoshi Morita; Nikolai Manev
Proc. of 2004 IEEE International Symposium on Inform. Theory, 540, Jun. 2004, Peer-reviwed
International conference proceedings, English

On-line ECG Lossless Comrepssion Using Antidicitionaries
Hiroyoshi Morita; Takahiro Ohta
Proc. of General Theory of Information Transfer and Combinatorics, 53-54, Apr. 2004
International conference proceedings, English

Some Considerations on Trapdoor Channel
K. Kobayashi; H. Morita; M. Hoshi
Proc. of 3rd Asian-European Workshop on Information Theory, 9-10, Jun. 2003
International conference proceedings, English

One Bit Reduction of Arithmetic Codes
H. Morita; M. Hoshi; K. Kobayashi
Proc. of 3rd Asian-European Workshop on Information Theory, 34-36, Jun. 2003
International conference proceedings, English

On Integer Codes Capable of Correcting Single Errors in Two-Dimensional Lattices
H. Morita; A. Geyser; A. J; van Wijngaarden
Proc. of 2003 IEEE International Symposium on Information Theory, 16.1, Jun. 2003, Peer-reviwed
International conference proceedings, English

A Tree Source and its Entropy
K. Kobayashi; H. Morita; M. Hoshi
Proc. of 2003 IEEE International Symposium on Information Theory, 28, Jun. 2003, Peer-reviwed
International conference proceedings, English

On Coded Modulation Based on Finite Rings of Integers
H. Kostadinov; H. Morita; N. Manev
Proc. of 2003 IEEE International Symposium on Information Theory, 156, Jun. 2003, Peer-reviwed
International conference proceedings, English

Integer Codes Correcting Single Errors of Specific Types $(\pm e_1, \pm e_2,\ldots,\pm e_s)$
H. Kostadinov; H. Morita; N. Manev
IEICE Trans. Fundamentals, E86-A, 7, 1843-1849, 2003, Peer-reviwed
Scientific journal, English

Percolation on k-ary Tree
K. Kobayashi; H. Morita; M. Hoshi
Abstracts of Opening Conference on General Theory of Information Transfer and Combinatorics, 28-29, Nov. 2002
International conference proceedings, English

An Input/Output Recursion of the Trapdoor Channel
Kingo Kobayashi; Hiroyoshi Morita
Proc. of 2002 IEEE International Symposium on Information Theory, 423, Jun. 2002, Peer-reviwed
International conference proceedings, English

A Reversible Distribution Converter with finite Precision Arithmetic
Hiroyoshi Morita; Mamoru Hoshi; Kingo Kobayashi
Proceedings of 2002 IEEE International Symposium on Information Theory, 404, Jun. 2002, Peer-reviwed
International conference proceedings, English

A Survey on Coding on Trees
Kingo Kobayashi; Hiroyoshi Morita; Mamoru Hoshi
Proceeding of the second Asian-European Workshop on Information Theory, 50-53, Jun. 2002
International conference proceedings, English

A New Aspect of DC-free Codes of Rate 1-1/n
Hiroyoshi Morita; Masahiko Sato
Proceeding of the second Asian-European Workshop on Information Theory, 71-74, Jun. 2002
International conference proceedings, English

Partial-prefix synchronizable codes
AJ van Wijngaarden; H Morita
IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 47, 5, 1839-1848, Jul. 2001, Peer-reviwed, A new class of codes for frame synchronization is proposed, Commonly, the beginning of every fixed or variable-length frame is identified by a given contiguous sequence called a prefix, To avoid the occurrence of the prefix elsewhere in the frame, a prefix synchronizable code (PS-code) is used. PS-codes have the property that the prefix does not occur in any codeword or in any concatenation of codewords in any position other than the first position. The new codes, termed partial-prefix synchronizable codes (PPS-codes), use a fixed sequence of symbols that is interspersed with symbols that carry information, The contiguous sequence from the first fixed symbol to the last fixed symbol is called a "partial-prefix." Consequently, not one but a set of possible prefixes is used, and none of these prefixes is allowed to occur at any other than the first position of a codeword, The cardinality of PPS-codes is determined, and coding algorithms are proposed which have a computational complexity proportional to the length of the codewords, It is demonstrated that in comparison with PS-codes, PPS-codes have similar coding and prefix detection complexity, but they have a larger code size and have better error control capabilities.
Scientific journal, English

Arithmetic Coding for countable Alphabet Sources with Finite Precision
M. Nishiara; Hiroyoshi Morita
IEICE Trans. Foundamentals, E84-A, 10, 2576-2582, 2001, Peer-reviwed
English

Coding of Ordered Trees
Kingo Kobayashi; Hiroyoshi Morita; Mamoru Hoshi
Proc. of 2000 IEEE International Symposium on Inform. Theory（ISIT2000）, 15, Jun. 2000, Peer-reviwed
International conference proceedings, English

Almost Surely Complete Parsing and Variable-to-Variable Length Coding
Mikihiko Nishiara; Hiroyoshi Morita
Proc. of 2000 IEEE International Symposium on Inform. Theory（ISIT2000）, 347, Jun. 2000
International conference proceedings, English

On Rate of Source Conversion by Concatenationg Code/Parse Trees
Hiroyoshi Morita; Kingo Kobayashi; Mamoru Hoshi
Proc. of 2000 IEEE International Symposium on Inform. Theory (ISIT2000), 456, Jun. 2000, Peer-reviwed
International conference proceedings, English

Evaluation for Convergence of Wavelet-Based Estimators on Fractional Brownian motion
Shuhji Kawasaki; Hiroyoshi Morita
2000 IEEE International Symposium on Information Theory, 470, Jun. 2000, Peer-reviwed
International conference proceedings, English

On the AEP of word-valued sources
Mikihiko Nishiara; Hiroyoshi Morita
IEEE Transactions on Information Theory, 46, 3, 1116-1120, 2000, Peer-reviwed, We consider a new class of information sources called word-valued sources in order to investigate coding algorithms based upon string parsing. A word-valued source is defined as a pair of an independent and identically distributed (i.i.d.) source with a countable alphabet and a function that maps each symbol into a finite sequence over a finite alphabet. A word-valued source is a nonstationary process and has countable states. If the function of a word-valued source is prefix-free, the entropy rate is characterized with a simple expression and the AEP (Asymptotic Equipartition Property) holds.
Scientific journal, English

Source Coding ino Constrained Sequences
Hiroyoshi Morita
Proc. of Memorial Workshop for the 50th Anniversary of the Shannon Theory, 31-32, Jan. 1999
International conference proceedings, English

Information Theoretic Aspects on Coding of Trees
K.Kobayashi; H.Morita; M.Hoshi
Proc. of Memorial Workshop for the 50th Anniversary of the Shannon Theory, 43-45, Jan. 1999
International conference proceedings, English

Codes over the ring of integer modulo m
A.J Han Vinck; H.Morita
IEICE Trans. Fundamentals, E81-A, 10, 2013-2018, Oct. 1998, Peer-reviwed
Scientific journal, English

Distribution Converter using Prefix Trees
H.Morita; K.Kobayashi; M.Hoshi
DIMACS Workshop on Codes and Trees:Algorithmic and Information Theoretic Approaces,Oct.5-7, 13, Oct. 1998
International conference proceedings, English

On Analysis of Acceptable Region of a Statistical Multiplexer Based on Fractional Brownian Traffic Models
S. H. Supangkat; S . Kawasaki; H. Morita
IEICE Trans. Fundametals, E81-A, 2, 295-303, Feb. 1998, Peer-reviwed
Scientific journal, English

Prefix Synchronized Codes Capable of Correcting Single Insertion/Deletion Errors
H. Morita; A. J; van Wijngaarden; A. J. Han Vinck
Proc. of 1997 IEEE International Symposium on Information Theory, 409, 1997, Peer-reviwed
International conference proceedings, English

Enumerative Coding for k-ary Trees
K. Kobayashi; H. Morita; M. Hoshi
Proc. of 1997 IEEE International Symposium on Information Theory, 423, 1997, Peer-reviwed
International conference proceedings, English

Extraction of Self-Similarity of Signals from Inter-Scale Relations of Wavelet Transform
S. Kawasaki; H. Morita
Proc. of International Workshop on Wavelets in Statics, 97-100, 1997, Peer-reviwed
International conference proceedings, English

On the construction of maximal prefix-synchronized codes
H Morita; AJ vanWijngaarden; AJH Vinck
IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 42, 6, 2158-2166, Nov. 1996, Peer-reviwed, We present a systematic procedure for mapping data sequences into codewords of a prefix-synchronized code (PS-code), as well as for performing the inverse mapping, A PS-code, proposed by Gilbert in 1960, belongs to a subclass of comma-free codes and is useful to recover word synchronization when errors have occurred in the stream of codewords, A PS-code is defined as a set of codewords with the property that each codeword has a known sequence as a prefix, followed by a coded data sequence in which this prefix is not allowed to occur, The largest PS-code among all PS-codes of the same code length is called a maximal prefix-synchronized code (MPS-code). We develop an encoding and decoding algorithm for Gilbert's MPS-code with a prefix of the form 11 ... 10 and extend the algorithm to the class PS-codes of which the prefix is self-uncorrelated, The computational complexity of the entire mapping process is proportional to the length of the codewords.
Scientific journal, English

Coding Algorithms for Extended Prefix-Synchronized Codes
H. Morita; A. J; van Wijngaarden
Proc. of 1996 International Symposium of Information Theory and Its Applications, 504-505, Sep. 1996, Peer-reviwed
International conference proceedings, English

On Coding Algorithms for Extended Prefix-Synchronized Codes
H. Morita; A. J; van Wijngaarden
Proc. of 5th Japan-Benelux Workshop on Coding and Informaion Theory, 16.1, 1996
International conference proceedings, English

On an Acceptable Region of Statistical Multiplexing Based on Fractional Brownian Traffic Models
S. H. Supangkat; H. Morita
Proc. of 1996 International Symposium of Information Theory and its Application, 567-570, 1996, Peer-reviwed
International conference proceedings, English

Extended Prefix Synchronization Codes
H. Morita; A. J; van Wijngaarden; A. J. Han Vinck
Proc. of 1995 IEEE International Symposium on Information Theory, 465, 1995, Peer-reviwed
International conference proceedings, English

Coding Algorithms for EPS Codes using Index Functions
H. Morita; A. J; van Wijngaarden
Proc. of 1995 International Symposium on Synchronization, 102-104, 1995
International conference proceedings, English

Maximal Prefix-Synchronized Codes by Means of Enumerative Coding
A. J; van Wijngaarden; H. Morita
Proc. of 1995 IEEE International Symposium on Information Theory, 466, 1995, Peer-reviwed
International conference proceedings, English

On the Construction of Maximal Prefix-Synchronized Codes
H. Morita; A. J; van Wijngaarden; A. J. Han Vinck
Proc. of the 4th Benelux-Japan Workshop on Coding and Information Theory, 1839-1848, 1994
International conference proceedings, English

Enumeration of Permutations Classifed by Length of Longest Monotone Subsequences
H. Morita; K. Kobayashi; M. Hoshi
Proc. of 1994 IEEE International Symposium on Information Theory, 318, 1994, Peer-reviwed
International conference proceedings, English

Edit Distance Coding of Permutation Sources
H. Morita; K. Kobayashi
Proc. of 1994 IEEE International Workshop on Information Theory, 71-73, 1994, Peer-reviwed
International conference proceedings, English

DATA-COMPRESSION OF ECG BASED ON THE EDIT DISTANCE ALGORITHMS
H MORITA; K KOBAYASHI
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, IEICE-INST ELECTRON INFO COMMUN ENG, E76D, 12, 1443-1453, Dec. 1993, Peer-reviwed, A method for the compression of ECG data is presented. The method is based on the edit distance algorithm developed in the file comparison problems. The edit distance between two sequences of symbols is defined as the number of edit operations required to transform a sequence of symbols into the other. We adopt the edit distance algorithm to obtain a list of edit operations, called edit script, which transforms a reference pulse into a pulse selected from ECG data. If the decoder knows the same reference, it can reproduce the original pulse, only from the edit script. The amount of the edit script is expected to be smaller than that of the original pulse when the two pulses look alike and thereby we can reduce the amount of space to store the data. Applying the proposed scheme to the raw data of ECG, we have achieved a high compression about 14 : 1 without losing the significant features of signals.
Scientific journal, English

ON ASYMPTOTIC OPTIMALITY OF A SLIDING WINDOW VARIATION OF LEMPEL-ZIV CODES
H MORITA; K KOBAYASHI
IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 39, 6, 1840-1846, Nov. 1993, Peer-reviwed, Ziv and Lempel proposed two important universal coding algorithms in 1977 and 1978. While the second algorithm, called LZ78, has been sufficiently analyzed in the literature, the first, LZ77, has not yet. LZ77 parses input data into a sequence of phrases, each of which is the longest match in a fixed-sized sliding window which consists of the previously encoded M symbols. Each phrase is replaced by a pointer to denote the longest match in the window. Then, a window slides to just before the next symbol to be encoded, and so on. In this paper, we modify the algorithm of LZ77 to restrict pointers to starting only at the boundary of a previously parsed phrase in a window. Although the number of parsed phrases should increase more than those in LZ77, the amount of bits needed to encode pointers is considerably reduced since the number of possible positions to be encoded is much smaller. Then, we show that for any stationary finite state source, the modified LZ77 code is asymptotically optimal with the convergence rate O(log log M / log M) where M is the size of a sliding window.
Scientific journal, English

A Partition of the Set of Permuations by the Monotone Subsequence Structure
K. Kobayashi; H. Morita
Proc. of 1993 IEEE International Symposium on Information Theory, 406, 1993, Peer-reviwed
International conference proceedings, English

On Asymptotic Optimality of a Sliding Window Variation of Lempel-Ziv Codes
H. Morita; K. Kobayashi
Proc. of 1993 IEEE International Symposium on Information Theory, 113, 1993, Peer-reviwed
International conference proceedings, English

Some Aspects on theHidden Markov Source
K. Kobayashi; H. Itoh; H. Morita
Proce. of 1993 IEEE Information Theory Workshop, 20-21, 1993, Peer-reviwed
International conference proceedings, English

Edit Distance Coding of Information Sources
H. Morita; K. Kobayashi
Proc. of the Sixth Joint Swedish-Russian International Workshop on Information Theory, 245-249, 1993, Peer-reviwed
International conference proceedings, English

Low Rate Image Compression Based on Surface Interpolation
H. Morita; T. Ota
Proc. of the 3d Benelux-Japan Workshop on Coding and Information Theory, 8-9, 1993
International conference proceedings, English

Edit Distance Coding of ECG
H. Morita; K. Kobayashi
Proc. of the 2nd International Winter Meeting on Coding and Information Theory, 41, 1993
International conference proceedings, English

Data compression of computer files based on restricted reproducible parsing algorithms
森田啓義; 小林欣吾
Trans. on Information Processing Society of Japan, Information Processing Society of Japan (IPSJ), 33, 2, 110-121, 1992, Peer-reviwed, 高い圧縮効果と高速性を合わせ持ったデータ圧縮符号として 最近Fiala-Greene符号(FG符号)が注目されているFG符号はZiv-Lempel符号の一変形であり すでに符号化ずみの長さMの過去の文字列の中から 次の入力文字列とできるだけ長く一致する部分(参照文字列)を見つけ出すことによって入力文字列を部分文字列(単語と呼ぶ)の列に分解し つぎに各単語に対応する参照文字列の存在する位置とその長さを適当な符号で符号化する方式である本論文では FG符号において用いられている文字列分解法を LempelとZivによって与えられた文字列の再生可能性を一般化した制約つき再生可能性にもとづくものとして位置づけることにより 統計的な性質が未知なデータに対して そのデータから推定される確率モデルのエントロピに平均圧縮率が収束するという意味で FG符号(厳密にはFG符号を簡略化したもの)が有限次数の定常マルコフ情報源のクラスに対してO(loglogM/logM)のオーダで漸近最良であることを導くさらに FG符号の実用化をより高めるために 参照文字列の位置の符号化に関して改良を加え その符号器・復号器のプログラムを実際に組み いくつかの計算機ファイルに対して圧縮実験を行った結果 従来の圧縮プログラムに比べて5?20%高い圧縮効果がえられたことを報告する
Scientific journal, Japanese

On Asymptotic Optimality of a Variation of the Ziv-Lempel Code with Finite Window
H. Morita; K. Kobayashi
Proc. of the second Japan-Benelux Workshop on Information and Communication Theory, 406, 1992
International conference proceedings, English

On Adaptive Data Compression Based on Reproducible Parsing Algorithm
H. Morita; K. Kobayashi
Proc. of 1991 IEEE International Symposium on Information Theory, 232, 1991, Peer-reviwed
International conference proceedings, English

多値M配列パターン投影法による複数物体の計測
森田啓義; 古賀勝敏; 阪田省二郎
情報処理学会論文誌, 31, 5, 683--691, May 1990, Peer-reviwed
Scientific journal, Japanese

An Adaptive Noiseless Source Coding by Means of Reproducible Parsing Algorithm
H. Morita; K. Kobayashi
Proc. of 1990 International Symposium on Information Theory and its Applications, 491-494, 1990, Peer-reviwed
International conference proceedings, English

An Extension of LZW Coding Algorithm to Source Coding Subject to a Fidelity Criterion
H. Morita; K. Kobayashi
Proc. of the Fourth Joint SWedish-USSR International Workshop on Information Theory, 105-109, 1989, Peer-reviwed
International conference proceedings, English

On Variable Length Quantization Codes
T. S. Han; H. Morita
Proc. of the first joint Benelux-Japan Workshop on Information and Communication Theory, 14, 1989
International conference proceedings, English

ドット誤り訂正能力をもつ符号化パターン投影法による物体形状の計測
森田啓義; 矢島一泰; 阪田省二郎; 中村浩章
情報処理学会論文誌, Information Processing Society of Japan (IPSJ), 29, 3, 233-241, Mar. 1988, Peer-reviwed, 符号化パターン投影法は 物体の三次元形状を物体に非接触な条件下で計測する方法で ある符号化されたパターンを物体に批影し 投影パターンの歪を計測することによって物体表面の三次元座標を算出するものである.本輸文では 符号化パターンとしてM平面ドットパターンを用いることにより パターンの歪を計測する際に問題となる投影パターンと元のパターンとの一義的な対応づけを容易に行う技法を提案する.さらに 投影ドットの一部が受像されない場合やその順序が反転した場合には 符号理論における誤り訂正の考え方を導入することによって ドットの正確な対応づけを復元するアルゴリズムを提案し その誤り訂正能力を明らかにする.最後に 本方式を用いた物体形状計測システムを試作し 複数物体の測定実験を行った結果を報告する.
Scientific journal, Japanese

Data Compaction of Linearly Dependent Processes by Means of Arithmetic Codes
K. Kobayashi; H. Morita
Proc. of 1988 IEEE International Symposium on Information Theory, 154-155, 1988, Peer-reviwed
International conference proceedings, English

Some Considerations on Linearly Deendent Processes
K. Kobayashi; H. Morita
Proc. of the Second Joint Colloqium on Coding Theory between Academy of Sciences of Armenian SSR and Osaka University, 1-23, 1988
International conference proceedings, English

Reconstruction of Surfaces of 3-D Objects by M-array Pattern Projection Method
H. Morita; K. Yajima; S. Sakata
Proc. of the Second International Conference on Computer Vision, 468-473, 1988, Peer-reviwed
International conference proceedings, English

テンソル積曲面の交線算出アルゴリズム
渡辺裕文; 中野貫二; 森田啓義; 阪田省二郎
情報処理学会論文誌, Information Processing Society of Japan (IPSJ), 28, 10, 1099-1102, Oct. 1987, Peer-reviwed, フィリップスらの陰関数表現された曲面の交線を微分方程式の解として表す方法をテンソル積曲面に拡張して テンソル積曲面パッチの組で与えられた2つの曲面モデルの交線を数値的に算出するアルゴリズムを提案する.この方法では いったん交差パッチ対が求まれば初期点によらず交線上の1点が直ちに求められる.さらに交線から離れることなく交線上の相続く点を次々求めることができ しかも複数のパッチ対にわたり連続的に交線を求めることができる.なお この方法の簡単な適用例によってその有効性を確かめた.
Scientific journal, Japanese

Adaptive Data-Compression of Digitized Gray-Level Images by Means of Arithmetic Coding
S. Arimoto; H. Morita; S. Kitada
Proc. of the First Joint Colloqium on Coding Theory between Academy of Sciences of Armenian SSR and Osaka University, 8-30, 1986
International conference proceedings, English

ディジタル濃淡画像の動的適応符号化法
北田茂; 森田啓義; 有本卓
電子情報通信学会論文誌, J68-D, 4, 639-646, 1985
Scientific journal, Japanese

On efficiency of binary arithmetic codes
森田啓義; 藤元克己; 北田茂; 有本卓
Trans. on Information Processing Society of Japan, Information Processing Society of Japan (IPSJ), 25, 4, 622-631, 1984, Peer-reviwed, 画像の符号化やデータ伝送など多くの応用に適したデータ圧縮符号として算術符号がよく知られている.算術符号の性能は 符号化・復号化アルゴリズムに行われる算術演算の精度とシンボルの生起確率の近似法に大きく依存している.本論文では 二値算術符号の性能を測る測度として符号の効率(平均符号長に対するエントロピの比)を定義し 任意の演算精度と確率の近似法のもとで効率の評価式(上界および下界)を導いた.これらの評価式を用いた数値例から 高いデータ圧縮効果を保持したまま符号化処理時間を短縮できるような演算精度の設定および確率の近似法について詳しく検討した.
Scientific journal, Japanese

Programming a Robot through Image Analysis of Line Drawings
J. Meyer; J. Mandeville; H. Morita
Proc. of Robots West Conference (Robotics International of SME), -, 1984, Peer-reviwed
International conference proceedings, English

SECT - A CODING TECHNIQUE FOR BLACK-WHITE GRAPHICS
H MORITA; S ARIMOTO
IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 29, 4, 559-570, 1983, Peer-reviwed
Scientific journal, English

Selective element coding technique and image processing by using selective elements
森田 啓義; 有本 卓
Trans. on Information Processing Society of Japan, Information Processing Society of Japan (IPSJ), 23, 5, 674-682, 1983, Peer-reviwed, ディジタル2値画像の一表現方法として 画像から抽出された特徴点による表現について論じた.この特徴点は 2値画像を図形としてながめたときの"角"に密接に関係して定義され 選択画素と呼ばれる.一般に2値画像はそれ自身に含まれるすべての角により一意的に表現されるが 選択画素による画像表現は角による表現より簡潔であることが示される.そこで選択画素による画像表現を2値画像の符号化に適用し 符号化効率を実際の画像データ(漢字パターン)に対して調べた.その結果 画像の統計的性質に依存しない簡単な符号構成をもつ提案方式によって 統計的な手法を用いる従来のものと同等あるいはそれ以上のデータ圧縮効果が得られることが明らかになった.ところでこの選択画素による画像表現には元の画像のもつ位相的な性質に関する情報が含まれている.そこで選択画素の`情報のみから2値画像に含まれる連結成分およびホールの同時検出アルゴリズムを導いた.このアルゴリズムは1パス走査による連結成分およびホールの検出を実現している.
Scientific journal, Japanese

情報理論講義
小林欣吾; 森田啓義
Japanese, Joint work, 培風館, Jul. 2008

電子情報通信用語辞典（執筆委員）
森田啓義
Japanese, Editor, コロナ社, 1999

電子情報通信ハンドブック(情報理論の分担)
森田 啓義; 佐藤創
Japanese, Joint work, オーム社, 1998

情報源符号化-無歪みﾃﾞ-ﾀ-圧縮(算術符号の章分担)-
森田 啓義
Japanese, Joint work, 培風館, 1998

情報のディジタル伝送（共訳）
有本卓; 伊藤秀一; 古賀弘樹; 小林欣吾; 森田啓義
Japanese, Joint work, 森北出版, 1997

多値アルファベットに対するユニバーサルな2パス反辞書符号化法
太田隆博; 森田啓義
Oral presentation, Japanese, 第36回情報理論とその応用シンポジウム予稿集, Domestic conference
26 Nov. 2013

DLグラフにおけるノードの入次数の評価
金子周平; 森田啓義; 眞田亜紀子
Oral presentation, Japanese, 第36回情報理論とその応用シンポジウム予稿集, Domestic conference
26 Nov. 2013

部分列数数え上げ符号化法を用いた反辞書符号化法について
太田隆博; 森田啓義
Oral presentation, Japanese, 情報理論とその応用シンポジウム予稿集,情報理論とその応用シンポジウム
Dec. 2012

On the Irreducibility of Certain Shifts of Finite Type
小林哲也; 眞田亜紀子; 太田隆博; 森田啓義
Oral presentation, English, 第35回情報理論とその応用シンポジウム予稿集, Domestic conference
Dec. 2012

Linking Trajectories of a Moving Object on Multiple Cameras with Different Angles and Locations
I Gusti Bagus; Baskara Nugraha; Noda Shinpei; Morita Hiroyoshi
Oral presentation, English, IPSJ and IEICE
Sep. 2011

接尾辞配列による反辞書構築法
深江裕忠; 太田隆博; 森田啓義
Oral presentation, Japanese, 情報理論とその応用学会（SITA）,第３３回情報理論とその応用シンポジウム予稿集
Nov. 2010

高速な動的反辞書構築手法
太田隆博; 深江裕忠; 森田啓義
Oral presentation, Japanese, 情報理論とその応用学会,第３３回情報理論とその応用シンポジウム予稿集
Nov. 2010

整数ロジスティック写像と撹拌演算による乱数生成
董際国; 森田啓義
Oral presentation, Japanese, 電子情報通信学会,信学技報
Oct. 2010

エリア隣接性を考慮したＰ２Ｐルーティング方式の提案
小林久美子; イグスティ・バスカラ・ヌグラハ; 森田啓義
Oral presentation, Japanese, 電子情報通信学会,信学技報
Oct. 2010

テロップを用いたニュース映像のトピック分割
関口明紀; 森田啓義; I Gusti Bagus; Baskara Nugraha
Oral presentation, Japanese, 電子情報通信学会・情報処理学会,FIT2010（第９回情報科学技術フォーラム）
Sep. 2010

Real-Time Moving Object Tracking in H.264/AVC Video based on Motion Compensation Block Size and Forward Motion Vector Information
Suwen Weng; Luis Loyola; I G.B; Baskara Nugraha; Hiroyoshi Morita
Oral presentation, English, FIT2010
Sep. 2010

Event scene detection from MPEG2 soccer video using slope angle in ground borderline
Takahiro Segami; Hiroyoshi Morita; I G.B; Baskara Nugraha
Oral presentation, Japanese, 電子情報通信学会,2010年電子情報通信学会総合大会
Mar. 2010

配列構造を用いた反辞書符号化法
鈴木圭太; 深江裕忠; 太田隆博; 森田啓義
Oral presentation, Japanese, 電子情報通信学会技術研究報告,情報通信基礎サブソサイエティ合同研究会
Mar. 2010

Evaluation of Mutual Anonymity in P2P Networks
Chigusa Kawashima; Todorka Alexandrova; I Gusti Bagus; Baskara Nugraha; Hiroyoshi Morita
Oral presentation, English, 電子情報通信学会技術研究報告,情報通信基礎サブソサイエティ合同研究会
Mar. 2010

An anonymous P2P file sharing protocol
川島千種; Todorka Alexandrova; Baskara Nugraha; 森田啓義
Public symposium, English, 第32回情報理論とその応用シンポジウム, 情報理論とその応用学会, 山口
Dec. 2009

反辞書符号化法の漸近的最良性
太田隆博; 森田啓義
Public symposium, Japanese, 第32回情報理論とその応用シンポジウム, 情報理論とその応用学会, 山口
Dec. 2009

同期誤り耐性算術符号の性能評価
森田啓義
Public symposium, Japanese, 情報とダイナミクスIII研究集会, 科学研究費補助金 基盤研究(B) 「力学系理論による符号設計とそのディジタル通信への応用」, 福岡
Oct. 2009

On the On-line ECG Lossless Data Compression Using Antidictionary for a Finite Alphabet
太田隆博; 森田啓義
Oral presentation, Japanese, 信学技報
Sep. 2009

Proposal of Distributed Management System for Location-related Information
小林久美子; イ・グスティ・バグス・バスカラ・ヌグハラ; 森田啓義
Oral presentation, Japanese, 信学技報
Jun. 2009

エントロピーレートを達成する実際的な情報源符号化について ー算術符号の確率モデルに関する最近の話題を中心にー
森田啓義
Invited oral presentation, Japanese, 若手研究者のための講演会, 電子情報通信学会
Oct. 2008

整数符号を用いた符号化変調のBERの評価について
Hristo Kostadinov; 飯島 昇; 森田啓義; Nikolai Manev
Public symposium, Japanese, 第３１回情報理論とその応用シンポジウム, 情報理論とその応用学会
Oct. 2008

定常エルゴード情報源に対する極小禁止語の長さ
太田隆博; 森田啓義
Public symposium, Japanese, 第３１回情報理論とその応用シンポジウム, 情報理論とその応用学会
Oct. 2008

Mutually Anonymous Communication Using Secret Sharing Schemes
Todorka Alexandrova; Chigusa Kawashima; Nugraha Baskara; Hiroyoshi Morita
Public symposium, English, 第３１回情報理論とその応用シンポジウム, 情報理論とその応用学会
Oct. 2008

Sliding Window Variations of Antidictioary Data Compression
Takahiro OTA; Hiroyoshi MORITA
Oral presentation, Japanese, IEICE Technical Report
Feb. 2008

Suffix arrayを利用した動的な反辞書生成
深江裕忠; 森田啓義
Public symposium, Japanese, 第３０回情報理論とその応用シンポジウム, 情報理論とその応用学会, 賢島
Nov. 2007

反辞書による適応型データ圧縮法のモデリング
太田隆博; 森田啓義
Public symposium, Japanese, 第３０回情報理論とその応用シンポジウム, 情報理論とその応用学会, 賢島
Nov. 2007

Transcoding-after-Smoothing (TaS) Method for VBR Video Bit-rate Adaptation
I Gusti Bagus; Baskara Nugraha; Hiroyuki Kasai; Hiroyoshi Morita
Public symposium, English, 第３０回情報理論とその応用シンポジウム, 情報理論とその応用学会, 賢島
Nov. 2007

An Extension of (t,n) Threshold Secret Sharing Schemes Based on the Generalized Vector Space Construction
Todorka ALEXANDROVA; Hiroyoshi MORITA
Public symposium, English, 第３０回情報理論とその応用シンポジウム, 情報理論とその応用学会, 賢島
Nov. 2007

反辞書木を用いた分岐予測手法
西新幹彦; 森田啓義; 太田隆博
Oral presentation, Japanese, 信学技報,合同研究会
Oct. 2007

Construction of q-ary (2,n) Threshold Secret Sharing Systems
Todorka Alexandrova; Hiroyoshi Morita
Public symposium, English, 情報理論とその応用シンポジウム, 情報理論とその応用学会
Nov. 2006

反辞書に基づく動的算術符号化
太田隆博; 森田啓義
Public symposium, Japanese, 情報理論とその応用シンポジウム, 情報理論とその応用学会
Nov. 2006

Suffix treeを用いたデータ圧縮の検討
深江裕忠; 森田啓義
Public symposium, Japanese, 第２９回情報理論とその応用シンポジウム, 情報理論とその応用学会
Nov. 2006

On Construction of Reversible Variable-Length Codes Including Resynchronization Makers as Codewords
Dongzhao Sun; Hiroyoshi Morita; Mikihiko Nishiara
Public symposium, English, 第２９回情報理論とその応用シンポジウム, 情報理論とその応用学会
Nov. 2006

動的ＢＷ変換アルゴリズムの提案
深江裕忠; 松嶋智子; 森田啓義
Public symposium, Japanese, 第２８回情報理論とその応用シンポジウム, 情報理論とその応用学会
Nov. 2005

Perfect (2,n) Threshold Secret Sharing Systems Based on Matrices with Constant Column Weight
Todorka Alexandrova; Hiroyoshi Morita
Public symposium, English, 第２８回情報理論とその応用シンポジウム, 情報理論とその応用学会
Nov. 2005

Linear Complexity Construction of Antidicitionaries
Takahiro Ota; Hiroyoshi Morita
Public symposium, English, 情報理論とその応用シンポジウム, 情報理論とその応用学会
Nov. 2005

A Protoytpe of Internet Video Broadcasting using Unicast Protocol
I Gusti Bagus; Baskara Nugraha; Mikihiko Nishiara; Hiroyoshi Morita
Oral presentation, English, IEICE Technical Report, NS2005-55
Jun. 2005

文脈重み木を利用した拡張反辞書の生成法について
太田隆博; 森田啓義
Public symposium, Japanese, 第２７回情報理論とその応用シンポジウム予稿集, 情報理論とその応用学会
Dec. 2004

On multiple smoothed transmission of MPEG4 video stream
Dongzhao Sun; Hiroyoshi Morita; Mikihiko Nishiara
Public symposium, English, 第２７回情報理論とその応用シンポジウム, 情報理論とその応用学会
Dec. 2004

On-line ECG Lossless Comrepssion Using Antidicitionaries
Hiroyoshi Morita; Takahiro Ohta
Invited oral presentation, English, Proc. of General Theory of Information Transfer and Combinatorics, Bielefeld, International conference
Apr. 2004

MPEG4動画像の多重平滑化伝送について
孫 東照; 森田 啓義
Oral presentation, Japanese, 信学技報, 調布
Mar. 2004

BEP of Coded QAM using Single Error Correctable Integer Codes
Hristo Kostadinov; Hiroyoshi Morita; Nikolai Manev
Oral presentation, English, IEICE
Mar. 2004

On Optimal Scale Upper Bound in Wavelet-Based Hurst Index Estimation of Fractional Brownian Motion
Shuji Kawasaki; Hiroyoshi Morita
Oral presentation, English, Technical Report of IEICE
Jan. 2003

DCA Lossless Compression and Detecting Arrhythmia of ECG
太田隆博; 森田啓義
Oral presentation, Japanese
Dec. 2002

A Survey on Coding on Trees
Kingo Kobayashi; Hiroyoshi Morita; Mamoru Hoshi
Invited oral presentation, English, Proceeding of the second Asian-European Workshop on Information Theory, International conference
Jun. 2002

Integer Coded Modulations over AWGN Channels
Hristo Kostadinov; Hiroyoshi Morita; Nikolai Manev
Oral presentation, English, Technical Report of IEICE, ITS2001-119
Mar. 2002

Reversible Distribution Converter with Finite Precision Arithmetic
Hiroyoshi Morita; Mamoru Hoshi; Kingo Kobayashi
Oral presentation, English, Proc. of the 24th Symposium on Information Theory and Its Applications
Dec. 2001

An Input-output Relation of the Trapdoor Channel
Kingo Kobayashi; Hiroyoshi Morita
Oral presentation, English, Proc. of the 24th Symposium on Information Theory and Its Applications
Dec. 2001

符号化レート (n-1)/n をもつ dc-free 符号の新しい構成法
佐藤正彦; 森田啓義
Oral presentation, Japanese, 第24回情報理論とその応用シンポジウム予稿集
Dec. 2001

The Bernoulli Splitting Process with Biased Probabilities
Kingo Kobayashi; Mamoru Hoshi; Hiroyoshi Morita
Oral presentation, English, Proc. of 23rd Symp. on Inform. Theory and its App.
2000

On rate of source conversion by coding/parsing trees
H. Morita; K. Kobayashi; M. Hoshi
Oral presentation, English, 第22回情報理論とその応用学会予稿集,湯沢
Dec. 1999

Evaluation for Convergence of Wavelet-Based Estimators on Factional Brownian Motion
S. Kawasaki; H. Morita
Oral presentation, English, 第22回情報理論とその応用学会予稿集,湯沢
Dec. 1999

Performance of Integer Coded Modulation over Rayleigh Fading Channels
A. Geyser; H. Morita
Oral presentation, English, The 22nd Symposium on Information Theory and Its Applications
Dec. 1999

Source Coding ino Constrained Sequences
Hiroyoshi Morita
Invited oral presentation, English, International conference
Jan. 1999

Information Theoretic Aspects on Coding of Trees
K.Kobayashi; H.Morita; M.Hoshi
Invited oral presentation, English, Isawa, Yamanashi, International conference
Jan. 1999

可算アルファベット情報源の算術符号化に関する考察
西新幹彦; 森田啓義
Oral presentation, Japanese, 第21回情報理論とその応用シンポジウム (SITA98), 岐阜
Dec. 1998

Distribution Converter using Prefix Trees
H.Morita; K.Kobayashi; M.Hoshi
Invited oral presentation, English, DIMACS Workshop on Codes and Trees:Algorithmic and Information Theoretic Approaces,Oct.5-7, International conference
Oct. 1998

制約のある系列への符号化とその応用
森田 啓義
Oral presentation, Japanese, 電気関係学会東海支部連合大会シンポジウム，三重大
Sep. 1998

制約のある系列への符号化とその応用
森田 啓義
Oral presentation, Japanese, 電気関係学会東海支部連合大会シンポジウム，三重大, 電気関係学会東海支部連合大会シンポジウム，三重大
Sep. 1998

On-line Estimation of Hurst Parameters of Fractional Brownian Motions by Wavelet Transform
Shuhji Kawasaki; Hiroyoshi Morita
Oral presentation, English, 第21回情報理論とその応用シンポジウム予稿集,岐阜
1998

言語アルファベット情報源の漸近等分割性について
西新幹彦; 森田啓義
Oral presentation, Japanese, 第20回情報理論とその応用シンポジウム (SITA97), 松山
Dec. 1997

Extraction of Self-Similarity of Signals from Inter-Scale Relations of Wavelet Transform
Shuji Kawasaki; Hiroyoshi Morita
Oral presentation, English, 情報理論とその応用学会,第２０回情報理論とその応用シンポジウム
Dec. 1997

Algorithms and Data Structures and Programming Exercises
The University of Electro-Communications

アルゴリズムとデータ構造およびプログラミング演習
電気通信大学

Probability and Statistics
The University of Electro-Communications

確率統計
電気通信大学

Advanced Theory on Information Data Analysis
The University of Electro-Communications

情報データ解析論
電気通信大学

応用ネットワーキング論１
The University of Electro-Communications

Application Networking I
The University of Electro-Communications

応用ネットワーキング論１
電気通信大学

映像情報メディア学会

情報処理学会

ACM

電子情報通信学会

IEEE

The Society of Information Theory and Its Applications

Theory and Implementation of ECG Anomaly Detection using Antidictionary Probabilistic Models
森田啓義
Principal investigator
01 Apr. 2017 - 31 Mar. 2020

2次元パターン反辞書法に基づく高解像度MPEG圧縮映像に適したシーン検出
森田啓義
Principal investigator
2012 - 2014

概周期性を持つデジタルデータに対する異常信号検出システムの初期設定の自動化方法および装置
Patent right, 太田 隆博, 森田 啓義, 特願2011-182227, Date applied: 24 Aug. 2011, 電気通信大学, 長野県, 特開2013-042904, Date announced: 04 Mar. 2013, 特許第5803006号, Date issued: 11 Sep. 2015

移動体表示システムおよび移動体表示プログラム
Patent right, 森田啓義, 伊藤勝造, 村田正和, 川口俊明, 特願2013-216551, Date applied: 17 Oct. 2013, 株式会社熊平製作所，国立大学法人電気通信大学, 特開2015-080107, Date announced: 23 Apr. 2015

輪郭抽出システム、輪郭抽出装置及び輪郭抽出プログラム
Patent right, 特願2011-202932, Date applied: 16 Sep. 2011, アイベックステクノロジー株式会社，国立大学法人電気通信大学, 特許第5567413号, Date issued: 17 Jul. 2014

Cut Detection System, Shot Detection System, Scene Detection System and Cut Detection Method
Patent right, Hiroyoshi Morita, Atsunori Sakai, Yasuo Masaki, Hirono Tsubota, 12/073,703, Date applied: 07 Mar. 2008, Funai Electric Co., Ltd., The University of Electro-Communications, 米国特許8,761,260B2号, Date issued: 24 Jun. 2014

動きオブジェクト検出装置、動きオブジェクト検出方法、及びプログラム
Patent right, 森田 啓義, 翁 素文, ロヨラ,ルイス, 特願2010-184345, Date applied: 19 Aug. 2010, スキルアップジャパン株式会社，国立大学法人電気通信大学, 特許第5334328号, Date issued: 09 Aug. 2013

カット部検出システム及びショット検出システム並びにシーン検出システム、カット部検出方法
Patent right, 森田 啓義, 坂井 敦典, 政木 康生, 坪田 浩乃, 特願2007-206777, Date applied: 08 Aug. 2007, 電気通信大学, 船井電機株式会社, 特許第5181325号, Date issued: 25 Jan. 2013

MPEG2動き補償MBサイズ情報を用いた移動物体領域の表示・出力装置
Patent right, 森田 啓義, バスカラ・ヌグラハ, 宮内 榮三, 山本 健, 特願2010-147839, Date applied: 29 Jun. 2010, 特開2012-015616, Date announced: 19 Jan. 2012

カット点検出システムおよび該カット点検出システムを用いたショット識別シス テム、カット点検出方法、並びにカット点検出プログラム
Patent right, 森田 啓義, 井上 文宏, 政木 康生, 坪田 浩乃, 特願2006-211746, Date applied: 03 Aug. 2006, 船井電機株式会社，国立大学法人電気通信大学, 特許第4719889, Date issued: 15 Apr. 2011