A fast encoding method for vector quantization using modified memory-efficient sum pyramid

Zhibin Pan; Koji Kotani; Tadahiro Ohmi

doi:10.1007/s10-043-0040-z

A fast encoding method for vector quantization using modified memory-efficient sum pyramid

Zhibin Pan, Koji Kotani, Tadahiro Ohmi

ENG - Electronic Engineering

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

Abstract

Based on the concept of multi-resolutions, full search (FS) equivalent fast search methods for vector quantization (VQ) using mean-type pyramid have been developed in previous work.^1-4) In this paper, a modified memory-efficient sum pyramid is proposed, which is exact for computing the difference in integer form and features one more new resolution L₀₁ in-between the top 2 levels L₀ and L₁ of a conventional pyramid. Benefiting from a recursive difference computation at the top 3 levels, the proposed method can reduce the total computational cost obviously. Furthermore, a memory-efficient way of storage for the top 3 levels is integrated to reduce extra memory requirement.

Original language	English
Pages (from-to)	170-175
Number of pages	6
Journal	Optical Review
Volume	11
Issue number	3
DOIs	https://doi.org/10.1007/s10-043-0040-z
Publication status	Published - 2004 May 1

Keywords

Fast encoding
Modified memory-efficient sum pyramid
Vector quantization

ASJC Scopus subject areas

Atomic and Molecular Physics, and Optics

Access to Document

10.1007/s10-043-0040-z

Fingerprint Dive into the research topics of 'A fast encoding method for vector quantization using modified memory-efficient sum pyramid'. Together they form a unique fingerprint.

Cite this

@article{f74734f93e3446e88d237c5d081d14ce,

title = "A fast encoding method for vector quantization using modified memory-efficient sum pyramid",

abstract = "Based on the concept of multi-resolutions, full search (FS) equivalent fast search methods for vector quantization (VQ) using mean-type pyramid have been developed in previous work.1-4) In this paper, a modified memory-efficient sum pyramid is proposed, which is exact for computing the difference in integer form and features one more new resolution L01 in-between the top 2 levels L0 and L1 of a conventional pyramid. Benefiting from a recursive difference computation at the top 3 levels, the proposed method can reduce the total computational cost obviously. Furthermore, a memory-efficient way of storage for the top 3 levels is integrated to reduce extra memory requirement.",

keywords = "Fast encoding, Modified memory-efficient sum pyramid, Vector quantization",

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

year = "2004",

month = may,

day = "1",

doi = "10.1007/s10-043-0040-z",

language = "English",

volume = "11",

pages = "170--175",

journal = "Optical Review",

issn = "1340-6000",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "3",

}

TY - JOUR

T1 - A fast encoding method for vector quantization using modified memory-efficient sum pyramid

AU - Pan, Zhibin

AU - Kotani, Koji

AU - Ohmi, Tadahiro

PY - 2004/5/1

Y1 - 2004/5/1

N2 - Based on the concept of multi-resolutions, full search (FS) equivalent fast search methods for vector quantization (VQ) using mean-type pyramid have been developed in previous work.1-4) In this paper, a modified memory-efficient sum pyramid is proposed, which is exact for computing the difference in integer form and features one more new resolution L01 in-between the top 2 levels L0 and L1 of a conventional pyramid. Benefiting from a recursive difference computation at the top 3 levels, the proposed method can reduce the total computational cost obviously. Furthermore, a memory-efficient way of storage for the top 3 levels is integrated to reduce extra memory requirement.

AB - Based on the concept of multi-resolutions, full search (FS) equivalent fast search methods for vector quantization (VQ) using mean-type pyramid have been developed in previous work.1-4) In this paper, a modified memory-efficient sum pyramid is proposed, which is exact for computing the difference in integer form and features one more new resolution L01 in-between the top 2 levels L0 and L1 of a conventional pyramid. Benefiting from a recursive difference computation at the top 3 levels, the proposed method can reduce the total computational cost obviously. Furthermore, a memory-efficient way of storage for the top 3 levels is integrated to reduce extra memory requirement.

KW - Fast encoding

KW - Modified memory-efficient sum pyramid

KW - Vector quantization

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

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

U2 - 10.1007/s10-043-0040-z

DO - 10.1007/s10-043-0040-z

M3 - Article

AN - SCOPUS:4444324047

VL - 11

SP - 170

EP - 175

JO - Optical Review

JF - Optical Review

SN - 1340-6000

IS - 3

ER -

A fast encoding method for vector quantization using modified memory-efficient sum pyramid

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this