Paper Info
Title
A generalization of quad-trees applied to image coding
Abstract
Although quad-trees are not the most successful strategy in image coding, some generalized subdivision schemes have been proposed recently. This work exploits a moderate generalization of quad-trees where tiles are not restricted to be split in both dimensions, which leads to a previously developed graph of anisotropic tiles called "bush". An algorithm is developed to find the minimal number of tiles to represent shapes, which is used to build a codec for bi-level and indexed color images. Also, a lossy codec based on tile-wise rate-distortion optimized quantization of low-frequency DCT coefficients is developed. The aim of this work is to investigate whether anisotropic tiles have an advantage over square tiles. The results indeed show significant improvements. The lossless algorithm is suitable for images with large continuous regions and high color payload, such as geographical maps. The lossy codec is able to compete with JPEG2000, especially for artificial images.
Year
DOI
Venue
2012
10.3233/ICA-2012-0405
Integrated Computer-Aided Engineering
Keywords
Field
DocType
geographical map,artificial image,large continuous region,lossless algorithm,color image,image coding,generalized subdivision scheme,high color payload,anisotropic tile,lossy codec,dct,quad tree
Computer vision,High color,Lossy compression,Discrete cosine transform,Algorithm,Artificial intelligence,JPEG 2000,Quantization (signal processing),Codec,Mathematics,Quadtree,Lossless compression
Journal
Volume
Issue
ISSN
19
3
1069-2509
Citations 
PageRank 
References 
4
0.41
34
Authors
1
Name
Order
Citations
PageRank
Rade Kutil1618.80