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.

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.

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.

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.

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 Comprcssion 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.

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.

Primary Research of EIT Inverse Problem Based on CS （Compressed Sensing） Technique

EIT （electrical impedance tomography） problem should be represented by a group of partial differential equation, in numerical calculation： the nonlinear problem should be linearization approximately, and then linear equations set is obtained, so EIT image reconstruct problem should be considered as a classical ill-posed, ill-conditioned, linear inverse problem. Its biggest problem is the number of unknown is much more than the number of the equations, this result in the low imaging quality. Especially, it can not imaging in center area. For this problem, we induce the CS technique into EIT image reconstruction algorithm. The main contributions in this paper are： firstly, built up the relationship between CS and EIT definitely; secondly, sparse reconstruction is a critical step in CS, built up a general sparse regularization model based on EIT; finally, gives out some EIT imaging models based on sparse regularization method. For different scenarios, compared with traditional Tikhonov regularization （smooth regularization） method, sparse reconstruction method is not only better at anti-noise, and imaging in center area, but also faster and better resolution.

Compression and reconstruction of speech signals based on compressed sensing

Based on the approximate sparseness of speech in wavelet basis,a compressed sensing theory is applied to compress and reconstruct speech signals.Compared with one-dimensional orthogonal wavelet transform(OWT),two-dimensional OWT combined with Dmeyer and biorthogonal wavelet is firstly proposed to raise running efficiency in speech frame processing,furthermore,the threshold is set to improve the sparseness.Then an adaptive subgradient projection method(ASPM)is adopted for speech reconstruction in compressed sensing.Meanwhile,mechanism which adaptively adjusts inflation parameter in different iterations has been designed for fast convergence.Theoretical analysis and simulation results conclude that this algorithm has fast convergence,and lower reconstruction error,and also exhibits higher robustness in different noise intensities.

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.

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.

Intelligent Satin Bowerbird Optimizer Based Compression Technique for Remote Sensing Images

Due to latest advancements in the field of remote sensing,it becomes easier to acquire high quality images by the use of various satellites along with the sensing components.But the massive quantity of data poses a challenging issue to store and effectively transmit the remote sensing images.Therefore,image compression techniques can be utilized to process remote sensing images.In this aspect,vector quantization(VQ)can be employed for image compression and the widely applied VQ approach is Linde–Buzo–Gray(LBG)which creates a local optimum codebook for image construction.The process of constructing the codebook can be treated as the optimization issue and the metaheuristic algorithms can be utilized for resolving it.With this motivation,this article presents an intelligent satin bowerbird optimizer based compression technique(ISBO-CT)for remote sensing images.The goal of the ISBO-CT technique is to proficiently compress the remote sensing images by the effective design of codebook.Besides,the ISBO-CT technique makes use of satin bowerbird optimizer(SBO)with LBG approach is employed.The design of SBO algorithm for remote sensing image compression depicts the novelty of the work.To showcase the enhanced efficiency of ISBO-CT approach,an extensive range of simulations were applied and the outcomes reported the optimum performance of ISBO-CT technique related to the recent state of art image compression approaches.

Research on assessing compression quality taking into account the space-borne remote sensing images

According to the remote sensing image characteristics, a set oi optimized compression quahty assessment methods is proposed on the basis of generating simulative images. Firstly, a means is put forward that generates simulative images by scanning aerial films taking into account the space-borne remote sensing camera characteristics （including pixel resolution, histogram dynamic range and quantization）. In the course of compression quality assessment, the objective assessment considers images texture changes and mutual relationship between simulative images and decompressed ima- ges, while the synthesized estimation factor （SEF） is brought out innovatively for the first time. Subjective assessment adopts a display setup -- 0.5mrn/pixel, which considers human visual char- acteristic and mainstream monitor. The set of methods are applied in compression plan design of panchromatic camera loaded on ZY-1-02C satellite. Through systematic and comprehensive assess- ment, simulation results show that image compression quality with the compression ratio of d：l can meet the remote sensing application requirements.

Research on Data Compression of WSN Based on Compressed Sensing

For Wireless Sensor Networks （WSN） is responsible for sensing, collecting, processing and monitoring of environmental data, but it might be limited in resources. This paper describes in detail the compressed sensing theory, study the wireless sensor network data conventional compression and network coding method. The linear network coding scheme based on sparse random projection theory of compressed sensing. Simulation results show that this system satisfies the requirements of the reconstruction error of packets needed to reduce the number of nodes to the total number of 30%, improves the efficiency of data communications in wireless sensor network, reduce the energy consumption of the system. With other wireless sensor network data compression algorithm, the proposed algorithm has the advantages of simple realization, the compression effect is good, especially suitable for resource limited, and the accuracy requirements are not particularly stringent in wireless sensor networks.

