• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2513-2515
• /
• 2001

본 논문에서는 유한비트 근사화를 통하여 고정소수점 연산을 이용하여 DCT구현시 발생하는 오차 영향에 대한 해석을 수행하였다. 고정소수점 연산을 위해서는 유한 비트 근사화를 실시하여야 하는데 이 과정에서 수치 표현범위의 제약으로 인한 오차가 발생하게 되고, 특히 순환 연산구조를 가지는 DCT등의 알고리즘 구현시 급격한 성능의 감소를 가져오게 된다. 본 논문에서는 순환 연산식을 유한비트 근사화를 통하여 구현시 발생되는 에러에 대한 분석을 수행하고, 해석식을 도출하였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.42-53
• /
• 2000

Efficient implementation of pre-filtering has been an important issue in video sequence coding, because it can remove camera noise and improve coding efficiency dramatically This paper introduces a novel pre-filtering scheme that is performed inside a video encoder The proposed pre-filtering is based on the approximated generalized Wiener filtering and two-dimensional discrete cosine transform (DCT) factorization. and is achieved by scaling the DCT coefficients of original image blocks for intra block coding and those of motion-compensated error blocks for inter block coding, respectively Even though the pre-filtering operation is embedded in a video encoder, its additional computational complexity is marginal compared to the encoding process, and the overall architecture of the conventional video encoder is maintained In spite of its simplicity, the proposed pre-filtering scheme provides good filtering and coding performance for noisy video sequences.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.392-397
• /
• 2000

An Interlaced 2D field images compression technique by Discrete Wavelet Transform is proposed. The result has a good image resolution and compression rate, PSNR, and reduces processing time of compression. PSNR depends on the exponential function corresponding to 2 power N has higher 30% than DCT. And It is easier to process the inter-frame and fast to work a second with each parallel field processing, and more be able to approximate a frame on the field.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1885-1888
• /
• 2003

본 논문에서는 인쇄물의 위조방지를 위해 에러에 강한 디지털 워터마킹을 제안한다. 제안한 알고리즘은 워터마크 삽입을 위해 먼저 원영상을 웨이브릿 변환하여 근사(approximation) 이미지를 얻고, 워터마크는 근사 이미지의 DC계수를 제외한 중요한 DCT계수에 삽입된다. 워터마크의 강건도 향상을 위해 에러정정코드와 반복을 적용하고, 디지털 기기사이의 변환에 의한 차이를 줄이기 위해 CIE Lab 칼라 공간을 사용하였다. 표준 칼라 영상을 사용하여 실험한 결과, 기존 방법에 비하여 적은 반복으로도 비트에러가 발생을 감소하였으며, 알고리즘은 1차의 프린트 스캔에서는 robust 하고 2차의 프린트 스캔에서는 fagile 한 성격을 나타내었다, 본 알고리즘은 여권, 지폐, 신분증, 면허증등과 같은 인쇄물의 위조방지에 이용될 수 있다.

• Journal of Broadcast Engineering
• /
• v.2 no.2
• /
• pp.194-205
• /
• 1997

In video compression standards such as MPEG and H.263. rate control is one of the key components for good coding performance. This paper presents a simple adaptive rate control scheme using a piecewise linear approximation model. While conventional buffer control approach is performed by adjusting the quantization parameter linearly according to the buffer fullness. the proposed approach uses a piecewise linear approximation model derived from logarithmic relation between the quantization parameter and bitrate in data compression. In addition. a forward analyzer performed in the spatial domain is used to improve image quality. Simulation results demonstrate that the proposed method provides better performance than the conventional one and reduces the fluctuation of the PSNR per frame while maintaining the quality of the reconstructed frames at a relatively stable level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.1087-1099
• /
• 1998

In the content-based image coding, where each object in the scene is encoded independently, the shape, texture and motion information are very important factors. Though the contours representing the shape of an object occupy a great amount of data in proportion to the whole information, they strongly affect the subjective image quaility. Therefore, the distortion of contour coding has to be minimized as much as possible. In this paper, we propose a new method for the contour coding in which the contours are approximated to polygon and the eorror signal occurring from polygonal approximation are transformed with new basis functions. Considering the facts that confour segments occurring from polygonal approximation are smooth curves and error signals have two zero-ending points, we design new basis functions based on the Legendre polynomial and then transform the error signals with them. When applied to synthetic images such as circles, ellipses and etc., the proposed method provides, in overall, outstanding results in respect to the transform coding gain compared with DCT and DST. And in the case when applied to natural images, the proposed method gives better image quality over DCT and comparable results with DST.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.106-114
• /
• 2016

