Color Image Compression and Encryption Algorithm Based on 2D Compressed Sensing and Hyperchaotic System

With the advent of the information security era,it is necessary to guarantee the privacy,accuracy,and dependable transfer of pictures.This study presents a new approach to the encryption and compression of color images.It is predicated on 2D compressed sensing(CS)and the hyperchaotic system.First,an optimized Arnold scrambling algorithm is applied to the initial color images to ensure strong security.Then,the processed images are con-currently encrypted and compressed using 2D CS.Among them,chaotic sequences replace traditional random measurement matrices to increase the system’s security.Third,the processed images are re-encrypted using a combination of permutation and diffusion algorithms.In addition,the 2D projected gradient with an embedding decryption(2DPG-ED)algorithm is used to reconstruct images.Compared with the traditional reconstruction algorithm,the 2DPG-ED algorithm can improve security and reduce computational complexity.Furthermore,it has better robustness.The experimental outcome and the performance analysis indicate that this algorithm can withstand malicious attacks and prove the method is effective.

Chaotic CS Encryption:An Efficient Image Encryption Algorithm Based on Chebyshev Chaotic System and Compressive Sensing

Images are the most important carrier of human information. Moreover, how to safely transmit digital imagesthrough public channels has become an urgent problem. In this paper, we propose a novel image encryptionalgorithm, called chaotic compressive sensing (CS) encryption (CCSE), which can not only improve the efficiencyof image transmission but also introduce the high security of the chaotic system. Specifically, the proposed CCSEcan fully leverage the advantages of the Chebyshev chaotic system and CS, enabling it to withstand various attacks,such as differential attacks, and exhibit robustness. First, we use a sparse trans-form to sparse the plaintext imageand then use theArnold transformto perturb the image pixels. After that,we elaborate aChebyshev Toeplitz chaoticsensing matrix for CCSE. By using this Toeplitz matrix, the perturbed image is compressed and sampled to reducethe transmission bandwidth and the amount of data. Finally, a bilateral diffusion operator and a chaotic encryptionoperator are used to perturb and expand the image pixels to change the pixel position and value of the compressedimage, and ultimately obtain an encrypted image. Experimental results show that our method can be resistant tovarious attacks, such as the statistical attack and noise attack, and can outperform its current competitors.

Fast compressed sensing spectral measurement with adaptive gradient multiscale resolution

We propose a fast,adaptive multiscale resolution spectral measurement method based on compressed sensing.The method can apply variable measurement resolution over the entire spectral range to reduce the measurement time by over 75%compared to a global high-resolution measurement.Mimicking the characteristics of the human retina system,the resolution distribution follows the principle of gradually decreasing.The system allows the spectral peaks of interest to be captured dynamically or to be specified a priori by a user.The system was tested by measuring single and dual spectral peaks,and the results of spectral peaks are consistent with those of global high-resolution measurements.

Enhancing visual security: An image encryption scheme based on parallel compressive sensing and edge detection embedding

A novel image encryption scheme based on parallel compressive sensing and edge detection embedding technology is proposed to improve visual security. Firstly, the plain image is sparsely represented using the discrete wavelet transform.Then, the coefficient matrix is scrambled and compressed to obtain a size-reduced image using the Fisher–Yates shuffle and parallel compressive sensing. Subsequently, to increase the security of the proposed algorithm, the compressed image is re-encrypted through permutation and diffusion to obtain a noise-like secret image. Finally, an adaptive embedding method based on edge detection for different carrier images is proposed to generate a visually meaningful cipher image. To improve the plaintext sensitivity of the algorithm, the counter mode is combined with the hash function to generate keys for chaotic systems. Additionally, an effective permutation method is designed to scramble the pixels of the compressed image in the re-encryption stage. The simulation results and analyses demonstrate that the proposed algorithm performs well in terms of visual security and decryption quality.

Three-Stages Hyperspectral Image Compression Sensing with Band Selection

