In this paper a new lossless objects compression method for images is proposed. The proposed method first the pixels number of all objects within an image and, then, it minimizes the number of these objects without loss for the image content. This method includes three techniques to choose the objects that will be compressed. In the first technique, all objects within the image are compressed without the largest object. In the second technique, the objects of image are grouped (group by group) depend on their color, and the entire groups are compressed except the largest group. In the third technique, the image objects are compressed, except both the largest group and the objects that have similar objects in shape. To achieve a good value of compression ratio the proposed techniques are combined with other compression methods such as Huffman and differential encoding.
[1]
Herbert Freeman,et al.
On the Encoding of Arbitrary Geometric Configurations
,
1961,
IRE Trans. Electron. Comput..
[2]
Rafael C. González,et al.
Local Determination of a Moving Contrast Edge
,
1985,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3]
Dan E. Tamir,et al.
Efficient chain-code encoding for segmentation-based image compression
,
1996,
Proceedings of Data Compression Conference - DCC '96.
[4]
J. Todd.
Book Review: Digital image processing (second edition). By R. C. Gonzalez and P. Wintz, Addison-Wesley, 1987. 503 pp. Price: £29.95. (ISBN 0-201-11026-1)
,
1988
.