An Image Encryption Algorithm Based on Compressive Sensing and M Sequence
Yuqiang Dou,Ming Li +1 more
TL;DR: In this paper, a new image encryption algorithm based on compressive sensing (CS) and M sequence is proposed to decrease the image communication load and improve the security of image communication in the internet of things.
read more
Abstract: In this article, a new image encryption algorithm based on compressive sensing (CS) and M sequence is proposed to decrease the image communication load and improve the security of image communication in the internet of things. Most of the available image encryption schemes are based on chaotic systems to shuffle the image pixels. Before shuffling the image pixels, the random sequence, which is produced by a chaotic system, need to be sorted. This sorting operation is avoided by utilizing a modified linear feedback shift register (LFSR) state sequence. Then, the security of the proposed scheme is improved by combining CS with an improved 1D chaotic system, which is used to construct a measurement matrix. The computational complexity is reduced by the use of the improved 1D chaotic system. Simultaneously, the amount of image data is reduced. Simulation results and performance analyses demonstrate that the proposed encryption scheme can greatly reduce the amount of image data and has good security and robustness.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Plaintext-Related Dynamic Key Chaotic Image Encryption Algorithm.
TL;DR: Wang et al. as discussed by the authors proposed a dynamic key chaotic image encryption algorithm with low complexity and high security associated with plaintext, where RGB components of the color image are read, and the RGB components are normalized to obtain the key that is closely related to the plaintext.
16
Image Encryption Algorithms: A Survey of Design and Evaluation Metrics
Yousef Alghamdi,Arslan Munir +1 more
TL;DR: Image encryption algorithms survey covering various approaches, evaluation metrics, and applications. Provides classification, strengths/weaknesses, and bounds for metrics.
15
IoT based medical image encryption using linear feedback shift register – Towards ensuring security for teleradiology applications
Sajeev John,S. Kumar +1 more
TL;DR: In this paper , the authors proposed a medical image encryption scheme using a linear feedback shift register (LFSR), which generates pseudo-random numbers and shuffles the pixel position.
12
Image Encryption Scheme Based on Multiscale Block Compressed Sensing and Markov Model
Yuandi Shi,Yinan Hu,Bin Wang +2 more
TL;DR: In this article, a multiscale block compressed sensing (MBSS) based image encryption scheme is proposed, where the image is decomposed by a three-level wavelet transform, and the sampling rates of coefficient matrices at all levels are calculated according to multispectral block compression theory and the given compression ratio.
12
Secure Image Encryption Based on Compressed Sensing and Scrambling for Internet-of-Multimedia Things
01 Jan 2022
TL;DR: Wang et al. as discussed by the authors proposed a secure image encryption system based on compressed sensing (CS) with a scrambling mechanism, which uses a sparse measurement matrix, where the nonzero elements are generated by a linear feedback shift register (LFSR) based keystream generator.
References
Matching pursuits with time-frequency dictionaries
Stéphane Mallat,Zhifeng Zhang +1 more
TL;DR: The authors introduce an algorithm, called matching pursuit, that decomposes any signal into a linear expansion of waveforms that are selected from a redundant dictionary of functions, chosen in order to best match the signal structures.
10.2K
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Emmanuel J. Candès,Terence Tao +1 more
TL;DR: If the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program.
Decoding by linear programming
Emmanuel J. Candès,Terence Tao +1 more
TL;DR: F can be recovered exactly by solving a simple convex optimization problem (which one can recast as a linear program) and numerical experiments suggest that this recovery procedure works unreasonably well; f is recovered exactly even in situations where a significant fraction of the output is corrupted.
•Posted Content
Decoding by Linear Programming
Emmanuel J. Candès,Terence Tao +1 more
TL;DR: In this paper, it was shown that under suitable conditions on the coding matrix, the input vector can be recovered exactly by solving a simple convex optimization problem (which one can recast as a linear program).
6.8K
Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition
Y.C. Pati,R. Rezaiifar,Perinkulam S. Krishnaprasad +2 more
- 01 Nov 1993
TL;DR: A modification to the matching pursuit algorithm of Mallat and Zhang (1992) that maintains full backward orthogonality of the residual at every step and thereby leads to improved convergence is proposed.