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

Sang Uk Park, Jae Young Sim, Chang-Su Kim, Sang Uk Lee

Research output: Contribution to journalArticle

Abstract

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.4 dB gain over the conventional techniques.

Original languageEnglish
JournalIEICE Electronics Express
Volume10
Issue number10
DOIs
Publication statusPublished - 2013 Jun 4

Fingerprint

binary codes
Hamming distance
Binary codes
Motion estimation
coding
Pixels
pixels
Computational complexity
bandwidth
Bandwidth
Data storage equipment

Keywords

  • Binary block matching
  • Fast motion estimation
  • Optimal binary codes
  • Video encoding

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Electrical and Electronic Engineering

Cite this

Optimal binary encoding scheme for the fast motion estimation based on Hamming distances. / Park, Sang Uk; Sim, Jae Young; Kim, Chang-Su; Lee, Sang Uk.

In: IEICE Electronics Express, Vol. 10, No. 10, 04.06.2013.

Research output: Contribution to journalArticle

@article{6d712b54995d4a5d9525b3024982f9d3,
title = "Optimal binary encoding scheme for the fast motion estimation based on Hamming distances",
abstract = "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.4 dB gain over the conventional techniques.",
keywords = "Binary block matching, Fast motion estimation, Optimal binary codes, Video encoding",
author = "Park, {Sang Uk} and Sim, {Jae Young} and Chang-Su Kim and Lee, {Sang Uk}",
year = "2013",
month = "6",
day = "4",
doi = "10.1587/elex.10.20130160",
language = "English",
volume = "10",
journal = "IEICE Electronics Express",
issn = "1349-2543",
publisher = "The Institute of Electronics, Information and Communication Engineers (IEICE)",
number = "10",

}

TY - JOUR

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

AU - Park, Sang Uk

AU - Sim, Jae Young

AU - Kim, Chang-Su

AU - Lee, Sang Uk

PY - 2013/6/4

Y1 - 2013/6/4

N2 - 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.4 dB gain over the conventional techniques.

AB - 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.4 dB gain over the conventional techniques.

KW - Binary block matching

KW - Fast motion estimation

KW - Optimal binary codes

KW - Video encoding

UR - http://www.scopus.com/inward/record.url?scp=84878377274&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878377274&partnerID=8YFLogxK

U2 - 10.1587/elex.10.20130160

DO - 10.1587/elex.10.20130160

M3 - Article

VL - 10

JO - IEICE Electronics Express

JF - IEICE Electronics Express

SN - 1349-2543

IS - 10

ER -