Compressed sensing(CS),as an efficient data transmission method,has achieved great success in the field of data transmission such as image,video and text.It can robustly recover signals from fewer Measurements,effectively alleviating the bandwidth pressure during data transmission.However,CS has many shortcomings in the transmission of hyperspectral image(HSI)data.This work aims to consider the application of CS in the transmission of hyperspectral image(HSI)data,and provides a feasible research scheme for CS of HSI data.HSI has rich spectral information and spatial information in bands,which can reflect the physical properties of the target.Most of the hyperspectral image compressed sensing(HSICS)algorithms cannot effectively use the inter-band information of HSI,resulting in poor reconstruction effects.In this paper,A three-stage hyperspectral image compression sensing algorithm(Three-stages HSICS)is proposed to obtain intra-band and inter-band characteristics of HSI,which can improve the reconstruction accuracy of HSI.Here,we establish a multi-objective band selection(Mop-BS)model,amulti-hypothesis prediction(MHP)model and a residual sparse(ReWSR)model for HSI,and use a staged reconstruction method to restore the compressed HSI.The simulation results show that the three-stage HSICS successfully improves the reconstruction accuracy of HSICS,and it performs best among all comparison algorithms.

Deformation and failure characteristics of sandstone under uniaxial compression using distributed fiber optic strain sensing

This paper investigates the deformation and fracture propagation of sandstone specimen under uniaxial compression using the distributed fiber optic strain sensing(DFOSS)technology.It shows that the DFOSS-based circumferential strains are in agreement with the data monitored with the traditional strain gage.The DFOSS successfully scans the full-field view of axial and circumferential strains on the specimen surface.The spatiotemporal strain measurement based on DFOSS manifests crack closure and elastoplastic deformation,detects initialization of microcrack nucleation,and identifies strain localization within the specimen.The DFOSS well observes the effects of rock heterogeneity on rock deformation.The advantage of DFOSS-based strain acquisition includes the high spatiotemporal resolution of signals and the ability of full-surface strain scanning.The introduction to the DFOSS technology yields a better understanding of the rock damage process under uniaxial compression.

Airborne sparse flight array SAR 3D imaging based on compressed sensing in frequency domain

In airborne array synthetic aperture radar(SAR), the three-dimensional(3D) imaging performance and cross-track resolution depends on the length of the equivalent array. In this paper, Barker sequence criterion is used for sparse flight sampling of airborne array SAR, in order to obtain high cross-track resolution in as few times of flights as possible. Under each flight, the imaging algorithm of back projection(BP) and the data extraction method based on modified uniformly redundant arrays(MURAs) are utilized to obtain complex 3D image pairs. To solve the side-lobe noise in images, the interferometry between each image pair is implemented, and compressed sensing(CS) reconstruction is adopted in the frequency domain. Furthermore, to restore the geometrical relationship between each flight, the phase information corresponding to negative MURA is compensated on each single-pass image reconstructed by CS. Finally,by coherent accumulation of each complex image, the high resolution in cross-track direction is obtained. Simulations and experiments in X-band verify the availability.

Lossless embedding: A visually meaningful image encryption algorithm based on hyperchaos and compressive sensing

A novel visually meaningful image encryption algorithm is proposed based on a hyperchaotic system and compressive sensing(CS), which aims to improve the visual security of steganographic image and decrypted quality. First, a dynamic spiral block scrambling is designed to encrypt the sparse matrix generated by performing discrete wavelet transform(DWT)on the plain image. Then, the encrypted image is compressed and quantified to obtain the noise-like cipher image. Then the cipher image is embedded into the alpha channel of the carrier image in portable network graphics(PNG) format to generate the visually meaningful steganographic image. In our scheme, the hyperchaotic Lorenz system controlled by the hash value of plain image is utilized to construct the scrambling matrix, the measurement matrix and the embedding matrix to achieve higher security. In addition, compared with other existing encryption algorithms, the proposed PNG-based embedding method can blindly extract the cipher image, thus effectively reducing the transmission cost and storage space. Finally, the experimental results indicate that the proposed encryption algorithm has very high visual security.

Regularization by Multiple Dual Frames for Compressed Sensing Magnetic Resonance Imaging With Convergence Analysis

