期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Contourlet watermarking algorithm based on Arnold scrambling and singular value decomposition 被引量:3
1
作者 陈立全 孙晓燕 +1 位作者 卢苗 邵辰 《Journal of Southeast University(English Edition)》 EI CAS 2012年第4期386-391,共6页
A new digital watermarking algorithm based on the contourlet transform is proposed to improve the robustness and anti-attack performances of digital watermarking. The algorithm uses the Arnold scrambling technique and... A new digital watermarking algorithm based on the contourlet transform is proposed to improve the robustness and anti-attack performances of digital watermarking. The algorithm uses the Arnold scrambling technique and the singular value decomposition (SVD) scheme. The Arnold scrambling technique is used to preprocess the watermark, and the SVD scheme is used to find the best suitable hiding points. After the contourlet transform of the carrier image, intermediate frequency sub-bands are decomposed to obtain the singularity values. Then the watermark bits scrambled in the Arnold rules are dispersedly embedded into the selected SVD points. Finally, the inverse contourlet transform is applied to obtain the carrier image with the watermark. In the extraction part, the watermark can be extracted by the semi-blind watermark extracting algorithm. Simulation results show that the proposed algorithm has better hiding and robustness performances than the traditional contourlet watermarking algorithm and the contourlet watermarking algorithm with SVD. Meanwhile, it has good robustness performances when the embedded watermark is attacked by Gaussian noise, salt- and-pepper noise, multiplicative noise, image scaling and image cutting attacks, etc. while security is ensured. 展开更多
关键词 digital watermarking contourlet transform arnold scrambling singular value decomposition (SVD)
下载PDF
Multispectral image compression and encryption method based on tensor decomposition in wavelet domain
2
作者 XU Dongdong DU Limin DU Yunlong 《High Technology Letters》 EI CAS 2024年第3期244-251,共8页
Multispectral image compression and encryption algorithms commonly suffer from issues such as low compression efficiency,lack of synchronization between the compression and encryption proces-ses,and degradation of int... Multispectral image compression and encryption algorithms commonly suffer from issues such as low compression efficiency,lack of synchronization between the compression and encryption proces-ses,and degradation of intrinsic image structure.A novel approach is proposed to address these is-sues.Firstly,a chaotic sequence is generated using the Lorenz three-dimensional chaotic mapping to initiate the encryption process,which is XORed with each spectral band of the multispectral image to complete the initial encryption of the image.Then,a two-dimensional lifting 9/7 wavelet transform is applied to the processed image.Next,a key-sensitive Arnold scrambling technique is employed on the resulting low-frequency image.It effectively eliminates spatial redundancy in the multispectral image while enhancing the encryption process.To optimize the compression and encryption processes further,fast Tucker decomposition is applied to the wavelet sub-band tensor.It effectively removes both spectral redundancy and residual spatial redundancy in the multispectral image.Finally,the core tensor and pattern matrix obtained from the decomposition are subjected to entropy encoding,and real-time chaotic encryption is implemented during the encoding process,effectively integrating compression and encryption.The results show that the proposed algorithm is suitable for occasions with high requirements for compression and encryption,and it provides valuable insights for the de-velopment of compression and encryption in multispectral field. 展开更多
关键词 multi-spectral image compression encryption Lorenz three-dimensional chaotic mapping arnold scrambling transform fast Tucker decomposition
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部