研究目的
To propose a new method for joint image compression and encryption based on set partitioning in hierarchical trees (SPIHT) with optimized Kd-tree and multiple chaotic maps, aiming to achieve confidentiality and efficient bandwidth utilization.
研究成果
The proposed joint image compression and encryption algorithm based on IWT with SPIHT, Kd-tree, and multiple chaotic maps achieves high compression ratio and robust security. It is resistant to various attacks and provides satisfactory lossless compression performance.
研究不足
The computational complexity of Kd-tree when applied on the whole data set is high, though future implementations could reduce processing time with fully parallel Kd-tree.
1:Experimental Design and Method Selection:
The methodology involves joint compression and encryption based on IWT with SPIHT, Kd-tree, and multiple chaotic maps.
2:Sample Selection and Data Sources:
Six standard 512 × 512 grayscale images with 256 gray levels were used.
3:List of Experimental Equipment and Materials:
MATLAB R2016b programming environment on a personal computer with an Intel Corei3
4:5-GHz processor and 8-GB memory. Experimental Procedures and Operational Workflow:
The process includes lossless compression and encryption based on IWT with SPIHT, followed by compression and encryption via Kd-tree and wavelet tree, and finally encryption with chaotic maps.
5:Data Analysis Methods:
Performance was evaluated through compression ratio (CR), peak-signal-to-noise ratio (PSNR), key space, and histogram analyses.
独家科研数据包,助您复现前沿成果,加速创新突破
获取完整内容