• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06a
• /
• pp.143-146
• /
• 1998

본 논문에서는 MPEG-2 압축영상에서 뉴스 색인을 위한 개선된 장면(Shot)전환 알고리즘을 제안한다. 제안된 검출 알고리즘은 압축된 비디오 시퀀스에서 추출한 특징정보인 에지정보와 컬러정보를 함께 사용하여 GOP단위의 빠르고 효율적인 장면전환 검출 결과를 얻을 수 있다. 제안된 알고리즘은 장면전환 검출뿐만 아니라 내용 기반(content - based) 비디오 검색 등에도 효과적으로 이용될 수 있다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.123-124
• /
• 2018

본 논문에서는 HEVC 국제표준으로 압축된 비디오에서 움직임 물체를 추적하는 방법을 제안한다. 제안하는 방법은 HEVC 비트스트림의 대부분을 차지하는 인터 프레임의 움직임 벡터 정보를 입력 데이터로 사용하는 ST-MRF(Spatio-Temporal-Markov Random Field) 모델을 기반으로 하며, ST-MRF 모델에서 발생할 수 있는 오차전파로 점진적으로 객체를 부정확하게 추적하는 것을 HEVC GOP(Group of Picture)마다 삽입되는 인트라 프레임만을 복호화 하여 픽셀 정보를 입력으로 하는 YOLO 모델과 융합시켜 보정함으로써 추적하던 객체를 잃지 않고 강건하게 추적하는 방법을 제안한다.

• 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 the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.218-226
• /
• 2001

The MPEG-2 Test Model 5 (TM5) algorithm is widely used for bit rate control. In TM5, however, the target number of bits and the number of actual coding bits for each picture do not match well. Therefore, buffer overflow and picture quality degradation may occur at the end of the GOP. In this paper, we propose a new bit rate control algorithm for matching the target and the actual coding bits based on accurate bit allocation. The key idea of the proposed algorithm is to determine quantization Parameters which enable us to generate the number of actual coding bits close to the target number of bits for each picture, while maintaining uniform picture quality and supporting real-time processing. The proposed algorithm exploits the relationship between the number of actual coding bits and the number of estimated bits of the previous macroblock.

• Journal of Broadcast Engineering
• /
• v.9 no.3
• /
• pp.236-245
• /
• 2004

A multiview sequence CODEC with view scaiability is proposed in this paper. We define a GGOP (Group of GOP) structure as a basic coding unit to efficiently code multiview sequences. 7he proposed CODEC provides flexible GGOP structures based on the number of views and baseline distances among cameras. Multiview sequences encode consists of disparity estimation/compensation, motion estimation/compensation, residual coding and rate control and generates multiview sequence bitstream. The main bitstream is the same as an MPEG-2 mono-sequence bitstream for MPEG-2 compatibility. The auxiliary bitstream contains information concerning the remaining multiview sequences except for the reference sequences. The proposed CODEC with view scalability provides that a number of view flints are selectively determined at the receiver according to the type of display modes. The proposed multiview sequence CODEC is tested with several multiview sequences to determine its flexibility. compatibility with MPEG-2 and view scaiability. In addition, we subjectively confirm that the decoded bitstreams with view scaiability can be Properly displayed by several types of display modes. including 3D monitors.

• Korean Journal of Cognitive Science
• /
• v.11 no.2
• /
• pp.79-87
• /
• 2000

In this paper we present a face recognition and face detection algorithm in MPEG compressed video. The proposed method consists three stage of processing steps. The first step is to produce a spatially reduced DC image form MPEG compressed video for processing. And the second step is face detection on reduced DC image. Finally, the last step is face recognition on partially extracted compressed frames which contain the detected faces. The spatially reduced DC image is produced from two dimensional inverse DCT of the DC coefficient and the first two AC coefficients. The face detection is performed on DC image and face recognition is performed on one extracted frame per GOP by using the K-L transform. In order to evaluate the proposed method, we carried out experiments on video database. The experiment results show the proposed method is very efficient and helpful for target tasks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1505-1512
• /
• 2009

This paper propose a new frame level rate control algorithm for improving video quality and decreasing quality variation of an entire video sequence in a very low bit rate environment. In the proposed scheme, the allocated bits to a GOP are distributed to each frame properly according to the frame characteristics as well as the buffer status and the channel bandwidth. The H.264 standard uses various coding modes and optimization methods to improve the compression performance, which makes it difficult to control the generated traffic accurately. In this paper, proper prediction models for low bit rate environments are lust proposed, and a target distortion is determined using the models. According to the target distortion, the bit budget is allocated to each frame. It is shown by experimental results that the new algorithm can generate the PSNR performance better than that of the existing rate control algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1355-1363
• /
• 2017

Recently, distributed compressed video sensing (DCVS) has been actively studied in order to achieve a low complexity video encoder by integrating both compressed sensing and distributed video coding characteristics. Conventionally, a motion compensated block compressed sensing with smoothed projected Landweber (MC-BCS-SPL) has been considered as an effective scheme of DCVS with all compressed sensing frames pursuing the simplest sampling. In this scheme, video frames are separately classified into key frames and WZ frames. However, when reconstructing WZ frame with conventional MC-BCS-SPL scheme at the decoder side, the visual qualities are poor for temporally active video sequences. In this paper, to overcome the drawbacks of the conventional scheme, an enhanced MC-BCS-SPL algorithm is proposed, which corrects the initial image with reference to the key frame using a high correlation between adjacent key frames. The proposed scheme is analyzed with respect to GOP (Group of Pictures) structuring method. Experimental results show that the proposed method performs better than conventional MC-BCS-SPL in rate-distortion.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1947-1954
• /
• 2012

The first frame is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the initial QP for the first frame affects the first frame as well as the following frames. Traditionally, the initial QP is determined among four constant values only depending on the bpp. In the case of low bit rate video coding, the initial QP value is fixed to 40 regardless of the output bandwidth. Although this initialization scheme is simple, yet it is not accurate enough. An accurate initial QP prediction scheme should not only depends on bpp but also on the complexity of the video sequence and the output bandwidth. In the proposed scheme, we determine the initial QP according to the ratio of the first frame to the total bits allocated to a GOP. To estimate the QP of the allocated bits, Rate-QP model is used. It is shown by experimental results that the new algorithm can predict the optimal initial QP more accurately and generate the PSNR performance better than that of the existing JVT algorithm.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.144-154
• /
• 2011

In this paper, we propose a parallel LDPCA encoding method for fast transform-domain Wyner-Ziv video encoding which is suitable in an ultra fast and low power video encoding. The conventional transform-domain Wyner-Ziv video encoding performs LDPCA channel coding of quantized transform coefficients in bitplane-serial fashion, which takes about 60% of total encoding time, and this computational complexity becomes severer as the bitrate increases. The proposed method binds several bitplanes into one packed message and carries out the LDPCA encoding in parallel. The proposed LDPCA encoding method improves the encoding speed by 8 ~ 55 times. In the experiment, the proposed Wyner-Ziv encoder can encode 700 ~ 2,300 QCIF size frames per second with GOP=64. The method can be applied to the pixel-domain Wyner-Ziv encoder using LDPCA, and has a wide scope of application.