Premium
Lossless compression for storing similar binary images
Author(s) -
Lin TsongWuu
Publication year - 1999
Publication title -
international journal of imaging systems and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.359
H-Index - 47
eISSN - 1098-1098
pISSN - 0899-9457
DOI - 10.1002/(sici)1098-1098(1999)10:1<59::aid-ima7>3.0.co;2-#
Subject(s) - lossless compression , computer science , compression (physics) , binary number , lossless jpeg , image compression , data compression , artificial intelligence , mathematics , image (mathematics) , arithmetic , image processing , materials science , composite material
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. © 1999 John Wiley & Sons, Inc. Int J Imaging Syst Technol 10: 59–66, 1999