Random Permutation-Based Block Compressed Sensing for Image Encryption-then-Compression Applications

Author(s):  
Bo Zhang ◽  
Lei Yang ◽  
Kai Wang ◽  
Yuqiang Cao
Entropy ◽  
2021 ◽  
Vol 23 (10) ◽  
pp. 1297
Author(s):  
Yuandi Shi ◽  
Yinan Hu ◽  
Bin Wang

Many image encryption schemes based on compressed sensing have the problem of poor quality of decrypted images. To deal with this problem, this paper develops an image encryption scheme by multiscale block compressed sensing. The image is decomposed by a three-level wavelet transform, and the sampling rates of coefficient matrices at all levels are calculated according to multiscale block compressed sensing theory and the given compression ratio. The first round of permutation is performed on the internal elements of the coefficient matrices at all levels. Then the coefficient matrix is compressed and combined. The second round of permutation is performed on the combined matrix based on the state transition matrix. Independent diffusion and forward-backward diffusion between pixels are used to obtain the final cipher image. Different sampling rates are set by considering the difference of information between an image’s low- and high-frequency parts. Therefore, the reconstruction quality of the decrypted image is better than that of other schemes, which set one sampling rate on an entire image. The proposed scheme takes full advantage of the randomness of the Markov model and shows an excellent encryption effect to resist various attacks.


Author(s):  
Guangzhi Dai ◽  
Zhiyong He ◽  
Hongwei Sun

Background: This study is carried out targeting the problem of slow response time and performance degradation of imaging system caused by large data of medical ultrasonic imaging. In view of the advantages of CS, it is applied to medical ultrasonic imaging to solve the above problems. Objective: Under the condition of satisfying the speed of ultrasound imaging, the quality of imaging can be further improved to provide the basis for accurate medical diagnosis. Methods: According to CS theory and the characteristics of the array ultrasonic imaging system, block compressed sensing ultrasonic imaging algorithm is proposed based on wavelet sparse representation. Results: Three kinds of observation matrices have been designed on the basis of the proposed algorithm, which can be selected to reduce the number of the linear array channels and the complexity of the ultrasonic imaging system to some extent. Conclusion: The corresponding simulation program is designed, and the result shows that this algorithm can greatly reduce the total data amount required by imaging and the number of data channels required for linear array transducer to receive data. The imaging effect has been greatly improved compared with that of the spatial frequency domain sparse algorithm.


2013 ◽  
Author(s):  
Sen-lin Yang ◽  
Guo-bin Wan ◽  
Bian-lian Zhang ◽  
Xin Chong

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Ran Li ◽  
Hongbing Liu ◽  
Yu Zeng ◽  
Yanling Li

In the framework of block Compressed Sensing (CS), the reconstruction algorithm based on the Smoothed Projected Landweber (SPL) iteration can achieve the better rate-distortion performance with a low computational complexity, especially for using the Principle Components Analysis (PCA) to perform the adaptive hard-thresholding shrinkage. However, during learning the PCA matrix, it affects the reconstruction performance of Landweber iteration to neglect the stationary local structural characteristic of image. To solve the above problem, this paper firstly uses the Granular Computing (GrC) to decompose an image into several granules depending on the structural features of patches. Then, we perform the PCA to learn the sparse representation basis corresponding to each granule. Finally, the hard-thresholding shrinkage is employed to remove the noises in patches. The patches in granule have the stationary local structural characteristic, so that our method can effectively improve the performance of hard-thresholding shrinkage. Experimental results indicate that the reconstructed image by the proposed algorithm has better objective quality when compared with several traditional ones. The edge and texture details in the reconstructed image are better preserved, which guarantees the better visual quality. Besides, our method has still a low computational complexity of reconstruction.


Sign in / Sign up

Export Citation Format

Share Document