• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.560-565
• /
• 2007

본 논문에서는 H.264 동영상 표준의 가변 움직임 블록을 위한 고속 움직임 예측 기법을 제안한다. 움직임 예측은 H.264의 비디오 코딩 과정에서 가장 많은 연산량을 차지하는 중요한 처리과정이다. 움직임 예측과정에서 정수배 화소 단위에서의 탐색에 비하여, 부화소 단위까지의 움직임 추정은 실제 움직임 벡터를 찾아낼 수 있지만, 이를 구하기 위한 계산량이 늘어나는 문제가 있다. 본 논문에서는 기준점을 기준으로 기준점으로부터 $\pm1$ 화소 내에서 두 번째로 작은 오차 값이 있는 특성 및 부화소 단위의 화소 보간 특성을 이용하여 움직임 추정 과정에서 탐색점을 줄임으로써 연산 처리 속도를 증가시키고, 계산의 복잡도를 줄이는 알고리즘을 제안하였다. 제안한 방법에서는 정수 화소 단위에서의 가장 작은 SATD를 갖는 점과 참조 영상으로부터 추출한 PMV를 비교하여 기준점을 정한 후, 기준점 주위의 8개의 화소 위치 가운데 두 번째로 SATD값이 작은 점을 찾아 해당 방향으로 1/2 화소 단위의 움직임 추정을 수행하였고, 1/4 화소 단위에서도 1/2 화소단위에서 두 번째로 SATD가 작은 점 방향으로 움직임 추정을 실행하였다. 그 결과 기존의 JM에서 사용한 고속 움직임 예측 알고리즘에 비해 PSNR값에 큰 변화가 없고, 움직임 벡터 예측 시간 면에서 약 18%의 시간을 줄이는 결과를 보였다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.1
• /
• pp.1-10
• /
• 2006

To reduce the complexity of video transcoder, transcoding techniques generally use intermediate data such as macroblock types, motion vectors, DCT coefficients, which are extracted from incoming video bitstream. In this Paper, we Propose a new adaptive INTRA update scheme utilizing the importance of each macroblock in a given frame. The importance measure is calculated from the motion vectors which are extracted from the decoding procedure of a incomming video data.'rho ratio of the macroblock to be referred by the next frame is calculated by the motion vectors of the next frame and the macroblocks to be refered higher ratio has more effect on the next frame and the followed frames. The proposed scheme can obtain transcoded bitstreams which has better image quality and more improved resilience against transmission errors.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1694-1701
• /
• 2013

Distributed video coding technique(DVC) is needed for several applications with low bit rate or low encoding resources. However, since conventional DVC schemes have performance limitations and so as one of the several methods to overcome this problem and to improve the coding efficiency, DVC scheme with the moving information of side information has been developed. Based on this system, in this paper, an efficient reliability estimation is introduced to evaluate the blocks composing of side information and send these blocks location to the encoder side. Then, these enable the encoder to selectively encode and to improve the coding performance. Experimental results show that the proposed scheme performs better than the conventional coding scheme.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.3
• /
• pp.126-133
• /
• 2003

This paper is related to a morphological segmentation method for extracting the moving object in video sequence using global motion compensation and two-dimensional spatio-temporal entropic thresholding. First, global motion compensation is performed with camera panning vector estimated in the hierarchical pyramid structure constructed by wavelet transform. Secondly, the regions with high possibility to include the moving object between two consecutive frames are extracted block by block from the global motion compensated image using two-dimensional spatio-temporal entropic thresholding. Afterwards, the LUT classifying each block into one among changed block, uncertain block, stationary block according to the results classified by two-dimensional spatio-temporal entropic thresholding is made out. Next, by adaptively selecting the initial search layer and the search range referring to the LUT, the proposed HBMA can effectively carry out fast motion estimation and extract object-included region in the hierarchical pyramid structure. Finally, after we define the thresholded gradient image in the object-included region, and apply the morphological segmentation method to the object-included region pixel by pixel and extract the moving object included in video sequence. As shown in the results of computer simulation, the proposed method provides relatively good segmentation results for moving object and specially comes up with reasonable segmentation results in the edge areas with lower contrast.

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

