• Journal of Broadcast Engineering
• /
• v.8 no.3
• /
• pp.297-305
• /
• 2003

In this paper, we propose a wavelet based fast motion estimation algorithm for video sequence encoding with very low bit-rate. By using one of properties oi wavelet transform, multi-resolution analysis(MRA) property and spatial Interpolation of an image, we are able to reduce both prediction error and computational complexity at the same time. Especially, by defining a significant block(SB) based on the differential information of wavelet coefficients between successive frames, the proposed algorithm makes up a defect of multi-resolution motion estimation(MRME) algorithm of increasing the number of motion vectors. As experimental results. we can reduce the computational load up to 70% but also improve PSNR up to about 0.1 ∼ 1.2 dB comparing with the MRME algorithm.

• Journal of Broadcast Engineering
• /
• v.7 no.3
• /
• pp.238-247
• /
• 2002

In this paper, we propose an object-based stereo sequence compression technique using disparity-motion vector relationship. The proposed method uses the coherence of motion vectors and disparity vectors in the left and right Image sequences. After two motion vectors and one disparity vector ate computed using FBMA(Fixed Block Matching Algorithm), the disparity vector of the current stereoscopic pall is computed by disparity-motion vector relationship with vectors which are previously estimated. Moreover, a vector regularization technique is applied in order to obtain reliable vectors. For an object-based coding. the object is defined and coded in terms of layers of VOP such as in MPEG-4. we present a method using disparity and motion vector relationship for extending two-frame compensation into three-frame compensation method for prediction coding of B-VOP. The proposed algorithm shows a high performance when comparing with a conventional method.

• Journal of Conservation Science
• /
• v.16 s.16
• /
• pp.15-20
• /
• 2004

Two pieces of choson-Tongue(朝鮮通寶) minted at 1423 A.D. were analyzed by atomic absorption spectroscopy and neutron activation analysis. The measurement of lead isotope ratios was also carried out in order to predict the provenance of raw materials used for minting. The Chosen-Tongue was minted as bronze having the chemical compositions of $Cu\;90\%,\;Pb\;3\~4\%,\;Sn\;2\~3\%$, which were different from the typical composition of Chinese and Japanese coins. The results of lead isotope ratios showed that the provenance of raw materials used for minting had a possibility to be originated from South China. And application of statistical linear discriminant analysis (SLDA) to the provenance of lead used for minting of Chosen-Tongue was confirmed.

• 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 기반의 부호기에 비해 에러 환경에서 주관적 및 객관적 화질 측면에서 성능이 우수함을 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6C
• /
• pp.579-584
• /
• 2007

Recently various prediction structures have been proposed to exploit inter-view correlation among multi-view video sequences. In this paper, we propose a QP(quantization parameter) selection method for the B frame inserted in the first frames of each GOP(group of pictures), where we change QP for the B frame adaptively to achieve uniform picture quality and overall coding gain. Each B frame is coded with reference to two frames in its adjacent views. We calculate QP for the B frame based on the correlation between the two reference frames, calculated using their rate-distortion costs. By applying the proposed method to the MVC reference prediction structure, we have improved the coding gain by 0.09$\sim$0.16 dB.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.6
• /
• pp.36-42
• /
• 2007

According to the increased demand of high quality multimedia content, it needs to recover an old movies. But the film of old movie is damaged with line scratches and dust. In this paper, the detection and restoration algorithm of B/W line scratch is proposed. Our scheme estimates and interpolates the damaged partial information of line scratch using the linear recursive curve trace which consider the intensity values of left and right region of line scratch and then median filtering processed. As a result, the film image PSNR 44.68 with B/W line scratch is increased up to 48.60 and the intensity of the interpolate pixel is approached about 14 against the pixel of original image.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.12
• /
• pp.77-83
• /
• 1998

Generally a moving picture suffers from motion blur, due to relative motion between moving objects and the image formation system. The purpose of this paper is to propose teh model for the motion blur and the restoration method using the regularized iterative technique. In the proposed model, the boundary effect between moving objects and background is analyzed mathematically to overcome the limit of the spatially invariant model. And we present the motion-based image segmentation technique for the object-based image restoration, which is the modified version of the conventional segmentation method. Based on the proposed model, the restoration technique removes the motion blur by using the estimated motion parameter from the result of the segmentation.

• The Journal of the Korea Contents Association
• /
• v.16 no.7
• /
• pp.431-438
• /
• 2016

In this paper, we present an upsampling technique for depth map image using color and depth weights. First, we construct a high-resolution image using the bilinear interpolation technique. Next, we detect a common edge region using RGB color space, HSV color space, and depth image. If an interpolated pixel belongs to the common edge region, we calculate weighting values of color and depth in $3{\times}3$ neighboring pixels and compute the cost value to determine the boundary pixel value. Finally, the pixel value having minimum cost is determined as the pixel value of the high-resolution depth image. Simulation results show that the proposed algorithm achieves good performance in terns of PSNR comparison and subjective visual quality.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.956-962
• /
• 2005

To improve video quality and coding efficiency, H.264/AVC adopts different half pixel calculating method compared with the previous standards. So, the transcoder requires additional works to transcode the pre-coded video contents with the previous standards to H.264/AVC in DCT domain. In this paper, we propose the first half-pixel correction method for MPEG-2 to H.264 transcoding in DCT domain. In the proposed method, MPEG-2 block is added to the correction block obtained by difference calculation of half-pixel values between two standards using DCT reference frame. Experimental results show that the proposed achieves better quality than pixel based cascaded transcoding method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.602-608
• /
• 2003

In this paper, we propose an efficient DCT calculation method for fast video encoding. We show that the SAD obtained in the motion estimation and compensation process is decomposed into the positive and negative terms. Based on a theoretical analysis, it is shown that the DCT calculation is classified into 4 cases - DCT Skip, Reduced_DCT1 , Reduced_DCT2, and original DCT- according to the positive and negative terms. In the proposed algorithm, one of 4 cases is used for DCT in order to reduce the computational complexity. The simulation results show that the proposed algorithm achieves computational saving approximately 25.2% without image degradation and computational overhead.