• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.244-247
• /
• 2010

현대 사회에서 영상 콘텐츠 (contents)의 사용량이 급증함에 따라 영상압축 기술은 이동통신이나 DMB 등의 시스템에 필수적인 기술이 되었으며 이에 따라 MPEG-x와 H.26x 등 국제적인 표준들이 존재한다. 전역 탐색 알고리듬은 주어진 검색 범위(search range) 내에서 모든 후보들의 변위의 에러 기준에 따라 최솟값을 이용해 위치를 검색하는 알고리듬이다. 그러나 전역 탐색 알고리듬은 각 화소에 대해 엄청난 양의 계산 로드를 가지며 이로 인해 심각한 문제를 발생시키는 단점이 있다. 1비트 변환 (one-bit transform) 을 이용한 고속 움직임 추정 알고리듬은 참조 프레임과 현재 프레임을 1비트, 즉 0 또는 1만 갖는 값으로 변환하는데, 이에는 exclusive-OR 연산을 통해 블록 매칭 에러 (block matching error)를 계산하는 과정과 변환하는 과정이 포함된다. 본 논문에서는 다양한 커널 (kernel)들을 이용한 1비트 변환과 움직임 추정에 대해 다루었으며, 기존에 있었던 1비트 변환에 이용된 커널과는 다른 다양한 커널을 이용한 움직임 추정 결과들을 비교해봄으로써 화질열화를 최소로 하는 커널을 찾는 것에 대해 연구했다.

• ETRI Journal
• /
• v.23 no.4
• /
• pp.190-198
• /
• 2001

The performance of Motion Compensated Discrete Cosine Transform (MC-DCT) video coding is improved by using the region adaptive subband image coding [18]. On the assumption that the video is acquired from the camera on a moving platform and the distance between the camera and the scene is large enough, both the motion of camera and the motion of moving objects in a frame are compensated. For the compensation of camera motion, a feature matching algorithm is employed. Several feature points extracted using a Sobel operator are used to compensate the camera motion of translation, rotation, and zoom. The illumination change between frames is also compensated. Motion compensated frame differences are divided into three regions called stationary background, moving objects, and newly emerging areas each of which is arbitrarily shaped. Different quantizers are used for different regions. Compared to the conventional MC-DCT video coding using block matching algorithm, our video coding scheme shows about 1.0-dB improvements on average for the experimental video samples.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.167-169
• /
• 2008

In this paper, we propose hardware architecture for a high-speed context-adaptive variable length coding (CAVLC) decoder in H.264. In the CAVLC decoder, the codeword length of the current decoding block is used to determine the next input bitstreams (valid bits). Since the computation of valid bits increases the total processing time of CAVLC, we propose two techniques to reduce processing time: one is to reduce the number of decoding steps by introducing a lookup table, and the other is to reduce cycles for calculating the valid bits. The proposed CAVLC decoder can decode $1920{\times}1088$ 30 fps video in real time at a 30.8 MHz clock.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.342-345
• /
• 2004

An efficient hybrid ARQ scheme based on the rate compatible block turbo codes has been proposed, and its performance has been analyzed. System efficiency is improved by means of adaptive rate code transmission using channel information, trading off bit rate for channel codes, with resulting energy saving. The rate adaptation scheme improves power efficiency while keeping packet delay minimized. On the other hand, power dependant strategies reduce power consumption. Simulation results show that the benefits obtained are very encouraging. The modified hybrid ARQ schemes with the channel information and efficient retransmission structures highly improve the throughput performance in the satellite communication system. Therefore, proposed schemes could be used in future communication systems.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.967-970
• /
• 2001

본 논문에서는 적응 필터의 계수 갱신에서 가변 블록을 사용하는 방법을 제안하였다. 데이터 블록의 길이는 MSE 학습곡선의 시정수에 비례하도록 하였다. 이 방법에서는 적응 필터가 정상상태로 접근함에 따라 스텝사이즈를 조정하여 필터계수 갱신의 횟수를 줄일 수 있다. 제안한 방법의 유용성을 입증하기 위한 컴퓨터모의 실험을 통해 기존의 최적 스텝사이즈 수열을 이용한 알고리듬과 가변 스텝사이즈 알고리듬과 성능을 비교하였다. 그리고 MSE 의 초기값을 최소화하는 최적 초기 스텝사이즈를 유도하였다. 유도된 최적 스텝사이즈를 가변 스텝사이즈 알고리듬에 적용, 그 성능을 평가 하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.7
• /
• pp.1293-1310
• /
• 2011

A simple modification of well known Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is proposed to exploit cooperative diversity. Instead of selecting a single cluster-head, we propose M cluster-heads in each cluster to obtain a diversity of order M. The cluster-heads gather data from all the sensor nodes within the cluster using same technique as LEACH. Cluster-heads transmit gathered data cooperatively towards the destination or higher order cluster-head. We propose a code combining based cooperative diversity protocol which is similar to coded cooperation that maximizes the performance of the proposed cooperative LEACH protocol. The implementation of the proposed cooperative strategy is analyzed. We develop the upper bounds on bit error rate (BER) and frame error rate (FER) for our proposal. Space time block codes (STBC) are also a suitable candidate for our proposal. In this paper, we argue that the STBC performs worse than the code combining cooperation.

• Journal of information and communication convergence engineering
• /
• v.15 no.3
• /
• pp.187-192
• /
• 2017

Autonomous driving vehicle research demands complex road and lane understanding such as lane departure warning, adaptive cruise control, lane keeping and centering, lane change and turn assist, and driving under complex road conditions. A fast and robust road lane detection subsystem is a basic but important building block for this type of research. In this paper, we propose a method that performs road lane detection from black box input. The proposed system applies Random Sample Consensus to find the best model of road lanes passing through divided regions of the input image under HSV color model. HSV color model is chosen since it explicitly separates chromaticity and luminosity and the narrower hue distribution greatly assists in later segmentation of the frames by limiting color saturation. The implemented method was successful in lane detection on real world on-board testing, exhibiting 86.21% accuracy with 4.3% standard deviation in real time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1103-1116
• /
• 1991

The characteristics of transform coefficients of discrete Gabor transform and the performances of their progressive coding are investiganted. The adaptive transform coding SAC is used for the progressive transmission. Exprerimental results show that although DGT has relatively low energy compaction property and coding efficiency, it yields good quality with greaty reduced block artifact and good edge at each stage of the progressive transmission.

• Journal of Broadcast Engineering
• /
• v.14 no.4
• /
• pp.501-508
• /
• 2009

This paper proposes an efficient transform-domain noise reduction scheme in an H.264 video encoder, where the generalized Wiener filtering is performed in a quantization process by multiplying each transform block with its adaptive multiplication factor. In practice, the computational complexity of the proposed scheme is negligible by replacing the multiplication operation with a simple look-up table method. Also, experimental results show that the proposed scheme provides outstanding noise reduction performance in an H.264 video encoder.

• Journal of Broadcast Engineering
• /
• v.4 no.1
• /
• pp.68-75
• /
• 1999

In this paper. we propose a digital watermarking method for still images in the discrete cosine transform (DCT) domain. The adaptive watermark insertion method in the high frequency region within a given image is employed to increase the invisibility of the inserted watermark in images, in which variable block-size method is used for selection of the high frequency region. Experimental results show that the proposed watermarking method is robust to several common image processing techniques. including joint photographic experts group (JPEG) compression, lowpass filtering, multiple watermarking, and croppIng.