최근 3D 콘텐츠의 관심 증가는 Display 장치, 모바일 기기 등의 하드웨어적인 발전을 가져왔고, 이에 따른 입체 콘텐츠의 필요성이 대두되고 있다. 또한 단순히 영상을 비 실시간으로 처리하여 입체로 변환하는 것 외에, 방송이나 모니터 자체에서의 입체변환에 대한 기술은 3D콘텐츠 산업에서 또 다른 이슈로 부각되고 있다. 본 논문에서는 깊이 필터와 움직임 예측을 이용한 깊이맵 생성 기법을 제안한다. 영상에서 Y 버퍼를 추출하고, 이에 깊이 필터를 적용시킨 후 블록단위 움직임 예측을 적용한다. 이렇게 구해진 움직임 벡터에 노이즈 제거 등을 통하여 물체의 영역을 추출한 후, 최종적으로 깊이맵을 생성한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.5 s.311
• /
• pp.72-78
• /
• 2006

In this paper, we present a video shot retrieval algorithm in H.264/AVC compression domain. Unlike previous standards such as MPEG-2 and 4, H.264/AVC supports a variable block size for motion compensation. Therefore, existing video retrieval algorithms exploiting the motion vectors in MPEG-2 and 4 domains are not appropriate for H.264/AVC. So, we devise a method to project motion vectors with larger than $4{\times}4$ block sizes into those for the smallest $4{\times}4$ blocks. It also uses correlations among features for the measure of similarity. Experimental results with standard videos of 10558 frames and commercial videos of 48161 frames show that the proposed method yields ANMRR less than 0.2.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.681-684
• /
• 1998

본 논문에서는 객체기반의 스테레오 동영상 부호화기를 제안한다. 제안된 부호화기는 움직임, 변이, 그리교 밝기 정보를 이용하여 객체를 추출하고 객체의 움직임과 변이 정보를 예측하여 부호화함으로써 기존의 블록기반 방법에 비해 정보량을 줄일 수 있었다. 또한 새롭게 발생되는 영역과 기존 영역의 소멸 및 변형은 부호화 효율을 떨어뜨리게 되는데, 이를 해결하기 위해 새로운 객체갱신 방법이 제안되었다. 실험을 통하여 제안된 객체기반 부호화기는 기존의 블록기반 부호화기에서 나타나는 블록화 및 모스키토 현상을 제거할 수 있었고 복원화질과 부호호율을 개선시킬 수 있었다.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1189-1199
• /
• 2003

This paper presents a new method for the motion detection of vehicles using hierarchical motion estimation and parallel processing. It captures the road image by using a CMOS sensor. It divides the captured image into small blocks and detects the motion of each block by using a block-matching method which is based on a hierarchical motion estimation and parallel processing for the real-time processing. The parallelism is achieved by using tile pipeline and the data flow technique. The proposed method has been implemented by using an embedded system. The proposed block matching algorithm has been implemented on PLDs(Programmable Logic Device) and clustering algorithm has been implemented by ARM processor. Experimental results show that the proposed system detects the motion of vehicles in real-time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.683-691
• /
• 2004

To transmit MPEG-2 video on an errorneous channel, a number of error control techniques are needed. Especially, error concealment techniques which can be implemented on receivers independent of transmitters are essential to obtain good video quality. In this paper, prediction of motion vector and an adaptive boundary matching algorithm are presented for temporal error concealment. Before the complex BMA, we perform error concealment by a motion vector prediction using neighboring motion vectors. If the candidate of error concealment is not satisfied, search range and reliable boundary pixels are selected by the temporal activity or motion vectors and a damaged macroblock is concealed by applying an adaptive BMA. This error concealment technique reduces the complexity and maintains a PSNR gain of 0.3∼0.7㏈ compared to conventional BMA.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.1043-1052
• /
• 2003

In this paper, we present a fast motion estimation algorithm to reduce the computations of block matching algorithm for motion estimation in video coding. The proposed algorithm is based on Multi-level Successive Elimination Algorithm and Efficient Multi-level Successive Elimination Algorithms. The best estimate of the motion vectors can be obtained by hierarchical search point sampling and thus the proposed algorithm can decrease the number of matching evaluations that require very intensive computations. The efficiency of the proposed algorithm was verified by experimental results.