• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7C
• /
• pp.726-732
• /
• 2003

The paper proposes a motion estimation (ME) technique to reduce computational complexity. It is achieved by skipping ME process for macro-blocks decided to be in no need of the operation. Thus, it is called ME skipping technique(MEST). In general, the ME is composed of integer pixel precision ME (IME) followed by half pixel precision ME (HME). The MEST is performed just before an IME process and makes a decision on skipping the IME process according to a criterion based on ME errors of adjacent macro-blocks (MBs) already encoded. When the IME process for a MB is decided to be skipped, which is called ME skip mode, the IME process is skipped and the integer pixel precision motion vector of the MB is just replaced by a predicted vector and used as the input of HME. On the other hands, the IME processes for MBs in ME non-skip mode are not skipped but normally performed. Accordingly, the MEST is very effective to reduce computational complexity when MBs in ME skip mode is abundant. In addition, when the MEST is applied to video encoder, it contributes to more accurate rate control and more robusaess for channel errors. It is experimentally shown that the MEST has the above advantages while maintaining good reconstructed image quality.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.40 no.1
• /
• pp.43-48
• /
• 2012

This paper proposes a practical linear recursive robust motion deblurring filter using the inertial sensor measurements for strapdown image seekers. The angular rate information obtained from the gyro mounted on the missile is used to define the PSF(point spread function). Since the gyro output contains a unknown but bounded bias error. the motion blur image model can be expressed as the linear uncertain system. In consequence, the motion deblurring problem can be cast into the robust Kalman filtering which provides reliable state estimates even in the presence of the parametric uncertainty due to the gyro bias. Through the computer simulations using the actual IR scenes, it is verified that the proposed algorithm guarantees the robust motion deblurring performance.

• The Journal of the Korea Contents Association
• /
• v.11 no.5
• /
• pp.9-14
• /
• 2011

This paper presents a new fast motion estimation method where search ranges are determined by the probabilities of motion vector differences (MVDs), which is an adaptive/dynamic search range (ASR) method. The MVDs' distribution is investigated and its parameter is estimated by the maximum likelihood estimator. With the estimated distribution, we show that the search ranges can be efficiently restricted by a prefixed probability for MVDs. Experimental results showed that the performance of the proposed method is very similar to that of the full search algorithm in PSNR but it enables significant reduction in the computational complexity. In addition, they revealed that the proposed method determine the search ranges much more efficiently than the conventional ASR methods.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2239-2342
• /
• 2003

디지털 방송의 발달과 인터넷의 사용증가로 인해 멀티미디어 데이터가 기하급수적으로 증가하고 있다. 본 논문에서는 디지털 데이터의 쟁점 중 하나인 불법복제로부터 저작권을 보호하기 위한 비디오 워터마킹 방법을 제안한다. 하드디스크를 내장한 디지털 방송 수신기에 복사 방지를 위한 복사제어 정보를 장면단위로 영상의 복잡도와 움직임 벡터의 크기를 고려하여 워터마크의 형태로 삽입한다. 즉, 복잡한 장면에 대해서는 강도를 강하게 삽입하고 단순한 장면에 대해서는 강도를 약하게 삽입함으로써 워터마크의 비가시성과 강인성을 동시에 만족할 수 있다.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.402-410
• /
• 2006

This paper presents a method for feature based block motion estimation that uses multi -resolution image sequences to obtain the panoramic images in the continuous ultrasound image sequences. In the conventional block motion estimation method, the centers of motion estimation blocks are set at the predetermined and equally spaced locations. This requires the large blocks to include at least one feature, which inevitably requires long estimation time. In this paper, we propose an adaptive method which locates the center of the motion estimation blocks at the feature points. This make it possible to reduce the block size while keeping the motion estimation accuracy The Harris-Stephen corner detector is used to get the feature points. The comer points tend to group together, which cause the error in the global motion estimation. In order to distribute the feature points as evenly as Possible, the image is firstly divided into regular subregions, and a strongest corner point is selected as a feature in each subregion. The ultrasound Images contain speckle patterns and noise. In order to reduce the noise artifact and reduce the computational time, the proposed method use the multi-resolution image sequences. The first algorithm estimates the motion in the smoothed low resolution image, and the estimated motion is prolongated to the next higher resolution image. By this way the size of search region can be reduced in the higher resolution image. Experiments were performed on three types of ultrasound image sequences. These were shown that the proposed method reduces both the computational time (from 77ms to 44ms) and the displaced frame difference (from 66.02 to 58.08).

• Proceedings of the KSLP Conference
• /
• 2003.11a
• /
• pp.190-192
• /
• 2003

음성은 단순히 성대에서 만들어지는 것이 아니다. 호흡을 시작으로 성대의 접촉과 점막 진동에 의해 만들어진 소리가 공명강을 거쳐 입술, 혀의 움직임을 거쳐 최종적으로 의미를 전달하는 소리로 완성된다. 기능성 음성 질환은 이러한 과정 중에서 발성 방법과 같은 기능적 문제에 의하여 발생하게 된다. 따라서 기능성 음성 질환이 있을 때 이러한 과정의 움직임에 대한 조사가 필요하다. (중략)

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.355-355
• /
• 2004

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.889-897
• /
• 2005

This paper presents a new fast motion estimation algorithm for multi-reference frames. We first analyze the experimental results of the successive elimination algorithm, which is a fast version of full search algorithm, being applied to Multi-reference frames. Based on the analysis, a new scheme for alleviating its computational burden is introduced. In the proposed method, the motion vector for the immediately previous reference frame is found by applying the successive elimination algorithm, while the motion vector for other reference frames is estimated by extrapolation of the already obtained motion vector. Adaptively restricting the motion search area to the local area centered on the estimated motion vector, the proposed method provides dramatic computational complexity reduction but slight quality degradation. The proposed method is evaluated by experiments for some image sequences.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.127-135
• /
• 2010

In motion adaptive temporal noise reduction filtering used for reducing video noises, the strength of motion adaptive temporal filtering should be carefully controlled according to temporal movement. This paper presents a motion adaptive temporal filtering scheme based on least-square training. Each pixel is classified to a specific class code according to temporal movement, and then, an iterative least-square training method is applied for each class code to find optimal filtering coefficients. The iterative least-square training is an off-line procedure, and the trained filter coefficients are stored in a lookup table (LUT). In actual noise reduction filtering operation, after each pixel is classified by temporal movement, simple filtering operation is applied with the filter coefficients stored in the LUT according to the class code. Experiment results show that the proposed method efficiently reduces video noises without introducing blurring.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.917-924
• /
• 2008

Motion estimation and compensation in the spatial domain check the searching area of specified size in the previous frame and search block to minimize the difference with current block. When we check the searching area, it consumes the most encoding times due to increasing the complexity. We can solve this fault by means of motion estimation using shifting matrix in the transform domain instead of the spatial domain. We derive so the existed shifting matrix to a new recursion equation that we decrease more computations. We modify simply vertical shifting matrix and horizontal shifting matrix in the transform domain for motion estimation of half-pixel accuracy. So, we solve increasing computation due to bilinear interpolation in the spatial domain. Simulation results prove that motion estimation by the proposed algorithm in DCT-based transform domain provides higher PSNR using fewer bits than results in the spatial domain.