Fast full-search block-matching algorithm for motion-compensated video compression

Yih Chuan Lin, Shen-Chuan Tai

Research output: Contribution to journalArticle

85 Citations (Scopus)

Abstract

-This paper proposes a fast block-matching algorithm that uses three fast matching error measures, besides the conventional mean-absolute error (MAE) or mean-square error (MSE). An incoming reference block in the current frame is compared to candidate blocks within the search window using multiple matching criteria. These three fast matching error measures are established on the integral projections, having the advantages of being good block features and having simple complexity in measuring matching errors. Most of the candidate blocks can be rejected only by calculating one or more of the three fast matching error measures. The time-consuming computations of MSE or MAE are performed on only a few candidate blocks that first pass all three fast matching criteria. Simulation results show that a reduction of over 86% in computations is achieved after integrating the three fast matching criteria into the full-search algorithm, while ensuring optimal accuracy. )

Original languageEnglish
Pages (from-to)527-531
Number of pages5
JournalIEEE Transactions on Communications
Volume45
Issue number5
DOIs
Publication statusPublished - 1997 Dec 1

Fingerprint

Image compression
Mean square error

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{2ac7eba5535f426791ae0fe1ab0081d4,
title = "Fast full-search block-matching algorithm for motion-compensated video compression",
abstract = "-This paper proposes a fast block-matching algorithm that uses three fast matching error measures, besides the conventional mean-absolute error (MAE) or mean-square error (MSE). An incoming reference block in the current frame is compared to candidate blocks within the search window using multiple matching criteria. These three fast matching error measures are established on the integral projections, having the advantages of being good block features and having simple complexity in measuring matching errors. Most of the candidate blocks can be rejected only by calculating one or more of the three fast matching error measures. The time-consuming computations of MSE or MAE are performed on only a few candidate blocks that first pass all three fast matching criteria. Simulation results show that a reduction of over 86{\%} in computations is achieved after integrating the three fast matching criteria into the full-search algorithm, while ensuring optimal accuracy. )",
author = "Lin, {Yih Chuan} and Shen-Chuan Tai",
year = "1997",
month = "12",
day = "1",
doi = "10.1109/26.592551",
language = "English",
volume = "45",
pages = "527--531",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

Fast full-search block-matching algorithm for motion-compensated video compression. / Lin, Yih Chuan; Tai, Shen-Chuan.

In: IEEE Transactions on Communications, Vol. 45, No. 5, 01.12.1997, p. 527-531.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Fast full-search block-matching algorithm for motion-compensated video compression

AU - Lin, Yih Chuan

AU - Tai, Shen-Chuan

PY - 1997/12/1

Y1 - 1997/12/1

N2 - -This paper proposes a fast block-matching algorithm that uses three fast matching error measures, besides the conventional mean-absolute error (MAE) or mean-square error (MSE). An incoming reference block in the current frame is compared to candidate blocks within the search window using multiple matching criteria. These three fast matching error measures are established on the integral projections, having the advantages of being good block features and having simple complexity in measuring matching errors. Most of the candidate blocks can be rejected only by calculating one or more of the three fast matching error measures. The time-consuming computations of MSE or MAE are performed on only a few candidate blocks that first pass all three fast matching criteria. Simulation results show that a reduction of over 86% in computations is achieved after integrating the three fast matching criteria into the full-search algorithm, while ensuring optimal accuracy. )

AB - -This paper proposes a fast block-matching algorithm that uses three fast matching error measures, besides the conventional mean-absolute error (MAE) or mean-square error (MSE). An incoming reference block in the current frame is compared to candidate blocks within the search window using multiple matching criteria. These three fast matching error measures are established on the integral projections, having the advantages of being good block features and having simple complexity in measuring matching errors. Most of the candidate blocks can be rejected only by calculating one or more of the three fast matching error measures. The time-consuming computations of MSE or MAE are performed on only a few candidate blocks that first pass all three fast matching criteria. Simulation results show that a reduction of over 86% in computations is achieved after integrating the three fast matching criteria into the full-search algorithm, while ensuring optimal accuracy. )

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

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

U2 - 10.1109/26.592551

DO - 10.1109/26.592551

M3 - Article

VL - 45

SP - 527

EP - 531

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 5

ER -