Vector quantization of images with variable block size
Applied Soft Computing
R-D optimized tree-structured compression algorithms with discrete directional wavelet transform
Journal of Computational and Applied Mathematics
Short Communication: Efficient quadtree based block-shift filtering for deblocking and deringing
Journal of Visual Communication and Image Representation
Dynamic adaptive 3D multi-view video streaming over the internet
Proceedings of the 2013 ACM international workshop on Immersive media experiences
Cross residual transform for lossless intra-coding for HEVC
Image Communication
A generalization of quad-trees applied to image coding
Integrated Computer-Aided Engineering
| Hi-index | 0.01 |
The quadtree data structure is commonly used in image coding to decompose an image into separate spatial regions to adaptively identify the type of quantizer used in various regions of an image. The authors describe the theory needed to construct quadtree data structures that optimally allocate rate, given a set of quantizers. A Lagrange multiplier method finds these optimal rate allocations with no monotonicity restrictions. They use the theory to derive a new quadtree construction method that uses a stepwise search to find the overall optimal quadtree structure. The search can be driven with either actual measured quantizer performance or ensemble average predicted performance. They apply this theory to the design of a motion compensated interframe video coding system using a quadtree with vector quantization