• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.2
• /
• pp.31-39
• /
• 2003

The MPEG-2 source coding algorithm is very sensitive to transmission errors due to using of variable-length coding. When the compressed data are transmitted, transmission errors are generated and error correction scheme is not able to be corrected well them. In the decoder error concealment (EC) techniques must be used to conceal errors and it is able to minimize degradation of video quality. The proposed algorithm is method to conceal successive macroblock errors of I-frame and utilize temporal information of B-frame and spatial information of P-frame In the previous GOP which is temporally the nearest location to I-frame. This method can improve motion distortion and blurring by temporal and spatial errors which cause at existing error concealment techniques. In network where the violent transmission errors occur, we can conceal more efficiently severe slice errors. This algorithm is Peformed in MPEG-2 video codec and Prove that we can conceal efficiently slice errors of I-frame compared with other approaches by simulations.

• Journal of Satellite, Information and Communications
• /
• v.9 no.3
• /
• pp.116-120
• /
• 2014

Visible Light Communication is one of the promising technologies for wireless communication due to the possibility to use existing LED lightening infrastructure to transmit data. LED has the ability to turn on and off very fast enough that our human eyes can't recognize so it can be used to transmit data via visible light along with illumination. But it faces flicker problem due to the brightness discrepancies between '1' and '0' bit patterns inside a data frame. Various run length limited (RLL) coding scheme like Manchester code, 4B6B, 8B10B or VPPM can be used to solve flickering problem. So we propose pseudo Manchester codding which can transmit data without modifying LED modulator and demodulator circuit as well as solve flickering problem.

• Journal of Broadcast Engineering
• /
• v.13 no.2
• /
• pp.188-199
• /
• 2008

In conventional video coding, encoder complexity is much higher than that of decoder. However, investigations for lightweight encoder to eliminate motion prediction/compensation claiming most complexity in encoder have recently become an important issue. The Wyner-Ziv coding is one of the representative schemes for the problem and, in this scheme, since encoder generates only parity bits of a current frame without performing any type of processes extracting correlation information between frames, it has an extremely simple structure compared to conventional coding techniques. However, in Wyner-Ziv coding, channel decoding errors occur when noisy side information is used in channel decoding process. These channel decoding errors appear more frequently, especially, when there is not enough correlation between frames to generate accurate side information and, as a result, those errors look like Salt & Pepper type noise in the reconstructed frame. Since this noise severely deteriorates subjective video quality even though such noise rarely occurs, previously we proposed a computationally extremely light encoding method based on selective median filter that corrects such noise using spatial correlation of a frame. However, in the previous method, there is a problem that loss of texture from filtering may exceed gain from error correction by the filter for video sequences having complex torture. Therefore, in this paper, we propose an improved lightweight encoding method that minimizes loss of texture detail from filtering by allowing information of texture and that of noise in side information to be utilized by the selective median filter. Our experiments have verified average PSNR gain of up to 0.84dB compared to the previous method.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.793-797
• /
• 2008

To achieve flexible visual contents adaptation for multimedia communications, the ISO/IEC MPEG & ITU-T VCEG form the JVT to develop an SVC amendment for the H.264/AVC standard. JVT uses inter-layer prediction that can improve the rate-distortion efficiency of the enhancement layer. But inter-layer prediction causes computational complexity to be increased. In this paper, we propose a fast mode decision for inter frame coding. It makes use of the correlation between optimized prediction mode and its RD cost. Experimental results show that the proposed schemes save up to 38% of encoding time with a negligible coding loss and bit-rate increase.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.723-726
• /
• 2009

This paper describes a non-causal interpolative prediction method for B-picture encoding. Interpolative prediction uses correlations between neighboring pixels, including non-causal pixels, for high prediction performance, in contrast to the conventional prediction, using only the causal pixels. For the interpolative prediction, the optimal quantizing scheme has been investigated for preventing conding error power from expanding in the decoding process. In this paper, we extend the optimal quantization sceme to inter-frame prediction in video coding. Unlike H.264 scheme, our method uses non-causal frames adjacent to the prediction frame.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.618-622
• /
• 2009

An improvement of standard encoder has been saturated recently. However, new coding method does not have a compatibility with conventional standard. To solve this problem, new concept coding method that has a semicompatibility with standard may be discussed. On the other hand, cyclic Intra-picture coding is used for access and refreshment. However, I-picture spend large amount of bits. An enhancement of I-picture is desired with keeping its refreshment performance. Further, it's a problem that quality change at the border of GOP because of its independency. To respond these, we propose the coding which is applied an inter-frame processing at the border of GOP. Applied method is the reduction of quantization error using the motion compensated inter-picture processing. In this report, we check the improvement of the efficiency and the compatibility of proposed method. As a result of examination, we recognize that the total gain is maximally 1.2dB in PSNR. Generally, the degradation of performance in standard decoding is smaller than its gain. Also the refreshment performance is tested.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.141-148
• /
• 1994

This paper presents a new method for reducing the blocking artifacts there by increasing the prediction gains of the block-based motion compensation keeping the amount of the motion information to be transmitted intact. The new method improves the motion compensation along the edges of moving objects by segmenting the motion field at the pixel resolution based on the model that the motion compensated image is the maximum a poseriori estimate of the current frame.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.30-38
• /
• 1995

In this paper, we propose an efficient architecture for motion estimation processor which performs one of essential functions in moving picture coding algorithms. Simple control mechanism of data flow in register array which stores pixel data, parallel processing of pixel data and pipelining scheme in arithmetic umit allow this architecture to process a 352*288 pixel image at the frame rate of 30fs, which is compatable with CCITT standard H.261.

• Journal of Microbiology and Biotechnology
• /
• v.3 no.2
• /
• pp.91-94
• /
• 1993

A 3-isopropylmalate dehydrogenase (3-IPMD) gene was cloned from Kluyveromyces fragilis. pJK104 could complement Escherichia coli leuB and Saccharomyces cerevisiae leu2 auxotrophs. The coding region was subcloned and the nucleotide sequence was determined. A 1.8 Kb EcoRI/SphI fragment of pJK104 subcloned in pUC18 could still complement the leuB mutation. An open reading frame of 1164 bp that corresponds to a polypeptide of 387 amino acids was found in the cloned fragment. The homology between the 3-isopropylmalate dehydrogenase of S. cerevisiae and that of K. fragilis was 68.13％ in nucleotides.

• Journal of Life Science
• /
• v.15 no.5 s.72
• /
• pp.734-738
• /
• 2005

A gene coding for xylanase from alkali-tolerant Bacillus alcalophilus AX2000 was cloned into Escherichia coli $DH5\alpha$ using pUC19. Among 2,000 transformants, one transformant showed clear zone on the detection agar plate containing oat-spells xylan. Its recombinant plasmid, named pXTY99, was found to carry 7.0 kb insert DNA fragment. When the nucleotide sequence of the cloned xylanase gene (xynT) was determined, xynT gene was found to consist of 1,020 base-pair open reading frame coding for a poly-peptide of 340 amino acids with a deduced molecular weight of 40 kDa. The coding sequence was preceded by a putative ribosome binding site, and the transcription initiation signals. The deduced amino acid sequence of xylanase is similar to those of the xylanases from Bacillus sp. Nl37 and B. stearothermophilus 21 with $61\%$ and $59\%$ identical residues, respectively.