Full Search Based Fast Block Matching Algorithm with Efficient Matching Order in Motion Estimation

スポンサーリンク

概要

• 論文の詳細を見る

• In this letter we propose a now fast matching algorithm that has no degradation of predicted images such as found in the conventional full search (FS) algorithm, so as to reduce the amount of compntation of the FS algorithm for motion estimation in real-time video coding applications. That is, our proposing algorithm reduces only unnecessary computations in the process of motion estimation without decreasing the prediction quality compared to the conventional FS algorithm. The computational reduction comes from rapid elimination of impossible motion vectors. In comparison to the FS algorithm, we obtained faster elimination of inappropriate candidate motion vectors using efficient matching units based on image complexity. Experimentally, we demonstrated that the unnecessary computations were removed by about 30% as compared to the other fast FS algorithms.

• 社団法人電子情報通信学会の論文
• 2003-03-01

著者

• Kim Jong-nam

  Technical Research Institute Of Kbs

• Ahn Byungha

  Department Of Mechatronics Gwangju Institute Of Science And Technology (gist)

• Ahn Byungha

  Department Of Mechatronics K-jist

• BYUN SeongChul

  Department of Mechatronics,K-JIST

• Byun Seongchul

  Department Of Mechatronics K-jist

関連論文

• Cellular Watersheds : A Parallel Implementation of the Watershed Transform on the CNN Universal Machine(Image Processing and Video Processing)
• A Novel Test-Bed for Immersive and Interactive Broadcasting Production Using Augmented Reality and Haptics(Artificial Reality and Telexistence)
• A Reliable New 2-Stage Distributed Interactive TGS System Based on GIS Database and Augmented Reality(Artificial Reality and Telexistence)
• A Fast Full Search Motion Estimation Algorithm Using Sequential Rejection of Candidates from Multilevel Decision Boundary
• Full Search Based Fast Block Matching Algorithm with Efficient Matching Order in Motion Estimation

スポンサーリンク