Plug-and-play priors are popular for solving illposed imaging inverse problems. Recent efforts indicate that the convergence guarantee of the imaging algorithms using plug-andplay priors relies on the assumption of bounded denoisers. However, the bounded properties of existing plugged Gaussian denoisers have not been proven explicitly. To bridge this gap, we detail a novel provable bounded denoiser termed as BMDual,which combines a trainable denoiser using dual tight frames and the well-known block-matching and 3D filtering(BM3D)denoiser. We incorporate multiple dual frames utilized by BMDual into a novel regularization model induced by a solver. The proposed regularization model is utilized for compressed sensing magnetic resonance imaging(CSMRI). We theoretically show the bound of the BMDual denoiser, the bounded gradient of the CSMRI data-fidelity function, and further demonstrate that the proposed CSMRI algorithm converges. Experimental results also demonstrate that the proposed algorithm has a good convergence behavior, and show the effectiveness of the proposed algorithm.

Optical image encryption algorithm based on a new four-dimensional memristive hyperchaotic system and compressed sensing

Some existing image encryption schemes use simple low-dimensional chaotic systems, which makes the algorithms insecure and vulnerable to brute force attacks and cracking. Some algorithms have issues such as weak correlation with plaintext images, poor image reconstruction quality, and low efficiency in transmission and storage. To solve these issues,this paper proposes an optical image encryption algorithm based on a new four-dimensional memristive hyperchaotic system(4D MHS) and compressed sensing(CS). Firstly, this paper proposes a new 4D MHS, which has larger key space, richer dynamic behavior, and more complex hyperchaotic characteristics. The introduction of CS can reduce the image size and the transmission burden of hardware devices. The introduction of double random phase encoding(DRPE) enables this algorithm has the ability of parallel data processing and multi-dimensional coding space, and the hyperchaotic characteristics of 4D MHS make up for the nonlinear deficiency of DRPE. Secondly, a construction method of the deterministic chaotic measurement matrix(DCMM) is proposed. Using DCMM can not only save a lot of transmission bandwidth and storage space, but also ensure good quality of reconstructed images. Thirdly, the confusion method and diffusion method proposed are related to plaintext images, which require both four hyperchaotic sequences of 4D MHS and row and column keys based on plaintext images. The generation process of hyperchaotic sequences is closely related to the hash value of plaintext images. Therefore, this algorithm has high sensitivity to plaintext images. The experimental testing and comparative analysis results show that proposed algorithm has good security and effectiveness.

A High-Quality Adaptive Video Reconstruction Optimization Method Based on Compressed Sensing

The video compression sensing method based onmulti hypothesis has attracted extensive attention in the research of video codec with limited resources.However,the formation of high-quality prediction blocks in the multi hypothesis prediction stage is a challenging task.To resolve this problem,this paper constructs a novel compressed sensing-based high-quality adaptive video reconstruction optimizationmethod.Itmainly includes the optimization of prediction blocks(OPBS),the selection of searchwindows and the use of neighborhood information.Specifically,the OPBS consists of two parts:the selection of blocks and the optimization of prediction blocks.We combine the high-quality optimization reconstruction of foreground block with the residual reconstruction of the background block to improve the overall reconstruction effect of the video sequence.In addition,most of the existing methods based on predictive residual reconstruction ignore the impact of search windows and reference frames on performance.Therefore,Block-level search window(BSW)is constructed to cover the position of the optimal hypothesis block as much as possible.To maximize the availability of reference frames,Nearby reference frame information(NRFI)is designed to reconstruct the current block.The proposed method effectively suppresses the influence of the fluctuation of the prediction block on reconstruction and improves the reconstruction performance.Experimental results showthat the proposed compressed sensing-based high-quality adaptive video reconstruction optimization method significantly improves the reconstruction performance in both objective and supervisor quality.

Research on Asymmetric Fault Location of Wind Farm Collection System Based on Compressed Sensing

