• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1392-1400
• /
• 1999

In this paper, we propose a two-stage fast full search algorithm for block motion estimation that produces the same performance to that of full search algorithm (FSA) but with remarkable computation reduction. The proposed algorithm uses the search region subsampling and the difference of adjacent pixels in the current block. In the first stage, we subsample the search region by a factor of 9, and then calculate mean absolute error (MAE) at the subsampled search points. And in the second stage, we reduce the search points that need block matching process by using the lower bound of MAE value at each search Point. We Set the lower bound of MAE value for each search point from the MAE values which are calculated at the first stage and the difference of adjacent pixels in the current block. The experimental results show that we can reduce the computational complexity considerably without any degradation of picture quality.

• The Journal of the Korea Contents Association
• /
• v.5 no.5
• /
• pp.287-295
• /
• 2005

This paper describes user context awareness system, which is one of the most essential technologies in various application services of ubiquitous computing. The proposed system used two-akial accelerometer, embedded in SenseWear(R)PRO2 Armband (BodyMedia). When it was worn on the right upper arm of the experiment subjects, MAD (mean of absolute difference) value of the sensor data was calculated to quantify the amount of the wear's activity. Using this data, PC-based fuzzy inference system was realized to distinguish human motion states, such as, lying, sitting, walking and running and to recognize the restricted emergency situations. In laboratory experiment, the amount of activities for tying, sitting, walking and running were 0.204 g/s, 0.373 g/s, 2.808 g/s and 16.243 g/s respectively. The recognition rates of human motion states were 96.7 %, 93.0 %, 95.2 % and 98.4 % respectively for lying, sitting, walking and running. The recognition rate of restricted emergency situation was 100%.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.245-254
• /
• 2006

In this work, a new rate control algorithm for transmission of H.264/AVC video bit stream through CBR(constant bit rate) channel is proposed. The proposed algorithm predicts target bit rate and MAD(mean of absolute difference) for current frame considering image complexity variance between neighboring backward and current images. In details, respective linear regression analysis for MAD and encoded bit rate against image complexity variance produce correlation parameters. Additionally, it uses frame skip technique to maintain bit stream within a manageable range and protect buffer from overflow or underflow. Implementation and experimental results show that the proposed algorithm can provide accurate bit allocation, and can effectively visual degradation after scene changes. Also our proposed algorithm encodes the video sequences with less frame skipping compared to the existing rate control for H.264/AVC.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.3
• /
• pp.93-102
• /
• 2008

In this paper, we propose a rate control algorithm for constant quality real time video coding. To achieve constant quality, previous algorithm exploit mean absolute of difference(MAD) as measure of frame complexity. However, if scene is abruptly changed or if quantization parameter is not constant, encoder produces various output bits with same MAD. Therefore we know that MAD does not appropriately reflect characteristic of frame. To solve this problem, we exploit model parameter as measure of frame complexity. Because model parameter means slope between output bits and MAD, it reflects correctly complexity of frame. And because previous model, R-MAD model, is not considered quantization parameter, as quantization parameter increases or decreases, model parameter of frame also vary. So model parameter obtained using previous model cannot reflect internal characteristic of video. We solve this problem using proposed model, which is considered quantization parameter. Experiment results show that our algorithm provide better performance, in terms of quality smoothness than previous algorithm. Especially, when scene is abruptly changed, our algorithm alleviates quality drop.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.397-405
• /
• 2003

In this paper, we propose an efficient motion estimation algorithm which can reduce computational complexity by using characteristics of wavelet coefficient in each subband while keeping about the same image quality as in using MRME(multiresolution motion estimation). In general, because of the high similarity between consecutive frames, we first decide whether the motion exists or not by just comparing MAD(mean absolute difference) between blocks with threshold in the lowest subbands of consecutive two frames. If it turns out that there is no motion in the lowest subband, we can also decide no motion exists in the higher subband. This is due to the characteristics of wavelet transform. Conversely, if we find any motion in the lowest subband, we can reduce computational complexity by estimating high subband motion vectors selectively according to the amount of computational complexity by estimating high subband motion vectors selectively according to the amount of energy in that subband. Experimental results are shown that algorithm suggested in this paper maintains about the same PSNR as MRME. However, the processing time was reduced about 30-50% compared with the MRME.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1506-1517
• /
• 1999

