Index assignment for progressive transmission of full search vector quantization

Eve A. Riskin, Les E. Atlas, Ren Yuh Wang, Richard Landner

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We address progressive transmission of full search image vector quantization. We build a progressive transmission tree to define binary mergings of codewords for successively smaller sized codebooks. The tree design methods we apply are the generalized Lloyd algorithm splitting algorithm, minimum cost perfect matching, and a method of principal eigenvectors.

Original languageEnglish
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory
Pages173
Number of pages1
StatePublished - 1993
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: 17 Jan 199322 Jan 1993

Publication series

NameProceedings of the 1993 IEEE International Symposium on Information Theory

Conference

ConferenceProceedings of the 1993 IEEE International Symposium on Information Theory
CitySan Antonio, TX, USA
Period17/01/9322/01/93

Fingerprint

Dive into the research topics of 'Index assignment for progressive transmission of full search vector quantization'. Together they form a unique fingerprint.

Cite this