A new block-matching algorithm based on subspace and partial distance search techniques in the wavelet domain

Wen-Jyi Hwang, Chun Ming Chang, Yi Chong Zeng

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, a new fast block-matching algorithm for video coding is presented. In the algorithm, the partial distance search (PDS) technique is performed in the wavelet domain to eliminate the undesired blocks. Since the energy of blocks is concentrated in few coefficients in the wavelet domain, by starting the PDS at these coefficients, the algorithm can significantly reduce computational time for block matching. The PDS can be performed over the subspace in the wavelet domain to further lower the computational time at the expense of possible slight degradation in performance. In addition, the simple Haar wavelet can be used to remove the need for multiplication for blocking matching. Simulation results show that our algorithm is very effective for video coding where real-time processing is required.

Original languageEnglish
Pages (from-to)353-359
Number of pages7
JournalIEEE Transactions on Consumer Electronics
Volume44
Issue number2
DOIs
Publication statusPublished - 1998 Dec 1

Fingerprint

Image coding
Degradation
Processing

ASJC Scopus subject areas

  • Media Technology
  • Electrical and Electronic Engineering

Cite this

A new block-matching algorithm based on subspace and partial distance search techniques in the wavelet domain. / Hwang, Wen-Jyi; Chang, Chun Ming; Zeng, Yi Chong.

In: IEEE Transactions on Consumer Electronics, Vol. 44, No. 2, 01.12.1998, p. 353-359.

Research output: Contribution to journalArticle

@article{343ac15b9a00469abeb3b2ec1edfaffc,
title = "A new block-matching algorithm based on subspace and partial distance search techniques in the wavelet domain",
abstract = "In this paper, a new fast block-matching algorithm for video coding is presented. In the algorithm, the partial distance search (PDS) technique is performed in the wavelet domain to eliminate the undesired blocks. Since the energy of blocks is concentrated in few coefficients in the wavelet domain, by starting the PDS at these coefficients, the algorithm can significantly reduce computational time for block matching. The PDS can be performed over the subspace in the wavelet domain to further lower the computational time at the expense of possible slight degradation in performance. In addition, the simple Haar wavelet can be used to remove the need for multiplication for blocking matching. Simulation results show that our algorithm is very effective for video coding where real-time processing is required.",
author = "Wen-Jyi Hwang and Chang, {Chun Ming} and Zeng, {Yi Chong}",
year = "1998",
month = "12",
day = "1",
doi = "10.1109/30.681950",
language = "English",
volume = "44",
pages = "353--359",
journal = "IEEE Transactions on Consumer Electronics",
issn = "0098-3063",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - A new block-matching algorithm based on subspace and partial distance search techniques in the wavelet domain

AU - Hwang, Wen-Jyi

AU - Chang, Chun Ming

AU - Zeng, Yi Chong

PY - 1998/12/1

Y1 - 1998/12/1

N2 - In this paper, a new fast block-matching algorithm for video coding is presented. In the algorithm, the partial distance search (PDS) technique is performed in the wavelet domain to eliminate the undesired blocks. Since the energy of blocks is concentrated in few coefficients in the wavelet domain, by starting the PDS at these coefficients, the algorithm can significantly reduce computational time for block matching. The PDS can be performed over the subspace in the wavelet domain to further lower the computational time at the expense of possible slight degradation in performance. In addition, the simple Haar wavelet can be used to remove the need for multiplication for blocking matching. Simulation results show that our algorithm is very effective for video coding where real-time processing is required.

AB - In this paper, a new fast block-matching algorithm for video coding is presented. In the algorithm, the partial distance search (PDS) technique is performed in the wavelet domain to eliminate the undesired blocks. Since the energy of blocks is concentrated in few coefficients in the wavelet domain, by starting the PDS at these coefficients, the algorithm can significantly reduce computational time for block matching. The PDS can be performed over the subspace in the wavelet domain to further lower the computational time at the expense of possible slight degradation in performance. In addition, the simple Haar wavelet can be used to remove the need for multiplication for blocking matching. Simulation results show that our algorithm is very effective for video coding where real-time processing is required.

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

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

U2 - 10.1109/30.681950

DO - 10.1109/30.681950

M3 - Article

VL - 44

SP - 353

EP - 359

JO - IEEE Transactions on Consumer Electronics

JF - IEEE Transactions on Consumer Electronics

SN - 0098-3063

IS - 2

ER -