Comparison of MRI Under-Sampling Techniques for Compressed Sensing with Translation Invariant Wavelets Using FastTestCS: A Flexible Simulation Tool

A sparsifying transform for use in Compressed Sensing (CS) is a vital piece of image reconstruction for Magnetic Resonance Imaging (MRI). Previously, Translation Invariant Wavelet Transforms (TIWT) have been shown to perform exceedingly well in CS by reducing repetitive line pattern image artifacts that may be observed when using orthogonal wavelets. To further establish its validity as a good sparsifying transform, the TIWT is comprehensively investigated and compared with Total Variation (TV), using six under-sampling patterns through simulation. Both trajectory and random mask based under-sampling of MRI data are reconstructed to demonstrate a comprehensive coverage of tests. Notably, the TIWT in CS reconstruction performs well for all varieties of under-sampling patterns tested, even for cases where TV does not improve the mean squared error. This improved Image Quality (IQ) gives confidence in applying this transform to more CS applications which will contribute to an even greater speed-up of a CS MRI scan. High vs low resolution time of flight MRI CS re-constructions are also analyzed showing how partial Fourier acquisitions must be carefully addressed in CS to prevent loss of IQ. In the spirit of reproducible research, novel software is introduced here as FastTestCS. It is a helpful tool to quickly develop and perform tests with many CS customizations. Easy integration and testing for the TIWT and TV minimization are exemplified. Simulations of 3D MRI datasets are shown to be efficiently distributed as a scalable solution for large studies. Comparisons in reconstruction computation time are made between the Wavelab toolbox and Gnu Scientific Library in FastTestCS that show a significant time savings factor of 60×. The addition of FastTestCS is proven to be a fast, flexible, portable and reproducible simulation aid for CS research.

Compressed sensing estimation of sparse underwater acoustic channels with a large time delay spread

The estimation of sparse underwater acoustic channels with a large time delay spread is investigated under the framework of compressed sensing. For these types of channels, the excessively long impulse response will significantly degrade the convergence rate and tracking capability of the traditional estimation algorithms such as least squares （LS）, while excluding the use of the delay-Doppler spread function due to huge computational complexity. By constructing a Toeplitz matrix with a training sequence as the measurement matrix, the estimation problem of long sparse acoustic channels is formulated into a compressed sensing problem to facilitate the efficient exploitation of sparsity. Furthermore, unlike the traditional l1 norm or exponent-based approximation l0 norm sparse recovery strategy, a novel variant of approximate l0 norm called AL0 is proposed, minimization of which leads to the derivation of a hybrid approach by iteratively projecting the steepest descent solution to the feasible set. Numerical simulations as well as sea trial experiments are compared and analyzed to demonstrate the superior performance of the proposed algorithm.

Digital broadcast channel estimation with compressive sensing

In order to reduce the pilot number and improve spectral efficiency, recently emerged compressive sensing （CS） is applied to the digital broadcast channel estimation. According to the six channel profiles of the European Telecommunication Standards Institute（ETSI） digital radio mondiale （DRM） standard, the subspace pursuit （SP） algorithm is employed for delay spread and attenuation estimation of each path in the case where the channel profile is identified and the multipath number is known. The stop condition for SP is that the sparsity of the estimation equals the multipath number. For the case where the multipath number is unknown, the orthogonal matching pursuit （OMP） algorithm is employed for channel estimation, while the stop condition is that the estimation achieves the noise variance. Simulation results show that with the same number of pilots, CS algorithms outperform the traditional cubic-spline-interpolation-based least squares （LS） channel estimation. SP is also demonstrated to be better than OMP when the multipath number is known as a priori.

基于Compressed Sensing框架的图像多描述编码方法

基于新兴的压缩感知(Compressed Sensing,CS)理论,提出了一种抗丢包能力强且结构简单易实现的多描述编码方法.首先对变换后的图像进行交织抽取分块,再对各子块进行随机观测、量化、打包形成多个描述子码流.解码端根据接收码流情况通过求解优化问题重建原图像.由于随机观测过程简单易实现,故该方法可以以较低的计算复杂度构造出较多的描述子.实验结果表明,在同样的丢包率下,本文方法的重构质量(PSNR)明显优于SPIHT多描述编码方法,且计算复杂度较低.