http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Computational Time Reduction of Fractal Image Coding by Using Low Density Parity Check Code
Masaya Ohta,Yuma Masui,Katsumi Yamashita 대한전자공학회 2009 ITC-CSCC :International Technical Conference on Ci Vol.2009 No.7
In this report, the fractal image coding is improved. The computational time for encoding is reduced by using LDPC (low density parity check) code which is one of error correcting techniques and needs few computational time. From some numerical experiments to evaluate its performance, the proposed method achieves to reduce computational time compared with conventional fractal image coding.
Photo-based Desktop Virtual Reality System Implemented on a Web-browser
Ohta, Masaya,Otani, Hiroki,Yamashita, Katsumi The Institute of Electronics and Information Engin 2014 IEIE Transactions on Smart Processing & Computing Vol.3 No.2
This paper proposes a novel desktop virtual reality system. Based on the position of the user's face, the proposed system selects the most appropriate image of an object from a set of photographs taken at various angles, and simply "pastes" it onto the display at the appropriate location and scale. Using this system, the users can intuitively feel the presence of the object.
Hikaru Kawasaki,Takahiro Matsui,Masaya Ohta,Katsumi Yamashita 대한전자공학회 2017 IEIE Transactions on Smart Processing & Computing Vol.6 No.2
N-continuous orthogonal frequency division multiplexing (OFDM) is a precoding method for sidelobe suppression of OFDM signals and seamlessly connects OFDM symbols up to the highorder derivative for sidelobe suppression, which is suitable for suppressing out-of-band radiation. However, it severely degrades the error rate as it increases the continuous derivative order. Two schemes for orthogonal precoding of N-continuous OFDM have been proposed to achieve an ideal error rate while maintaining sidelobe suppression performance; however, the large size of the precoder matrices in both schemes causes very high computational complexity for precoding and decoding. This paper proposes matrix decomposition of precoder matrices with a large size in the orthogonal precoding schemes in order to reduce computational complexity. Numerical experiments show that the proposed method can drastically reduce computational complexity without any performance degradation.