VERY FAST TREE - STRUCTURED VECTOR QUANTIZATIONTodd
نویسنده
چکیده
منابع مشابه
Very Fast Tree-structured Vector Quantization
Very fast tree-structured vector quantization employs scalar quantization decisions at each level, but chooses the dimension on which to quantize based on the coordinate direction of maximum variance. Because the quantization is scalar, searches are no more complex than scalar quantization − providing significant improvement in complexity over full-searched or even tree-structured vector quanti...
متن کاملConditional Entropy Constrained Tree Structured Vector Quantization with Applications to Sources with Memory
An algorithm is derived for designing tree structured vector quantizers to encode sources with memory The algorithm minimizes the average distortion subject to a conditional entropy constraint and the tree structure restriction This technique called conditional entropy constrained tree structured vector quantization CECTSVQ can more e ciently exploit the source memory This work is an extension ...
متن کاملFast tree-structured nearest neighbor encoding for vector quantization
This work examines the nearest neighbor encoding problem with an unstructured codebook of arbitrary size and vector dimension. We propose a new tree-structured nearest neighbor encoding method that significantly reduces the complexity of the full-search method without any performance degradation in terms of distortion. Our method consists of efficient algorithms for constructing a binary tree f...
متن کاملImage Vector Quantization with Hierarchical Tree Structure
The tree-structured vector quantization (TSVQ) is an efficient method for the vector quantization (VQ). In this paper, we propose a new tree structure model, hierarchical tree structure (HTS), to reduce encoding time. Briefly, the HTSVQ decreases the dimension of the vector on the upper levels of the codebook tree. If the vector dimension decreases, then the searching time on the codebook tree ...
متن کاملFast Image Database Search using Tree-Structured VQ∗
In this paper, we exploit the techniques of tree structured vector quantization (TSVQ), branch and bound search, and the triangle inequality to speed the search of large image databases. Our method can reduce search computation required to locate images which best match a query image provided by a user. While exact search is possible, a free parameter allows search accuracy to be reduced, there...
متن کامل