In this paper, we propose an efficient integer inverse transform structure for vp9 decoder. The proposed structure is a hardware structure which is easy to control and requires less hardware resources, and shares algorithms for realizing entire DCT(Discrete Cosine Transform), ADST(Asymmetric Discrete Sine Transform) and WHT(Walsh-Hadamard Transform) in vp9. The integer inverse transform for vp9 google model has a fast structure, named butterfly structure. The integer inverse transform for google C model, unlike universal fast structure, takes a constant rounding shift operator on each stage and includes an asymmetrical sine transform structure. Thus, the proposed structure approximates matrix coefficient values for all transform mode and is used to matrix operation method. With the proposed structure, shared operations for all inverse transform algorithm modes can be possible with reduced number of multipliers compared to the butterfly structure, which in turn manages the hardware resources more efficiently.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.27-34
• /
• 2004

This paper proposes a method to trace and interpret a moving object based on the information which can be directly obtained from MPEG-2 compressed video stream without decoding process. In the proposed method, the motion flow is constructed from the motion vectors included in compressed video. We calculate the amount of pan, tilt, and zoom associated with camera operations using generalized Hough transform. The local object motion can be extracted from the motion flow after the compensation with the parameters related to the global camera motion. Initially, a moving object to be traced is designated by user via bounding box. After then automatic tracking Is performed based on the accumulated motion flows according to the area contributions. Also, in order to reduce the cumulative tracking error, the object area is reshaped in the first I-frame of a GOP by matching the DCT coefficients. The proposed method can improve the computation speed because the information can be directly obtained from the MPEG-2 compressed video, but the object boundary is limited by macro-blocks rather than pixels. Also, the proposed method is proper for approximate object tracking rather than accurate tracing of an object because of limited information available in the compressed video data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10B
• /
• pp.1382-1389
• /
• 2001

움직임 보상-이산 코사인 변환 (motion compensation-discrete cosine transform : MC-DCT) 기반의 동영상 부호화 기법이 부호화 효율성 및 구현의 단순성으로 인해 널리 사용되고 있으나, 에러 환경에서 구조적으로 취약한 면이 있다. 본 논문에서는 다중 메모리 움직임 보상 예측 (long-term memory motion compensated prediction : LTMP) 기반의 다중 레프런스 프레임을 사용하여 에러에 강인한 동영상 부호화 기법을 제안한다. 또한 제안하는 알고리듬에 기반한 에러 은닉 기법 (error concealment : EC)을 구현한다. 즉, R-D (rate-distortion) 최적화에 프레임간 움직임 벡터 (temporal motion vectors)의 확산 인자를 추가하여 에러에 대한 강인성 및 에러 은닉 기법의 효율성을 증가시켰다. 또한, 제안하는 알고리듬은 시간축상의 에러 전파를 피드백 정보 (negative acknowledgement : NAK)를 사용하여 억제한다. 즉, NAK는 채널 에러에 의해 손실된 영역과 에러가 전파된 영역을 추정하여 움직임 보상 영역에서 제외되도록 하는데 이용된다. 따라서, 제안하는 알고리듬은 PSNR 측면에서 FIU (forced intra update)에 근사하는 성능을 보이나, FIU와는 달리 비트율의 증가를 피할 수 있어 제한된 대역폭의 네트웍을 효율적으로 사용할 수 있다. 컴퓨터 모의 실험을 통해 제안하는 알고리듬이 기존의 H.263 및 LTMP 기반의 부호기에 비해 에러 환경에서 주관적 및 객관적 화질 측면에서 성능이 우수함을 보인다.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.109-122
• /
• 2000

As the full-motion videos in MPEG are widely available nowadays, an editor that could easily edit such kind of media data is required to develop various multimedia applications. In order to concatenate and apply a transition effect to two video streams encoded in MPEG, they should be decoded first since there are dependencies in the frames in MPEG-encoded video stream. Since this decode-edit-encode process requires a huge amount of computing/storage resources, a new editing scheme that could apply various transition effects to MPEG video streams directly while keeping the quality of video data is strongly required. This paper proposes a new editing scheme that could apply three transition effects (such as fade-in, fade-out, and dissolve) to MPEG video streams in a compressed domain. In the proposed scheme, an extension of previous method in which the frames are partially decompressed and transition effects are applied is adopted for I- and P-frames. In addition, a new processing scheme for B-frame that could apply the transition effects in DCT domain directly using an approximation of motion compensation based on the motion vector to reference frames. Since this processing scheme could apply the transition effects in a compressed domain directly, the editing process could be speed-up about $3{\sim}4$ times faster than previous decode-edit-encoding method while keeping the quality of video data as good as the source data. The proposed scheme could be used to build a software-only MPEG video editing system that helps to edit MPEG video data even on a low-cost desk-top computer.