Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
411,303
Multipath Tree-Structured Vector Quantizers
, 2000
"... Tree-structured vector quantization (TSVQ) is a popular mean of avoiding the exponential complexity of fullsearch vector quantizers. We present two new design algorithms for TSVQ in which more than one path can be chosen at each internal node. The two algorithms dier on the way the paths are chosen. ..."
Abstract
- Add to MetaCart
Tree-structured vector quantization (TSVQ) is a popular mean of avoiding the exponential complexity of fullsearch vector quantizers. We present two new design algorithms for TSVQ in which more than one path can be chosen at each internal node. The two algorithms dier on the way the paths are chosen
Multiresolution Tree Structured Vector Quantization
- Proc. Asilomar Conference on Signals, Systems and Computers, Asilomar
, 1996
"... In some applications of progressive image transmission, the images are viewed at several resolutions with fewer bits at lower resolutions. A multiresolution tree structured vector quantizer is developed to produce an embedded code, so that the quality of the image is optimized for the corresponding ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
In some applications of progressive image transmission, the images are viewed at several resolutions with fewer bits at lower resolutions. A multiresolution tree structured vector quantizer is developed to produce an embedded code, so that the quality of the image is optimized for the corresponding
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 -- provid ..."
Abstract
- Add to MetaCart
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
Learning Tree-Structured Vector Quantization for Image Compression
, 1995
"... Kohonen's self-organizing feature map (KSOFM) is an adaptive vector quantization (VQ) scheme for progressive code vector update. However, KSOFM approach belongs to unconstrained vector quantization, which suffers from exponential growth of the codebook. In this paper, a learning tree-structured ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Kohonen's self-organizing feature map (KSOFM) is an adaptive vector quantization (VQ) scheme for progressive code vector update. However, KSOFM approach belongs to unconstrained vector quantization, which suffers from exponential growth of the codebook. In this paper, a learning tree-structured
Fast texture synthesis using tree-structured vector quantization
, 2000
"... Figure 1: Our texture generation process takes an example texture patch (left) and a random noise (middle) as input, and modifies this random noise to make it look like the given example texture. The synthesized texture (right) can be of arbitrary size, and is perceived as very similar to the given ..."
Abstract
-
Cited by 562 (12 self)
- Add to MetaCart
Field texture models and generates textures through a deterministic searching process. We accelerate this synthesis process using tree-structured vector quantization.
Algorithms for Intervector Dependency Utilization in Variable Rate Tree-Structured Vector Quantization
"... In this paper we improve and extend our previous results in finite- state variable rate tree-structured vector quantization (FSVRTSVQ) 1 by developing two new algorithms to increase its coding efficiency. The two new algorithms are derived to utilize the inter-codeword dependency and the tree stru ..."
Abstract
- Add to MetaCart
In this paper we improve and extend our previous results in finite- state variable rate tree-structured vector quantization (FSVRTSVQ) 1 by developing two new algorithms to increase its coding efficiency. The two new algorithms are derived to utilize the inter-codeword dependency and the tree
Average number of facets per cell in tree-structured vector quantizer partitions
- IEEE Trans. Inform. Theory
, 1993
"... Abstiact-Upper and lower bounds are derived for the average number of facets per cell in the encoder partition of binary tree-structured vector quantizers. The achievability of the bounds is described as well. It is shown in particular that the average number of facets per cell for unbalanced trees ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstiact-Upper and lower bounds are derived for the average number of facets per cell in the encoder partition of binary tree-structured vector quantizers. The achievability of the bounds is described as well. It is shown in particular that the average number of facets per cell for unbalanced trees
Variable-Length Constrained-Storage Tree-Structured Vector Quantization
- IEEE Trans. Image Processing
, 1999
"... Constrained storage vector quantization, (CSVQ), introduced by Chan and Gersho, [2, 3, 4] allows for the stagewise design of balanced tree-structured residual vector quantization codebooks with low encoding and storage complexities. On the other hand, it has been established in [9, 11, 12] that vari ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Constrained storage vector quantization, (CSVQ), introduced by Chan and Gersho, [2, 3, 4] allows for the stagewise design of balanced tree-structured residual vector quantization codebooks with low encoding and storage complexities. On the other hand, it has been established in [9, 11, 12
HIERARCHICAL SUMMARIZATION OF VIDEOS BY TREE-STRUCTURED VECTOR QUANTIZATION
"... Accurate grouping of video shots could lead to semantic indexing of video segments for content analysis and retrieval. This paper introduces a novel cluster analysis which, depending both on the video genre and the specific user needs, produces a hierarchical representation of the video only on a re ..."
Abstract
- Add to MetaCart
reduced number of significant summaries. An outlook on a possible implementation strategy is then suggested. Specifically, vector-quantization codebooks are used to represent the visual content and to cluster the shots with a similar chromatic consistency. The evaluation of the codebook distortion
Complexity-Constrained Tree-Structured Vector Quantizers
- In 21st Symposium on Information Theory in the Benelux
, 2000
"... this paper uses a merge operator to modify the tree structure and move on the complexitydistortion curve. This operator does not change the rate of the quantizer, so the complexity-distortion ratio can be tuned independently. ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
this paper uses a merge operator to modify the tree structure and move on the complexitydistortion curve. This operator does not change the rate of the quantizer, so the complexity-distortion ratio can be tuned independently.
Results 1 - 10
of
411,303
