On the complexity of the recognition of parallel 2D-image languages
Information Processing Letters
On the power of L-systems in image generation
Acta Informatica
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
Natural Computing: an international journal
Grammatical Picture Generation: A Tree-Based Approach (Texts in Theoretical Computer Science. An EATCS Series)
Efficient memory representation of XML document trees
Information Systems
Finding Frequent Patterns from Compressed Tree-Structured Data
DS '08 Proceedings of the 11th International Conference on Discovery Science
Pure 2D picture grammars and languages
Discrete Applied Mathematics
Enhanced frequency pattern of the 2-D Hartley transform for a new crop-resilient image transform
Integrated Computer-Aided Engineering
Integrated Computer-Aided Engineering
A bisection algorithm for grammar-based compression of ordered trees
Information Processing Letters
Integrated Computer-Aided Engineering
Grammar-based codes: a new class of universal lossless source codes
IEEE Transactions on Information Theory
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Image coding based on a fractal theory of iterated contractive image transformations
IEEE Transactions on Image Processing
A generalization of quad-trees applied to image coding
Integrated Computer-Aided Engineering
Evolutionary multi-objective optimization for mesh simplification of 3D open models
Integrated Computer-Aided Engineering
Multiresolution streamline placement based on control grids
Integrated Computer-Aided Engineering
A new thresholding algorithm for document images based on the perception of objects by distance
Integrated Computer-Aided Engineering
Hi-index | 0.00 |
Grammar-based compression is to find a small grammar that generates a given data and has been well-studied in text compression. In this paper, we apply this methodology to compression of rectangular image data. We first define a context-free rectangular image grammar CFRIG by extending the context-free grammar. Then we propose a quadsection type algorithm by extending a bisection type algorithm for grammar-based compression of text data. We show that our proposed algorithm approximates in polynomial time the smallest CFRIG within a factor of On^{4/3}, where an input image data is of size On × On. Furthermore, we practically improve the proposed algorithm by adding several rules concerning sub-images. We also present results on computational experiments on the proposed algorithms.