Successive accumulating partial distortion search algorithm for motion estimation

Chia Hung Yeh; Ming Te Wu; Shiunn Jang Chern

Successive accumulating partial distortion search algorithm for motion estimation

Chia Hung Yeh, Ming Te Wu^*, Shiunn Jang Chern

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

This work presents a modified partial distortion search algorithm that considers the property of successive accumulation for motion estimation. In the normalized partial distortion search algorithm, the partial distortion is calculated, by regularly selecting a, certain number of pixels from, every sub-macroblock for early termination. The proposed, method calculates the partial distortion by successively accumulating the distortion of each partial sub-macroblock. In addition to increasing the probability of the rejection of invalid, motion vectors without additional computations, the proposed, method has a, markedly lower computational complexity than conventional algorithms, but slightly poorer objective quality of motion compensated, images. ICIC International

Original language	English
Pages (from-to)	2331-2340
Number of pages	10
Journal	International Journal of Innovative Computing, Information and Control
Volume	6
Issue number	5
Publication status	Published - 2010 May
Externally published	Yes

Keywords

Block-matching distortion
Motion estimation
Normalized partial distortion search
Sub-macroblock partial distortion
Sum of absolution difference

ASJC Scopus subject areas

Software
Theoretical Computer Science
Information Systems
Computational Theory and Mathematics

Cite this

@article{f82eda17340e4df09dbe74a08a9fcf9b,

title = "Successive accumulating partial distortion search algorithm for motion estimation",

abstract = "This work presents a modified partial distortion search algorithm that considers the property of successive accumulation for motion estimation. In the normalized partial distortion search algorithm, the partial distortion is calculated, by regularly selecting a, certain number of pixels from, every sub-macroblock for early termination. The proposed, method calculates the partial distortion by successively accumulating the distortion of each partial sub-macroblock. In addition to increasing the probability of the rejection of invalid, motion vectors without additional computations, the proposed, method has a, markedly lower computational complexity than conventional algorithms, but slightly poorer objective quality of motion compensated, images. ICIC International",

keywords = "Block-matching distortion, Motion estimation, Normalized partial distortion search, Sub-macroblock partial distortion, Sum of absolution difference",

author = "Yeh, {Chia Hung} and Wu, {Ming Te} and Chern, {Shiunn Jang}",

year = "2010",

month = may,

language = "English",

volume = "6",

pages = "2331--2340",

journal = "International Journal of Innovative Computing, Information and Control",

issn = "1349-4198",

publisher = "IJICIC Editorial Office",

number = "5",

}

TY - JOUR

T1 - Successive accumulating partial distortion search algorithm for motion estimation

AU - Yeh, Chia Hung

AU - Wu, Ming Te

AU - Chern, Shiunn Jang

PY - 2010/5

Y1 - 2010/5

N2 - This work presents a modified partial distortion search algorithm that considers the property of successive accumulation for motion estimation. In the normalized partial distortion search algorithm, the partial distortion is calculated, by regularly selecting a, certain number of pixels from, every sub-macroblock for early termination. The proposed, method calculates the partial distortion by successively accumulating the distortion of each partial sub-macroblock. In addition to increasing the probability of the rejection of invalid, motion vectors without additional computations, the proposed, method has a, markedly lower computational complexity than conventional algorithms, but slightly poorer objective quality of motion compensated, images. ICIC International

AB - This work presents a modified partial distortion search algorithm that considers the property of successive accumulation for motion estimation. In the normalized partial distortion search algorithm, the partial distortion is calculated, by regularly selecting a, certain number of pixels from, every sub-macroblock for early termination. The proposed, method calculates the partial distortion by successively accumulating the distortion of each partial sub-macroblock. In addition to increasing the probability of the rejection of invalid, motion vectors without additional computations, the proposed, method has a, markedly lower computational complexity than conventional algorithms, but slightly poorer objective quality of motion compensated, images. ICIC International

KW - Block-matching distortion

KW - Motion estimation

KW - Normalized partial distortion search

KW - Sub-macroblock partial distortion

KW - Sum of absolution difference

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

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

M3 - Article

AN - SCOPUS:77952976825

SN - 1349-4198

VL - 6

SP - 2331

EP - 2340

JO - International Journal of Innovative Computing, Information and Control

JF - International Journal of Innovative Computing, Information and Control

IS - 5

ER -

Successive accumulating partial distortion search algorithm for motion estimation

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this