Optimization of code book in vector quantization

K. Thangavel () and J. Suresh Kumar ()

Annals of Operations Research, 2006, vol. 143, issue 1, 317-325

Abstract: In this paper, we present a novel approach to design a code book for vector quantization using standard deviation. The proposed algorithm optimizes the partitioning space to explore the search space for a set of equally viable and equivalent partitions. Essentially the partition space is partitioned into perceptive clusters, so that the code book is optimized. The proposed algorithm is proved better than the widely used quantization algorithm in applications. Copyright Springer Science + Business Media, LLC 2006

Keywords: Pattern space; Clustering; Code book; Optimization (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-006-7391-0 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:143:y:2006:i:1:p:317-325:10.1007/s10479-006-7391-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-006-7391-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().