检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:叶辰 包学才[1,2] 姚家伟 YE Chen;BAO Xuecai;YAO Jiawei(School of Information Engineering;Jiangxi Province Key Laboratory of Water Information Cooperative Sensing and Intelligent Processing,Nanchang Institute of Technology,Nanchang 330099,China)
机构地区:[1]南昌工程学院信息工程学院 [2]南昌工程学院江西省水信息协同感知与智能处理重点实验室,江西南昌330099
出 处:《南昌工程学院学报》2022年第1期89-96,共8页Journal of Nanchang Institute of Technology
基 金:国家自然科学基金资助项目(61961026,61962036);江西省自然科学基金资助项目(20202BABL202003)。
摘 要:为有效降低传感网络图像压缩算法的计算复杂度,提高偏远区域无线传感网络的监测与传输性能,提出一种改进低复杂度多级树集合分裂(Set Partitioning in Hierarchical Trees,SPIHT)的传感网络图像压缩算法。该算法在图像小波分解过程中,利用提出的两种池化决策裁剪和优化高频系数,解决了SPIHT在重要性系数选择方面计算复杂度高的问题。通过实验对比分析,对于同类型和不同类型特征的图像,在保证重构图像清晰度的条件下,提出算法在编码、解码时间上分别比SPIHT算法平均减少38.47%和44.11%,有效降低了计算复杂度,提升了传感网络监测与传输能效。In order to decrease the computational complexity of image compression algorithms and improve the monitoring and transmitting performance of wireless sensor networks in remote areas,an improved low-complexity image compression algorithm based on Set Partitioning in Hierarchical Trees(SPIHT)is proposed.This algorithm utilized two pooling strategies to cut and optimize the part of high-frequency coefficients in image wavelet decomposition process,which solved the problem of high computational complexity in the process of selecting importance coefficients in SPIHT.Through experimental and comparative analysis,the quality of reconstructed images of the same and different image types was ensured.Compared with SPIHT,the encoding and decoding time of the proposed algorithm was reduced by 38.47%and 44.11%respectively.The proposed algorithm can effectively decrease the complexity of SPIHT algorithm,and upgrade the efficiency of sensor network monitoring and transmission.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171