This paper proposes a novel image compression‐encryption scheme based on compressive sensing and bit‐level XOR. In the proposed scheme, the encrypted sequences are generated from a 4‐D hyper‐chaotic Lorenz system and a Logistic system. First, an original image is sampled by a secure block parallel compressive sensing (PCS) scheme. In the PCS phase, a key‐controlled discrete cosine transform sparse basis matrix and a key‐controlled complex Hadamard measurement matrix are employed. Next, the real part and imaginary part of the resulting complex‐valued data are quantized and transformed into bit streams, respectively. After that, the two generated bit streams are combined into one bit stream. Then, the resulting bit stream is further encrypted by a bit‐level XOR operation, where the encrypted key is generated from a chaotic system. The experiment results show the effectiveness and reliability of the proposed joint compression‐encryption scheme. The proposed scheme can not only enhance the security of the compressed image but also improve the reconstructed quality of the compressed image.
28 November 2022 in Multimedia Tools and Applications
Compressive sensing (CS)-based image coding has been widely studied in the field of image processing. However, the CS-based image encoder has a significant gap in image reconstruction performance compared with the conventional image compression methods. In order to improve the reconstruction quality of CS-based image encoder, we proposed an image parallel block compressive sensing (BCS) coding scheme, which is based on discrete Cosine transform (DCT) sparse basis matrix and partial discrete Fourier transform (DFT) measurement matrix. In the proposed parallel BCS scheme, each column of an image block is sampled by the same DFT measurement matrix. Due to the complex property of DFT measurement matrix, the compressed image data is complex. Then, the real part and imaginary part of the resulting BCS data are quantized and transformed into two bit streams, respectively. At the reconstruction stage, the resulting two bit streams are transformed back into two real signals using inverse quantization operation. The resulting two real signals are combined into one complex signal, which is served as the input data of the CS reconstructed algorithm. The theoretical analysis based on minimum Frobenius norm method demonstrates that the proposed DFT measurement matrix outperforms the other conventional measurement matrices. The simulation results show that the reconstructed performance of the proposed DFT measurement matrix is better than that of the other conventional measurement matrices for the proposed parallel BCS. Specifically, we analyzed the impact of quantization on the reconstruction performance of CS. The experiment results show that the effect of the quantization on reconstruction performance in BCS framework can nearly be ignored.