Optimal binary encoding scheme for the fast motion estimation based on Hamming distances
Cited 0 times inCited 0 times in
- 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
- Absolute difference; Block Matching; Conventional techniques; Fast motion estimation; Mean squared error; Memory bandwidths; Optimal binary codes; Video encodings
- Issue Date
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- IEICE Electronics Express, v.10, no.10, pp.1 - 6
- 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.
- ; Go to Link
- Appears in Collections:
- ECE_Journal Papers
- Files in This Item:
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.