A hierarchical fast encoding algorithm for vector quantization with PSNR equivalent to full search

Zhibin Pan; Koji Kotani; Tadahiro Ohmi

A hierarchical fast encoding algorithm for vector quantization with PSNR equivalent to full search

Zhibin Pan, Koji Kotani, Tadahiro Ohmi

ENG - Electronic Engineering

Research output: Contribution to journal › Conference article › peer-review

26 Citations (Scopus)

Abstract

In order to encode an image using VQ fast, it is most important to eliminate unnecessary distance computation as much as possible while searching for winner code. Sum and partial sum are used as features in this paper to roughly measure the difference between an input image block and a code to check whether current code could be a promising candidate winner code or not. A 3-step hierarchical fast search algorithm is proposed by narrowing search scope, skipping redundant distance computation and lastly simplifying must-do distance computation. For 10 standard gray-level images of size 512×512 with very different details, computational complexity can be reduced to below 5% ultimately for codebook of size 1024 or 2048 meanwhile keeping the PSNR not degraded as that of full search.

Original language	English
Pages (from-to)	I/797-I/800
Journal	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	1
Publication status	Published - 2002 Jan 1
Event	2002 IEEE International Symposium on Circuits and Systems - Phoenix, AZ, United States Duration: 2002 May 26 → 2002 May 29

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

Fingerprint Dive into the research topics of 'A hierarchical fast encoding algorithm for vector quantization with PSNR equivalent to full search'. Together they form a unique fingerprint.

Cite this

@article{1d66acbdb94b4112a30e40aa52d644fa,

title = "A hierarchical fast encoding algorithm for vector quantization with PSNR equivalent to full search",

abstract = "In order to encode an image using VQ fast, it is most important to eliminate unnecessary distance computation as much as possible while searching for winner code. Sum and partial sum are used as features in this paper to roughly measure the difference between an input image block and a code to check whether current code could be a promising candidate winner code or not. A 3-step hierarchical fast search algorithm is proposed by narrowing search scope, skipping redundant distance computation and lastly simplifying must-do distance computation. For 10 standard gray-level images of size 512×512 with very different details, computational complexity can be reduced to below 5% ultimately for codebook of size 1024 or 2048 meanwhile keeping the PSNR not degraded as that of full search.",

author = "Zhibin Pan and Koji Kotani and Tadahiro Ohmi",

year = "2002",

month = jan,

day = "1",

language = "English",

volume = "1",

pages = "I/797--I/800",

journal = "Proceedings - IEEE International Symposium on Circuits and Systems",

issn = "0271-4310",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2002 IEEE International Symposium on Circuits and Systems ; Conference date: 26-05-2002 Through 29-05-2002",

}

TY - JOUR

T1 - A hierarchical fast encoding algorithm for vector quantization with PSNR equivalent to full search

AU - Pan, Zhibin

AU - Kotani, Koji

AU - Ohmi, Tadahiro

PY - 2002/1/1

Y1 - 2002/1/1

N2 - In order to encode an image using VQ fast, it is most important to eliminate unnecessary distance computation as much as possible while searching for winner code. Sum and partial sum are used as features in this paper to roughly measure the difference between an input image block and a code to check whether current code could be a promising candidate winner code or not. A 3-step hierarchical fast search algorithm is proposed by narrowing search scope, skipping redundant distance computation and lastly simplifying must-do distance computation. For 10 standard gray-level images of size 512×512 with very different details, computational complexity can be reduced to below 5% ultimately for codebook of size 1024 or 2048 meanwhile keeping the PSNR not degraded as that of full search.

AB - In order to encode an image using VQ fast, it is most important to eliminate unnecessary distance computation as much as possible while searching for winner code. Sum and partial sum are used as features in this paper to roughly measure the difference between an input image block and a code to check whether current code could be a promising candidate winner code or not. A 3-step hierarchical fast search algorithm is proposed by narrowing search scope, skipping redundant distance computation and lastly simplifying must-do distance computation. For 10 standard gray-level images of size 512×512 with very different details, computational complexity can be reduced to below 5% ultimately for codebook of size 1024 or 2048 meanwhile keeping the PSNR not degraded as that of full search.

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

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

M3 - Conference article

AN - SCOPUS:0036296912

VL - 1

SP - I/797-I/800

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

T2 - 2002 IEEE International Symposium on Circuits and Systems

Y2 - 26 May 2002 through 29 May 2002

ER -