• 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 Broadcast Engineering
• /
• v.11 no.4 s.33
• /
• pp.420-430
• /
• 2006

In this paper, we propose a flexible GGOP prediction structure to improve coding efficiency for multi-view video coding. In general, reference software used for MVC uses the fixed GGOP prediction structure. However, the performance of MVC depends on the base view and numbers of B-pictures between I-picture(or P-picture) and P-picture. In order to implement the flexible GGOP prediction structure, the location of base view is decided according to the global disparities among the adjacent sequences. Numbers of B-pictures between I-picture(or P-picture) and P-picture are decided by camera arrangement such as the baseline distance among the cameras. The proposed method shows better result than the reference software of MVC. The proposed prediction structure shows considerable reduction of coded bits by 7.1%.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.3E
• /
• pp.7-13
• /
• 1997

This paper addresses traffic prediction issues on MPEG. A new adaptive traffic prediction scheme is proposed using MPEG picture characteristic that picture traffic depends on the coding mode of that picture, that is, I, P, and B mode. Our prediction scheme, which is based n picture decomposition (PD) and the cross-correlation of the different types of pictures, has better performance in predicting bursty MPEG traffic than that of the first-order autoregressive (AR) prediction scheme. Our simulation results show that the performance is further improved about 15% by utilizing the cross-correlations between pictures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2025-2031
• /
• 1998

In moving picture coding standard MPEG2, a bit rate control system plays a key role for the compressing ratio and picture quality. We proposed a bit rate control scheme which assigns more bits to I, P frames and uses the average MQUANT of previous mackoblocks. The proposed scheme showed about 0.9dB improvement of image quality when compared to bit rate control method of MPEG2 Test-Model5.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.167-169
• /
• 2005

The occurrence of a single bit error in transmission bitstream leads to serious temporal and spatial errors. Because moving picture coding as MPEG-2 based on block coding algorithm uses variable length coding and motion compensation coding algorithm. In this paper, we propose algorithm to conceal occurred error of I-frames in transmission channel using data of the neighboring blocks in decoder. We divide a damaged macroblock of I-frame into four sub blocks and compose new macroblock using the neighboring blocks for each sub block. We estimate the block with minimum difference value through block matching with previous frame for new macroblocks and replace each estimated block with damaged sub block in the same position. Through simulation results, the proposed algorithm will be applied to a characteristic of moving with effect and shows better performance than conventional error concealment algorithms from visual and PSNR of view.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.10
• /
• pp.13-26
• /
• 1993

Motion picture algorithms are realized on the multiprocessor system presented in the Study I. For the most efficient processing of the algorithms, pipelining and geometrical parallel processing methods are employed, and processing time, communication load and efficiency of each algorithm are compared. The performance of the implemented system is compared and analysed with reference to MPEG coding algorithm. Theoretical calculations and experimental results both shows that geometrical partitioning is a more suitable parallel processing algorithm for moving picture coding having the advantage of easy algorithm modification and expansion, and the overall efficiency is higher than pipelining.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2006.11a
• /
• pp.111-115
• /
• 2006

