Optimal binary encoding scheme for the fast motion estimation based on Hamming distances

スポンサーリンク

概要

• 論文の詳細を見る

• Optimal binary codes for pixel values are designed for accurate block matching in the fast motion estimation. The conventional binary block matching techniques reduce the computational complexity and the memory bandwidth for the motion estimation, but they degrade the matching accuracy. We find the optimal mapping function between the set of decimal numbers for uniformly quantized pixel values and the set of binary codes, so that the weighted sum of mean squared errors between the absolute differences and the Hamming distances is minimized. Experimental results show that the proposed three-bit binary code set yields about 0.4dB gain over the conventional techniques.

著者

• Kim Chang-su

  School Of Electrical Engineering Korea University

• Sim Jae-young

  School Of Electrical And Computer Engineering Ulsan National Institute Of Science And Technology (unist)

• KIM Chang-Su

  School of Electrical Engineering, Korea University

• Lee Sang-Uk

  School of Electrical Engineering, ASRI and INMC, Seoul National University

• Park Sang-Uk

  School of Electrical Engineering, ASRI and INMC, Seoul National University

関連論文

• Progressive Coding of Binary Voxel Models Based on Pattern Code Representation(Digital Signal Processing)
• Reconstruction Depth Adaptive Coding of Digital Holograms
• Optimal binary encoding scheme for the fast motion estimation based on Hamming distances

スポンサーリンク