• Korean Journal of Remote Sensing
• /
• v.30 no.1
• /
• pp.137-147
• /
• 2014

We proposed and verified the methods to maintain data qualities as well as to reduce data volume for the Geostationary Ocean Color Imager (GOCI), the world's first ocean color sensor operated in geostationary orbit. For the GOCI level-2 data, 92.9% of data volume could be saved by only the data compression. For the GOCI level-1 data, however, just 20.7% of data volume could be saved by the data compression therefore another approach was required. First, we found the optimized number of bits per a pixel for the GOCI level-1 data from an idea that the quantization bit for the GOCI (i.e. 12 bit) was less than the number of bits per a pixel for the GOCI level-1 data (i.e. 32 bit). Experiments were conducted using the $R^2$ and the Modulation Transfer Function (MTF). It was quantitatively revealed that the data qualities were maintained although the number of bits per a pixel was reduced to 14. Also, we performed network simulations using the Network Simulator 2 (Ns2). The result showed that 57.7% of the end-toend delay for a GOCI level-1 data was saved when the number of bits per a pixel was reduced to 14 and 92.5% of the end-to-end delay for a GOCI level-2 data was saved when 92.9% of the data size was reduced due to the compression.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.947-950
• /
• 2001

This paper implements H.263 codec using SIMD(single instruction multiple data) method in real time based on PC. This system uses INS algorithm previously proposed by the authors as motion estimation module. SIMD method is used in DCT, IDCT, quantization, motion estimation, and display module. The developed algorithms are implemented using TMN5. Using the above algorithm, H.263 Codec can communicate more than 15 frames/sec in CIF resolution on a Pentium-IV 1.7GHz computer.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.173-174
• /
• 2007

• ETRI Journal
• /
• v.4 no.3
• /
• pp.18-29
• /
• 1982

In a block adaptive filtering procedure, the filter coefficients are adjusted once per each output block while maintaining performance comparable to that of widely used LMS adaptive filtering in which the filter coefficients are adjusted once per each output data sample. An efficient implementation of block adaptive filter is possible by means of discrete transform technique which has cyclic convolution property and fast algorithms. In this paper, the block adaptive filtering using Fermat Number Transform (FNT) is investigated to exploit the computational efficiency and less quantization effect on the performance compared with finite precision FFT realization. And this has been verified by computer simulation for several applications including adaptive channel equalizer and system identification.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.05a
• /
• pp.592-593
• /
• 2018

사물 인터넷 환경에서 제어 시스템이 네트워크에 연결되면서 정밀 제어를 위한 양자화에 대한 고려가 중요해 지고 있다. 본 연구에서는 프로세스 잡음이 존재하는 이산 시불변 선형 시스템에서 실용적 관찰성을 달성하기 위해서 필요로 하는 데이터 양에 대한 조건을 제시한다.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2005.07b
• /
• pp.863-864
• /
• 2005

In recent years, we use overdriving scheme to improve the response time of the liquid crystal. Since conventional overdriving scheme uses memory to perform ideal processing, it is desired to reduce system cost by decreasing the data stored in these SDRAMs. As a general compression method, quantization, sub-sampling and Block Truncation Coding ( BTC ) are used, which process data in block base and cause block effect. So we proposed new data compression method by color space conversion. Because this method compresses luminance and chrominance signal by different ratio, it can efficiently reduce error of block effect in decompression image.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.429-438
• /
• 2012

This study presents two reversible data hiding schemes based on the coefficient shifting (CS) algorithm. The first scheme uses the CS algorithm with a mean predictor in the spatial domain to provide a large payload while minimizing distortion. To guard against manipulations, the second scheme uses a robust version of the CS algorithm with feature embedding implemented in the integer wavelet transform domain. Simulations demonstrate that both the payload and peak signal-to-noise ratio generated by the CS algorithm with a mean predictor are better than those generated by existing techniques. In addition, the marked images generated by the variant of the CS algorithm are robust to various manipulations created by JPEG2000 compression, JPEG compression, noise additions, (edge) sharpening, low-pass filtering, bit truncation, brightness, contrast, (color) quantization, winding, zigzag and poster edge distortion, and inversion.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.4
• /
• pp.964-969
• /
• 2008

This paper proposes a HMM-based recognition method using DMSVQ(Dynamic Multi-Section Vector Quantization) codebook by DMS(Dynamic Multi-Section) model and fuzzy concept, as a study for speaker- independent speech recognition. In this proposed recognition method, training data are divided into several dynamic section and multi-observation sequences which are given proper probabilities by fuzzy rule according to order of short distance from DMSVQ codebook per each section are obtained. Thereafter, the HMM using this multi-observation sequences is generated, and in case of recognition, a word that has the most highest probability is selected as a recognized word. Other experiments to compare with the results of recognition experiments using proposed method are implemented as a data by the various conventional recognition methods under the equivalent environment. Through the experiment results, it is proved that the proposed method in this study is superior to the conventional recognition methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5C
• /
• pp.302-308
• /
• 2011

In this paper we propose a coordinated beamforming(CBF) scheme considering the effects of feedback quantization and delay in time-varying multiple-input multiple-output(MIMO) broadcast channels. By equal power allocation per data stream, the proposed CBF scheme transmits multiple data streams per user terminals without additional feedback overhead when quantized feedback information is used. The proposed CBF scheme also applies a linear channel predictor to each user terminals to prevent errors due to feedback delays that are not evitable in practical wireless systems. Each user terminal utilizes Wiener filter to predict future channel responses and generates feedback information based on the predicted channels. Consequently the proposed CBF scheme adapting Wiener filter improves system performances compared with the conventional scheme using delayed feedback.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.170-176
• /
• 2009

It has been known that multiuser MIMO systems have better performance than single-user MIMO systems. However, multiuser MIMO systems should eliminate inter-user interferences which are generated by allocating data to multiple users simultaneously There is zero-forcing beamforming (ZFBF) as scheme used widely among algorithms to eliminate inter-user interferences. But, it needs many feedback bits since BS knows quite exact channel state information to use this scheme in real systems. Random beamforming (RBF) was proposed to cope with a defect of ZFBF[1]. RBF is a multiuser scheme to send data to users who have optimal performance with predetermined codebook, each receiver feeds back a index of codeword which has optimal performance within the codebook and its CQI information. [1] assumes that the BS knows perfect CQI information of each receiver but CQI information should be quantized in the real systems. Therefore, in this paper, efficient CQI quantization scheme for RBF system is proposed.