Lossless compression for storing similar binary images
β Scribed by Tsong-Wuu Lin
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 216 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0899-9457
No coin nor oath required. For personal study only.
β¦ Synopsis
Consecutive images keep some extra information which is not stored in each of them. These consecutive images form a gradually changing data set. The dynamic changes are kept wholly in such a data set. A gradually changing data set occupies a large amount of memory space unless it overlays the same parts. Based on the linear quadtree structures and overlapping concepts, a new representation is proposed for storing a sequence of similar binary images. Experiments have been made to compare our representation with other overlapping structures. From the experiments, our representation is shown to be better than other representations.
π 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 introduces an original unsupervised learning algorithm for information compression that is further used in the proposed fuzzy inference procedure for discovering similarities between different images for the purpose of their classification. Two features extracted from each compressed info