Aiming at the problem that most of the cables in the power collection systemof offshore wind farms are buried deep in the seabed,whichmakes it difficult to detect faults,this paper proposes a two-step fault location method based on compressed sensing and ranging equation.The first step is to determine the fault zone through compressed sensing,and improve the datameasurement,dictionary design and algorithmreconstruction:Firstly,the phase-locked loop trigonometric functionmethod is used to suppress the spike phenomenon when extracting the fault voltage,so that the extracted voltage valuewillnot have a large error due to the voltage fluctuation.Secondly,theλ-NIM dictionary is designed by using the node impedancematrix and the fault location coefficient to further reduce the influence of pseudo-fault points.Finally,the CoSaMP algorithmis improved with the generalized Jaccard coefficient to improve the reconstruction accuracy.The second step is to use the ranging equation to accurately locate the asymmetric fault of the wind farm collection system on the basis of determining the fault interval.The simulation results show that the proposedmethod ismore accurate than the compressedsensingmethod andimpedancemethod in fault section location and fault location accuracy,the relative error is reduced from 0.75%to 0.4%,and has a certain anti-noise ability.

Optimized Three-Dimensional Cardiovascular Magnetic Resonance Whole Heart Imaging Utilizing Non-Selective Excitation and Compressed Sensing in Children and Adults with Congenital Heart Disease

Background:In congenital heart disease(CHD)patients,detailed three-dimensional anatomy depiction plays a pivotal role for diagnosis and therapeutical decision making.Hence,the present study investigated the applicability of an advanced cardiovascular magnetic resonance(CMR)whole heart imaging approach utilizing nonselective excitation and compressed sensing for anatomical assessment and interventional guidance of CHD patients in comparison to conventional dynamic CMR angiography.Methods:86 consecutive pediatric patients and adults with congenital heart disease(age,1 to 74 years;mean,35 years)underwent CMR imaging including a freebreathing,ECG-triggered 3D nonselective SSFP whole heart acquisition using compressed SENSE(nsWHcs).Anatomical assessability and signal intensity ratio(SIR)measurements were compared with conventional dynamic 3D-/4D-MR angiography.Results:The most frequent diagnoses were partial anomalous pulmonary venous drainage(17/86,20%),transposition of the great arteries(15/86,17%),tetralogy of Fallot(12/86,14%),and a single ventricle(7/86,8%).Image quality of nsWHcs was rated as excellent/good in 98%of patients.nsWHcs resulted in a reliable depiction of all large thoracic vessels(anatomic assessability,99%–100%)and the proximal segments of coronary arteries and coronary sinus(>90%).nsWHcs achieved a homogenously distributed SIR in all cardiac cavities and thoracic vessels without a significant difference between pulmonary and systemic circulation(10.9±3.5 and 10.6±3.4;p=0.15),while 3D angiography showed significantly increased SIR for targeted vs.non-targeted circulation(PA-angiography,15.2±8.1 vs.5.8±3.6,p<0.001;PV-angiography,7.0±3.9 vs.17.3±6.8,p<0.001).Conclusions:The proposed nsWHcs imaging approach provided a consistently high image quality and a homogeneous signal intensity distribution within the pulmonary and systemic circulation in pediatric patients and adults with a wide spectrum of congenital heart diseases.nsWHcs enabled detailed anatomical assessment and three-dimensional reconstruction of all cardiac cavities and large thoracic vessels and can be regarded particularly useful for preprocedural planning and interventional guidance in CHD patients.

A Noise Reduction Method for Multiple Signals Combining Computed Order Tracking Based on Chirplet Path Pursuit and Distributed Compressed Sensing

With the development of multi-signal monitoring technology,the research on multiple signal analysis and processing has become a hot subject.Mechanical equipment often works under variable working conditions,and the acquired vibration signals are often non-stationary and nonlinear,which are difficult to be processed by traditional analysis methods.In order to solve the noise reduction problem of multiple signals under variable speed,a COT-DCS method combining the Computed Order Tracking(COT)based on Chirplet Path Pursuit(CPP)and Distributed Compressed Sensing(DCS)is proposed.Firstly,the instantaneous frequency(IF)is extracted by CPP,and the speed is obtained by fitting.Then,the speed is used for equal angle sampling of time-domain signals,and angle-domain signals are obtained by COT without a tachometer to eliminate the nonstationarity,and the angledomain signals are compressed and reconstructed by DCS to achieve noise reduction of multiple signals.The accuracy of the CPP method is verified by simulated,experimental signals and compared with some existing IF extraction methods.The COT method also shows good signal stabilization ability through simulation and experiment.Finally,combined with the comparative test of the other two algorithms and four noise reduction effect indicators,the COT-DCS based on the CPP method combines the advantages of the two algorithms and has better noise reduction effect and stability.It is shown that this method is an effective multi-signal noise reduction method.

