Learn More
A new class of information-theoretic divergence measures based on the Shannon entropy is introduced. Unlike the well-known Kullback divergences, the new measures do not require the condition of absolute continuity to be satisfied by the probability distributions involved. More importantly, their close relationship with the variational distance and the(More)
Minimizing the distortion subject to a cost constraint is fundamental in the design of tree-structured vector quantizers. Because of various competing cost measures, the use of single-cost constraints has led to undesirable results. The author studies the relationships among several cost functions and shows how multiple-cost constraints can be used to(More)
Abstract-Tree-structured vector quantization (VQ) is a technique designed to represent a codebook that simplifies encoding as well as vector quantizer design. Most design algorithms for tree-structured VQ used in the past are based on heuristics that successively partition the input space. Recently, Chou, Lookabaugh, and Gray proposed a tree-pruning(More)
Tree-structured vector quantization (VQ) is a technique to represent a codebook that simplifies encoding as well as quantizer design. Most design algorithms for tree-structured VQ used in the past are based on heuristics that successively partition the input space. Recently, Chou, Lookabaugh, and Gray proposed a tree pruning heuristic in which a given(More)
Due to the limited power of the wireless sensor networks(WSNs), the network lifetime becomes a critical index in WSNs. However, network lifetime can not depict network effectively, there exist deficiency in currently evaluative standard. To solve the problem, two new indexes (network coverage rate and effective network lifetime) are introduced for(More)
One of the key problems in vector quantization is the design of a codebook, which involves the partitioning of a multi-dimensional space into a finite number of regions. Each region is assigned a code vector and every vector within a region is quantized to the code vector of the region. For a given input space, it is most desired to have a codebook which(More)
The authors analyze the approximate performance of tree search and provide tight upper bounds on the amount of error resulting from tree search and for a single input vector. These bounds are not encouraging but fortunately, the performance of tree-structured VQ in practice does not seem to be as bad. From the analysis, they derive a simple heuristic to(More)