期刊文献+

基于OBDD的灰度图像无损压缩算法

Lossless compression algorithm for grey scale images based on OBDD
下载PDF
导出
摘要 提出一种基于有序决策二叉图(OBDD)的灰度图像无损压缩算法,该算法将灰度图像划分成独立的位平面,利用二值图像的开关性,用OBDD模型来表征位平面,然后对OBDD进行有效的编码,最后用算术编码压缩进一步减少冗余。实验结果表明,本算法的压缩比优于WinZIP。 A lossless compression algorithm for grey scale images based on ordered binary-decision diagrams (OBDD) is presented. A grey scale image is separated into several bit-planes individually, then every bit-plane is described into a OBDD because of the switch theory ofbi-level images. The OBDDs are encoded efficiently, then arithmetic coding is used to remove the residual redundancy. The results obtained shows the algorithm has a better compression ratio than WinZIP.
出处 《计算机工程与设计》 CSCD 北大核心 2007年第23期5674-5676,共3页 Computer Engineering and Design
基金 广西科学基金项目(桂科自0640034)
关键词 图像压缩 无损压缩 灰度图像 位平面编码 有序二叉决策图 image compression lossless compression grey scale image bit plane coding OBDD
  • 相关文献

参考文献8

  • 1孙自广,古天龙.一种基于代数决策图的多值图像无损压缩方法[J].桂林电子工业学院学报,2006,26(2):100-103. 被引量:2
  • 2徐周波,古天龙,赵岭忠.网络最大流问题的一种新的符号ADD求解算法[J].通信学报,2005,26(2):1-8. 被引量:15
  • 3Falkowski B J. Compact representations of logic functions for lossless compression of grey scale images[C]. United Kingdom: IEEE Proceedings on Computers and Digital Techniques,2004, 151(3):221-230.
  • 4Falkowski B J. Lossless binary image compression using logic functions and spectra[J], Computers and Electrical Engineering, 2004,30(1): 17-43.
  • 5Mateu-Villarroya P, Prades-Nebot J. Lossless image compression using ordered binary-decision diagrams [J].Electronic Letters,2001,37(3): 162-163.
  • 6Somenzi F. CUDD: CU decision diagram package release 2.3.1 [EB/OL]. http://vlsi.Colorado.edu/-fabio/C UDD/cuddIntro.html, 2006.
  • 7Lonear-Turukalo T. Image compression by decomposition into bit planes[C]. TELSIKS,2001,19-21.
  • 8Salomon D. Data compression: the complete reference[M]. New York: Springer-Verlag Inc,2000.

二级参考文献22

  • 1徐周波,古天龙.网络最大流问题求解的代数决策图(ADD)技术[J].桂林电子工业学院学报,2004,24(3):54-57. 被引量:3
  • 2TAKAO A, YASUHITO A. Recent developments in maximum flow algorithms[J]. Journal of the Operations Research Society of Japan,2000, 43(1): 2-31.
  • 3FORD L R, FULKERSON D R. Maximum flow through a network[J].Canadian Journal of Math, 1956, 8(5): 399-404.
  • 4DINIC E A. Algorithm for solution of a problem of maximum flow in networks with power estimation[J]. Soviet Math Dokl, 1970, 11(8):1277-1280.
  • 5KARZANOV A V. Determining the maximum flow in a network by the method of preflows[J]. Soviet Math Dokl, 1974, 15(3): 434-437.
  • 6GOLDBERG A V, TARJAN R E. A new approach to the maximum flow problem[J]. Journal of the Association for Computing Machinery,1988, 35(4): 921-940.
  • 7GOLDBERG A V, RAO S. Beyond the flow decomposition barrier[J].Journal of the Association for Computing Machinery, 1998, 45(5):783-797.
  • 8TAR JAN R E. A simple version of Karzanov's blocking flow algorithm[J]. Operations Research Letters, 1984, 2(6): 265-268.
  • 9TRAFF J L. A heuristic for blocking flow algorithms[J]. European Journal of Operational Research, 1996, 89(3): 564-569.
  • 10BRYANT R E. Graph-based algorithms for Boolean function manipulation[J]. IEEE Transaction on Computer, 1986, 35(8):677-691.

共引文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部