Reduced Imaging Time and Improved Image Quality of 3D Isotropic T2-Weighted Magnetic Resonance Imaging with Compressed Sensing for the Female Pelvis

This study is to compare three-dimensional(3D)isotropic T2-weighted magnetic resonance imaging(MRI)with compressed sensing-sampling perfection with application optimized contrast(CS-SPACE)and the conventional image(3D-SPACE)sequence in terms of image quality,estimated signal-to-noise ratio(SNR),relative contrast-to-noise ratio(CNR),and the lesions’conspicuous of the female pelvis.Thirty-six females(age:51,28-73)with cervical carcinoma(n=20),rectal carcinoma(n=7),or uterine fibroid(n=9)were included.Patients underwent magnetic resonance(MR)imaging at a 3T scanner with the sequences of 3D-SPACE,CS-SPACE,and twodimensional(2D)T2-weighted turbo-spin echo(TSE).Quantitative analyses of estimated SNR and relative CNR between tumors and other tissues,image quality,and tissue conspicuity were performed.Two radiologists assessed the difference in diagnostic findings for carcinoma.Quantitative values and qualitative scores were analyzed,respectively.The estimated SNR and the relative CNR of tumor-to-muscle obturator internus,tumor-to-myometrium,and myometrium-to-muscle obturator internus was comparable between 3D-SPACE and CS-SPACE.The overall image quality and the conspicuity of the lesion scores of the CS-SPACE were higher than that of the 3D-SPACE(P<0.01).The CS-SPACE sequence offers shorter scan time,fewer artifacts,and comparable SNR and CNR to conventional 3D-SPACE,and has the potential to improve the performance of T2-weighted images.

Compression of ECG Signal Based on Compressive Sensing and the Extraction of Significant Features

Diagnoses of heart diseases can be done effectively on long term recordings of ECG signals that preserve the signals’ morphologies. In these cases, the volume of the ECG data produced by the monitoring systems grows significantly. To make the mobile healthcare possible, the need for efficient ECG signal compression algorithms to store and/or transmit the signal efficiently has been rising exponentially. Currently, ECG signal is acquired at Nyquist rate or higher, thus introducing redundancies between adjacent heartbeats due to its quasi-periodic structure. Existing compression methods remove these redundancies by achieving compression and facilitate transmission of the patient’s imperative information. Based on the fact that these signals can be approximated by a linear combination of a few coefficients taken from different basis, an alternative new compression scheme based on Compressive Sensing (CS) has been proposed. CS provides a new approach concerned with signal compression and recovery by exploiting the fact that ECG signal can be reconstructed by acquiring a relatively small number of samples in the “sparse” domains through well-developed optimization procedures. In this paper, a single-lead ECG compression method has been proposed based on improving the signal sparisty through the extraction of the signal significant features. The proposed method starts with a preprocessing stage that detects the peaks and periods of the Q, R and S waves of each beat. Then, the QRS-complex for each signal beat is estimated. The estimated QRS-complexes are subtracted from the original ECG signal and the resulting error signal is compressed using the CS technique. Throughout this process, DWT sparsifying dictionaries have been adopted. The performance of the proposed algorithm, in terms of the reconstructed signal quality and compression ratio, is evaluated by adopting DWT spatial domain basis applied to ECG records extracted from the MIT-BIH Arrhythmia Database. The results indicate that average compression ratio of 11:1 with PRD1 = 1.2% are obtained. Moreover, the quality of the retrieved signal is guaranteed and the compression ratio achieved is an improvement over those obtained by previously reported algorithms. Simulation results suggest that CS should be considered as an acceptable methodology for ECG compression.

