Prediction Capabilities of Boolean and Stack Filters forLossless Image Compression
Multidimensional Systems and Signal Processing
CAIP '01 Proceedings of the 9th International Conference on Computer Analysis of Images and Patterns
Vector Quantization-Fractal Image Coding Algorithm Based on Delaunay Triangulation
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Vector quantization of images with variable block size
Applied Soft Computing
A dual quad-tree based variable block-size coding method
Journal of Visual Communication and Image Representation
The SAR image compression with projection pursuit neural networks
ISNN'05 Proceedings of the Second international conference on Advances in neural networks - Volume Part II
Medical image compression based on vector quantization with variable block sizes in wavelet domain
Computational Intelligence and Neuroscience - Special issue on Computational Intelligence in Biomedical Science and Engineering
| Hi-index | 35.68 |
High-quality variable-rate image compression is achieved by segmenting an image into regions of different sizes, classifying each region into one of several perceptually distinct categories, and using a distinct coding procedure for each category. Segmentation is performed with a quadtree data structure by isolating the perceptually more important areas of the image into small regions and separately identifying larger random texture blocks. Since the important regions have been isolated, the remaining parts of the image can be coded at a lower rate than would be otherwise possible. High-quality coding results are achieved at rates between 0.35 and 0.7 b/p depending on the nature of the original image, and satisfactory results have been obtained at 0.25 b/p