{"title":"Lossless Compression of Maps, Charts, and Graphs via Color Separation","authors":"S. alZahir, Arber Borici","doi":"10.1109/DCC.2010.102","DOIUrl":null,"url":null,"abstract":"In this paper, we present a fast lossless compression scheme for digital map images, and chart and graph images in the raster image format. This work contains two main contributions. The first is centered around the creation of a codebook that is based on symbol entropy. The second contribution is the introduction of a new row-column reduction coding algorithm. This scheme determines the number of different colors in the given image and creates a separate bi-level data layer for each color i.e., one for the color and the second is for the background. Then, the bi-level layers are individually compressed using the proposed method, which is based on symbol-entropy in conjunction with our row-column reduction coding algorithm. Our experimental results show that our lossless compression scheme scored a compression equal to 0.035 bpp on average for map images and 0.03 bpp on average for charts and graphs. These results are better than most reported results in the literature. Moreover, our scheme is simple and fast.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2010.102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we present a fast lossless compression scheme for digital map images, and chart and graph images in the raster image format. This work contains two main contributions. The first is centered around the creation of a codebook that is based on symbol entropy. The second contribution is the introduction of a new row-column reduction coding algorithm. This scheme determines the number of different colors in the given image and creates a separate bi-level data layer for each color i.e., one for the color and the second is for the background. Then, the bi-level layers are individually compressed using the proposed method, which is based on symbol-entropy in conjunction with our row-column reduction coding algorithm. Our experimental results show that our lossless compression scheme scored a compression equal to 0.035 bpp on average for map images and 0.03 bpp on average for charts and graphs. These results are better than most reported results in the literature. Moreover, our scheme is simple and fast.