The use of arithmetic coding for binary image compression achieves a high compression ratio while the running time remains rather slow. A composite modelling method presented in this paper reduces the size of the data to be coded by arithmetic coding. The method is to code the uniform areas with les
A method of scale conversion for binary image including dithered image
β Scribed by Yasuo Kurosu
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 208 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0882-1666
No coin nor oath required. For personal study only.
β¦ Synopsis
To process a character/picture combined document (including dithered images) in a filing system, high quality scale conversion of documents is required. If a binary document-image including a dithered image is reduced based on its gray scale, its character region blurs. If a dithered image is reduced by coordinate conversion alone, moirΓ© patterns occur in the dithered regions. This paper proposes a method which reduces these two region types separately by discriminating them based on the dispersion of black pixels and the shape of the picture/photograph. Subjective evaluation of the method was carried out by six male markers, by scoring the reduced images on a scale of five grades, the highest being 5. The images processed by the proposed method were evaluated as higher in quality than those by a conventional method by 1.5 points (maximum) and by 0.5 point (mean). The accuracy of area discrimination was also evaluated by using different character sizes. When characters are larger than 5.6 points (font size), the image can be recognized with an accuracy of 100%. Using the proposed method, therefore, binary images including dithered images can be reduced with little deterioration.
π SIMILAR VOLUMES
A method for compressing large binary images is proposed for applications where spatial access to the image is required. The proposed method is a two-stage combination of forward-adaptive modeling and backwardadaptive context based compression with re-initialization of statistics. The method improve
This paper proposes the 1-affine transformation for rectangular video images. In the proposed method, each frame of the input rectangular video images is partitioned into small square subimages, which are stored separately in memory. Then, by applying the 90Β° rotation and the one-dimensional geometr
Rank et al. have proposed an algorithm for estimating image noise variance composed of the following three steps: the noisy image is first filtered by a difference operator; a histogram of local signal variances is then computed; and, finally the noise variance is estimated from a statistical evalua
A simple method for obtaining the convex hull of a shape, which generates an octagonal approximation, is based on repeatedly filling the central pixel in all 3 x 3 neighborhoods which show a concavity. We propose an extension of this technique that uses larger windows and yields improved results. Th