A SPARSITY AND COMPRESSION RATIO JOINT ADJUSTMENT METHOD FOR COLLABORATIVE SPECTRUM SENSING

Spectrum sensing is the fundamental task for Cognitive Radio (CR). To overcome the challenge of high sampling rate in traditional spectral estimation methods, Compressed Sensing (CS) theory is developed. A sparsity and compression ratio joint adjustment algorithm for compressed spectrum sensing in CR network is investigated, with the hypothesis that the sparsity level is unknown as priori knowledge at CR terminals. As perfect spectrum reconstruction is not necessarily required during spectrum detection process, the proposed algorithm only performs a rough estimate of sparsity level. Meanwhile, in order to further reduce the sensing measurement, different compression ratios for CR terminals with varying Signal-to-Noise Ratio (SNR) are considered. The proposed algorithm, which optimizes the compression ratio as well as the estimated sparsity level, can greatly reduce the sensing measurement without degrading the detection performance. It also requires less steps of iteration for convergence. Corroborating simulation results are presented to testify the effectiveness of the proposed algorithm for collaborative spectrum sensing.

An underwater acoustic data compression method based on compressed sensing

The use of underwater acoustic data has rapidly expanded with the application of multichannel, large-aperture underwater detection arrays. This study presents an underwater acoustic data compression method that is based on compressed sensing. Underwater acoustic signals are transformed into the sparse domain for data storage at a receiving terminal, and the improved orthogonal matching pursuit(IOMP) algorithm is used to reconstruct the original underwater acoustic signals at a data processing terminal. When an increase in sidelobe level occasionally causes a direction of arrival estimation error, the proposed compression method can achieve a 10 times stronger compression for narrowband signals and a 5 times stronger compression for wideband signals than the orthogonal matching pursuit(OMP) algorithm. The IOMP algorithm also reduces the computing time by about 20% more than the original OMP algorithm. The simulation and experimental results are discussed.

A LOSSLESS COMPRESSION ALGORITHM OF REMOTE SENSING IMAGE FOR SPACE APPLICATIONS

A simple and adaptive lossless compression algorithm is proposed for remote sensing image compression,which includes integer wavelet transform and the Rice entropy coder.By analyzing the probability distribution of integer wavelet transform coefficients and the characteristics of Rice entropy coder,the divide and rule method is used for high-frequency sub-bands and low-frequency one.High-frequency sub-bands are coded by the Rice entropy coder,and low-frequency coefficients are predicted before coding.The role of predictor is to map the low-frequency coefficients into symbols suitable for the entropy coding.Experimental results show that the average Compression Ratio(CR) of our approach is about two,which is close to that of JPEG 2000.The algorithm is simple and easy to be implemented in hardware.Moreover,it has the merits of adaptability,and independent data packet.So the algorithm can adapt to space lossless compression applications.

Combination of multi-focus Raman spectroscopy and compressive sensing for parallel monitoring of single-cell dynamics

To overcome the low efficiency of conventional confocal Raman spectroscopy,many efforts have been devoted to parallelizing the Raman excitation and acquisition,in which the scattering from multiple foci is projected onto different locations on a spectrometer's CCD,along either its vertical,horizontal dimension,or even both.While the latter projection scheme relieves the limitation on the row numbers of the CCD,the spectra of multiple foci are recorded in one spectral channel,resulting in spectral overlapping.Here,we developed a method under a com-pressive sensing framework to demultiplex the superimposed spectra of multiple cells during their dynamic processes.Unlike the previous methods which ignore the information connection be-tween the spectra of the cells recorded at different time,the proposed method utilizes a prior that a cell's spectra acquired at different time have the same sparsity structure in their principal components.Rather than independently demultiplexing the mixed spectra at the individual time intervals,the method demultiplexes the whole spectral sequence acquired continuously during the dynamic process.By penalizing the sparsity combined from all time intervals,the collaborative optimization of the inversion problem gave more accurate recovery results.The performances of the method were substantiated by a 1D Raman tweezers array,which monitored the germination of multiple bacterial spores.The method can be extended to the monitoring of many living cells randomly scattering on a coverslip,and has a potential to improve the throughput by a few orders.