期刊文献+

扩展方向树的遥感图像小波包压缩算法 被引量:3

Wavelet Packet Compression Algorithm for Remote Sensing Images with Extended Spatial Orientation Tree
在线阅读 下载PDF
导出
摘要 针对遥感图像纹理丰富、空间相关性弱,普通压缩算法容易造成高频信息丢失的特点,本文利用小波包优良的高频分析能力,提出一种结合SPIHT的小波包编码算法。该算法采用类似SPIHT算法的零树结构,通过重新定义方向树,即扩展方向树,改变小波包各节点之间的对应关系,解决小波包分解时产生的"父冲突"问题。同时,对扩展方向树的合理性进行了实验验证,并结合SPIHT算法实现了整个编解码。实验结果表明,对于富含纹理的遥感图像,在1bpp的压缩率下,该算法峰值信噪比(PSNR)超出SPIHT算法0.5-1dB,且视觉效果更好。 For remote sensing images, ordinary image compression algorithm always loses crucial features, such as edges and texture, during the coding procedure. A new compression scheme is proposed based on wavelet packet which has good performance on image detail processing. The problems arising from the application of zero tree-based algorithm to wavelet packet transform are analyzed. A generation version of parent-children relationship, named Extend Spatial Orientation Tree (SOT), to solve the parental conflict is defined. Combined with SPIHT, Extended SOT Wavelet Packet Codec (ESOT-WPC) is realized. Experimental results show that, under the same compression rate, the new codec method outperforms SPIHT in terms of Peak Signal-to-noise Ratio (PSNR) and vision.
出处 《光电工程》 EI CAS CSCD 北大核心 2008年第1期94-99,共6页 Opto-Electronic Engineering
基金 国家军工预研专项(JW20*25003) 浙江省教育厅科研项目(20061661) 宁波大学人才工程项目(X130710008)
关键词 遥感图像 小波包 父冲突 扩展方向树 SPIHT remote sensing image wavelet packet parental conflict extended SOT SPIHT
作者简介 米德伶(1958-),男(汉族),重庆人,副研究员,主要研究方向是CCD成像技术及遥感图像压缩。E-mail:mideling@163.com
  • 相关文献

参考文献8

  • 1Ramchandran Kannan,Vetterli Martin.Best wavelet packet bases in a rate distortion sense[J].IEEE Trans.Image Processing,1993,2(4):160-175.
  • 2Said Amir,Pearlman William A..A new fast and efficient image codec based on set portioning in hierarchical trees[J].IEEE Trans.on CASVT,1996,6(3):243-250.
  • 3Shapiro Jerome M.Embedded image coding using zero-trees of wavelet coefficients[J].IEEE Transactions on Signal Process -ing,1993,41(12):3445-3462.
  • 4Coifman Ronald R,Wickerhauser Mladen Victor.Entropy based algorithm for best basis selection[J].IEEE Trans.Information Theory,1992,38(2):713-718.
  • 5Xiong Zixiang,Ramchandran Kannan,Orchard Michael I.Wavelet packet image coding using space-frequency quantization[J].IEEE Trans.Image Processing,1998,7(6):892-898.
  • 6Xiong Zixiang,Ramchandran Kannan,Orchard Michael I d.Space-frequency quantization for wavelet image coding[J].IEEE Trans.Image Processing,1997,6(5):677-693.
  • 7Rajpoot Nasir M,Wilson Roland G,Meyer Francois G,et al.Adaptive wavelet packet basis selection for zerotree image coding[J].IEEE Trans.Image Processing,2003,12(12):1460-1472.
  • 8Sprljan Nikola,Grgic Sonja,Mrak Marta,et al.Modified SPIHT algorithm for wavelet packet image coding[J].Real-time Imaging,2005,11(5/6):378-388.

同被引文献24

  • 1苏东卫,慈林林,陈晓峰.高频频带再分解在遥感图像压缩中的应用[J].计算机辅助设计与图形学学报,2005,17(8):1839-1843. 被引量:1
  • 2何奇,韩国强,张见威,林少丹.一种基于图像纹理分析的分形和SPIHT混合编码[J].中国图象图形学报,2005,10(12):1485-1490. 被引量:2
  • 3Shapiro J M. Embedded image coding using zero trees of wavelet coefficients[ J ]. IEEE Trans on Signal Processing, 1993,41 (12) : 3445- 3462.
  • 4Said A, Pearlman W A. A new fast and efficient image codec based on set partitioning in hierarchal trees[J]. IEEE Trans on Circuits and Systems for Video Technology, 1996, 6 (3) : 243-250.
  • 5ISO/IEC 15444-1. Information technology-JPEG 2000 image coding system-Part 1: core coding system[S] .2000.
  • 6Sprljan N, Grgie S, Mrak M, et al. Modified SPIHT algorithm for wavelet packet image coding[ J]. Elsevier: Real-time Imaging, 2005, 11(5/6) : 378-388.
  • 7Ulug B. Significance map pruning and other enhancements to SPIHT image coding algorithm [ J ]. Signal Processing: Image Communication, 2003, 18 : 769-785.
  • 8Ki-Lyug K, Sung-Woong R. Performance improvement of the SPIHT coder[J]. Signal Processing: Image Communication, 2004, 19 : 29- 36.
  • 9潘志刚,张文超,王晓晨.结合近似最优比特分配的改进SPIHT算法[J].计算机工程,2007,33(15):46-48. 被引量:3
  • 10连静,王珂,曹丽丹.具有边缘保持特性的嵌入式图像压缩算法[J].中国图象图形学报,2007,12(4):592-596. 被引量:3

引证文献3

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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