.png){kind=icon}
Return
A quadsection algorithm for grammar-based image compression
.png){kind=icon}
PRE
AI
DOI：10.3233/ICA-2012-0389.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 M polynomial time the smallest CFRIG within a factor of O(n(4/3)), where an input image data is of size O(n) x O(n). 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.
Keywords:
Grammar-based compression
image compression
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
5.3
Papers:
491
Citations:
735
Organization
Cited Papers
No cited papers available