Binary Image Compression via Monochromatic Pattern Substitution: Sequential and Parallel Implementations

2013 ◽  
Vol 7 (2) ◽  
pp. 155-166 ◽  
Author(s):  
Luigi Cinque ◽  
Sergio De Agostino ◽  
Luca Lombardi
1991 ◽  
Author(s):  
Yasuhiko Nakano ◽  
Hirotaka Chiba ◽  
Yoshiyuki Okada ◽  
Shigeru Yoshida ◽  
Masahiro Mori

Author(s):  
Saif alZahir ◽  
Syed M. Naqvi

In this paper, the authors present a binary image compression scheme that can be used either for lossless or lossy compression requirements. This scheme contains five new contributions. The lossless component of the scheme partitions the input image into a number of non-overlapping rectangles using a new line-by-line method. The upper-left and the lower-right vertices of each rectangle are identified and the coordinates of which are efficiently encoded using three methods of representation and compression. The lossy component, on the other hand, provides higher compression through two techniques. 1) It reduces the number of rectangles from the input image using our mathematical regression models. These mathematical models guarantees image quality so that rectangular reduction should not produce visual distortion in the image. The mathematical models have been obtained through subjective tests and regression analysis on a large set of binary images. 2) Further compression gain is achieved through discarding isolated pixels and 1-pixel rectangles from the image. Simulation results show that the proposed schemes provide significant improvements over previously published work for both the lossy and the lossless components.


1992 ◽  
Author(s):  
Shigeru Yoshida ◽  
Yoshiyuki Okada ◽  
Yasuhiko Nakano ◽  
Hirotaka Chiba ◽  
Masahiro Mori

2014 ◽  
Vol 511-512 ◽  
pp. 441-446
Author(s):  
Yuer Wang ◽  
Zhong Jie Zhu ◽  
Wei Dong Chen

Image coding and compression is one of the most key techniques in the area of image signal processing, However, most of the existing coding methods such as JPEG, employ the similar hybrid architecture to compress images and videos. After many years of development, it is difficult to further improve the coding performance. In addition, most of the existing image compression algorithms are designed to minimize difference between the original and decompressed images based on pixel wise distortion metrics, such as MSE, PSNR which do not consider the HVS features and is not able to guarantee good perceptual quality of reconstructed images, especially at low bit-rate scenarios. In this paper, we propose a novel scheme for low bit-rate image compression. Firstly, the original image is quantized to a binary image based on heat transfer theory. Secondly, the bit sequence of the binary image is divided into several sub-sets and each one is designated a priority based on the rate-distortion principle. Thirdly, the sub-sets with high priorities are selected based on the given bit-rate. Finally, the context-based binary arithmetic coding is employed to encode the sub-sets selected to produce the final compressed stream. At decoder, the image is decoded and reconstructed based on anisotropic diffusion. Experiments are conducted and provide convincing results.


Sign in / Sign up

Export Citation Format

Share Document