In this paper, we propose two fast block matching algorithm using the distribution of mean absolute difference (MAD) at the search region overlapped with neighbor blocks and pixel subsapmling. The proposed methods use the lower and upper bound of MAD at the overlapped search region which is calculated from the MAD of neighbor block at that search position and MAD between the current block and neighbor block. In the first algorithm, we can reduce the computational complexity by executing the block matching operation at the only necessary search points. That points are selected using the lower bound of MAD. In the second algorithm, we use the statictical distribution of actual MAD which exists between the lower bound and upper bound of MAD. By using the statistical distribution of actual MAD, we can significantly reduce the computational complexity for motion estimation. after striking space key 2 times.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.446-454
• /
• 2004

With the growth of multimedia systems, compressing image data has become more important in the area of multimedia services. Since a compressed image bitstream can often be seriously distorted by various types of channel noise, an error concealment algorithm becomes a very important issue. In order to solve this problem, Hsia proposed the error concealment algorithm where he recovered lost block data using 1D boundary matching vectors. His algorithm, however, requires high computational complexity since each matching vector needs MAD (Mean Absolute Difference) values of all pixels, which is either a boundary line top or a boundary line bottom of a damaged block. We propose a hierarchical search-based fast error concealment scheme as well as its approximated version to reduce computational time. In the proposed scheme, a hierarchical search is applied to reduce the number of checking points for searching a vector. The error concealment schemes proposed in this paper can be about 3 times faster than Hsia's with keeping visual quality and PSNR.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.931-934
• /
• 2000

움직임 추정 및 보상을 위한 방법 중 가장 많이 사용하는 블록 정합 방법은 어떤 평가 함수와 탐색방법(Search Procedure)을 사용했느냐에 따라 그 성능이 달라지게 된다. 본 논문에서는 평가 함수로써 평균 제곱 오차(Mean Squared Error; MSE), 평균 절대값 오차(Mean Absolute Error; MAE), 화소 차분류(Pel Difference Classification: PDC)을, 탐색 방법으로써 전체 탐색 방법(Full Search Method : FSM), 3단계 탐색 방법(Three Step Search : TSS), 대각 탐색 방법(Cross Search Algorithm ;CSA)을 사용하여 이들의 성능을 각각 비교 분석하여 봄으로써 블록 정합 방법을 이용한 움직임 추정에 대한 전반적인 이해를 도모하고자 한다.

• ETRI Journal
• /
• v.18 no.2
• /
• pp.61-74
• /
• 1996

We propose two new rate control schemes to improve MPEG-2 rate control in view of visual quality when scene changes happen. Two proposed schemes are characterized by real-time and non real-time improvement to reduce the impact of scene changes. We also propose a new target-bit prediction method using spatial activity of pictures and present a simple and efficient scene change detection scheme using signed difference of mean absolute difference (MAD). Computer simulation results show that the proposed real-time algorithm effectively alleviates visual quality degradation after scene changes. The proposed non real-time algorithm gives maximum 2 dB improvement in peak signal-to-noise ratio (PSNR) at a scene-changed picture, compared with MPEG-2 rate control scheme and it shows better quality than the real-time one.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.4
• /
• pp.85-95
• /
• 1998

In this paper, a new watermarking method for a copy protectionof images is proposed. The proposed method adaptively embeds a watermark in the frequency domain of images using human visual system model. For this purpose, the Just Noticeable Differences(JNDs) of each frequency coeffeicient value of a luminance plane is first found using Watson and Solomon's visual system model. An invisible maximum watermark value with is different in every position according to the characteristics of images is determined usig JND and Minkowski metric. A low frequency domain is divided into two sets based on a PN-sequence to protect thewatermark from the attack. The watermarks are added to one set of coefficients and detecting a watermark, the difference between the mean values of absolute coefficient values of both sets is calculated. The embedded watermark is tested using statistical hypothesis based on test static dertermined by the ean difference. To demonstrate the perfromance of the proposed method, the new watermarking method is applied to a high frequency image and low frequency images. Experimenatal results show the watermark is invisible and robust to JPEGlossy compression and noise.