스케일러블 비디오 코딩(SVC, Scalable Video Coding)은 MPEG(Moving Picture Expert Group)과 VCEG (Video Coding Expert Group)의 JVT(Joint VIdeo Team)에 의해 현재 표준화 되고 있는 새로운 압축 표준 기술이며 시간, 공간 및 화질의 스케일러빌리티를 지원하기 위해 계층 구조를 가지고 있다. 특히 시간적 스케일러빌리티를 위해 계층적 B-픽처 구조를 채택하고 있다. 스케일러블 비디오 코딩의 기본 계층은 H.264|AVC와 호환적이므로, 모션 예측과 모드 결정과정에서 $16{\times}16,\;16{\times}8,\;8{\times}16,\;8{\times}8,\;8{\times}4,\;4{\times}8$ 그리고 $4{\times}4$와 같은 7개의 서로 다른 크기를 갖는 블록을 사용한다. 스케일러블 비디오 코딩에서 사용되고있는 계층적 B-픽처 구조는 키 픽처인 I와 P 픽처를 제외하고는 한 GOP (Group of Picture)내에서 모두 B-픽처를 사용하므로 H.264|AVC와 비교했을 때 연산량 증가와 함께 부호화 지연도 급격히 증가한다. B-픽처는 양방향 모션 벡터인 LIST0와 LIST1을 사용하고 양방향 모두에서 다중 참조 픽처를 사용하기 때문이다. 본 논문에서는 통계적 가선 검증을 이용하여 스케일러블 비디오 부호화에 적용 가능한 고속 프레임간 모드 결정 알고리듬 대해 소개한다. 제안된 방법은 $16{\times}16$ 매크로 블록과 $8{\times}8$ 서브 매크로 블록에 통계적 가설 감증 기법을 적용하여 실행되며, 현재 블록과 복원된 참조 블록간의 픽셀 값을 비교하여 RD(Rate Distortion) 최적화 기반 모드 결정을 빨리 완료함으로써 고속 프레임간 모드 결정을 가능하게 한다. 제안된 방법은 프레임 간 모드 결정을 고속화함으로써 스케일러블 비디오 부호화기의 연산량과 복잡도를 최대 57%감소시킨다. 그러나 연산량 감소에 따른 비트율의 증가나 화질의 열화는 최대 1.74% 비트율 증가 및 0.08dB PSNR 감소로 무시할 정도로 작다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.387-398
• /
• 1996

In this study the cell arrival processes from pre-buffer into multiplexer for MPEG(Motion Picture Experts Group) coding video sources are analyzed with consideration of the traffic periodicity in frame level. The analysis is performed by introducing the two arrival models, that is, periodic on/off source model and periodic uniform arrival model. Modulated $N^*D$/D/1 queueing system is utilized in periodic on/off source model, while ${\Sigma}{N_i}^*D_i$/D/1 queueing system is used in periodic uniform arrival model. The presented models are validated by comparing with computer simulations. Numerical results for periodic uniform arrival model are shown to be very accurate, but those of periodic on/off source model are shown to be inaccurate as the number of sources are increased.

• Journal of Korea Multimedia Society
• /
• v.14 no.7
• /
• pp.917-923
• /
• 2011

In this paper, a new prediction based embedded compression (EC) codec algorithm for the JPEG2000 encoder system is proposed to reduce excessive memory requirements. The EC technique can reduce the 50 % memory requirement for intermediate low-frequency coefficients during multiple discrete wavelet transform (DWT) stages compared with direct implementation of the DWT engine of this paper. The LOCO-I predictor and MAP are widely used in many lossless picture compression codec. The proposed EC algorithm use these predictor which are very simple but surprisingly effective. The predictive EC scheme adopts a forward adaptive quantization and fixed length coding to encoding the prediction error. Simulation results show that our LOCO-I and MAP based EC codecs present only PSNR degradation of 0.48 and 0.26 dB in average, respectively. The proposed algorithm improves the average PSNR by 1.39 dB compared to the previous work in [9].

• Journal of Broadcast Engineering
• /
• v.15 no.3
• /
• pp.321-331
• /
• 2010

Most of multimedia video coding algorithms are lossy schemes and several kinds of spatial and temporal artifacts are inevitable. Flickering, which is the most typical coding artifact in time domain, is mainly due to fact that the quality of coded sequence fluctuates as the quantization parameter is adjusted for rate control. In this paper, we analyzed the effect of quality variation according to the characteristics of video sequence when the I-frames are periodically inserted. And we proposed the FR(Full Reference)-based assessment algorithm to measure the amount of flickering artifacts in the coded video. It is discovered that the flickering becomes critical when the level of quality is intermediate and is affected by the amount of detail or movement, the size of object, and camera parameters. The proposed measurement algorithm shows is well consistent with HVS(Human Visual System).