首页> 外文会议>Data Compression Conference (DCC), 2010 >Lossless Compression of Maps, Charts, and Graphs via Color Separation
【24h】

Lossless Compression of Maps, Charts, and Graphs via Color Separation

机译:通过分色对地图,图表和图形进行无损压缩

获取原文
获取外文期刊封面目录资料

摘要

Summary form only given. In this research, we present a fast and efficient lossless compression scheme for discrete-color digital map images, charts, and graphs stored in the raster image format. The proposed scheme determines the number of different colors in the given image and creates a separate bi-level data layer for each color. Then, the bi-level layers are individually compressed using the proposed algorithm. This scheme comprises two components: (i) a codebook; and (ii) our row-column reduction coding algorithm, RCRC. The codebook is a fixed-to-variable Huffman dictionary that is based on symbol entropy. The second component of our scheme is a new algorithm, the RCRC, designed to deal with those blocks that are not found in the codebook. Our experimental results show that our lossless compression scheme achieved an average compression equal to 0.035 bpp for map images and 0.03 bpp for charts and graphs. These results are better than most reported results in the literature. Moreover, our scheme is simple and fast.
机译:仅提供摘要表格。在这项研究中,我们为存储在光栅图像格式中的离散彩色数字地图图像,图表和图形提供了一种快速有效的无损压缩方案。所提出的方案确定给定图像中不同颜色的数量,并为每种颜色创建一个单独的双层数据层。然后,使用所提出的算法分别对双层进行压缩。该方案包括两个部分:(i)码本; (ii)我们的行列缩减编码算法RCRC。该码本是基于符号熵的固定变数霍夫曼词典。我们方案的第二个组成部分是一种新的算法,即RCRC,用于处理在码本中找不到的那些块。我们的实验结果表明,我们的无损压缩方案对地图图像实现了平均压缩,等于0.035 bpp,对图表和图形来说,达到了0.03 bpp。这些结果比文献中大多数报道的结果要好。而且,我们的方案既简单又快速。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号