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.

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.

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.

Investigation of prior image constrained compressed sensing-based spectral X-ray CT image reconstruction

To improve spectral X-ray CT reconstructed image quality, the energy-weighted reconstructed image xbins^W and the separable paraboloidal surrogates（SPS） algorithm are proposed for the prior image constrained compressed sensing（PICCS）-based spectral X-ray CT image reconstruction. The PICCS-based image reconstruction takes advantage of the compressed sensing theory, a prior image and an optimization algorithm to improve the image quality of CT reconstructions.To evaluate the performance of the proposed method, three optimization algorithms and three prior images are employed and compared in terms of reconstruction accuracy and noise characteristics of the reconstructed images in each energy bin.The experimental simulation results show that the image xbins^W is the best as the prior image in general with respect to the three optimization algorithms; and the SPS algorithm offers the best performance for the simulated phantom with respect to the three prior images. Compared with filtered back-projection（FBP）, the PICCS via the SPS algorithm and xbins^W as the prior image can offer the noise reduction in the reconstructed images up to 80. 46%, 82. 51%, 88. 08% in each energy bin,respectively. M eanwhile, the root-mean-squared error in each energy bin is decreased by 15. 02%, 18. 15%, 34. 11% and the correlation coefficient is increased by 9. 98%, 11. 38%,15. 94%, respectively.

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.

Algorithm for reconstructing compressed sensing color imaging using the quaternion total variation

A new method for reconstructing the compressed sensing color image by solving an optimization problem based on total variation in the quaternion field is proposed, which can effectively improve the reconstructing ability of the color image. First, the color image is converted from RGB （red, green, blue） space to CMYK （cyan, magenta, yellow, black） space, which is assigned to a quaternion matrix. Meanwhile, the quaternion matrix is converted into the information of the phase and amplitude by the Euler form of the quatemion. Secondly, the phase and amplitude of the quatemion matrix are used as the smoothness constraints for the compressed sensing （CS） problem to make the reconstructing results more accurate. Finally, an iterative method based on gradient is used to solve the CS problem. Experimental results show that by considering the information of the phase and amplitude, the proposed method can achieve better performance than the existing method that treats the three components of the color image as independent parts.

Low sidelobe robust imaging in random frequency-hopping wideband radar based on compressed sensing

High resolution range imaging with correlation processing suffers from high sidelobe pedestal in random frequency-hopping wideband radar. After the factors which affect the sidelobe pedestal being analyzed, a compressed sensing based algorithm for high resolution range imaging and a new minimized ll-norm criterion for motion compensation are proposed. The random hopping of the transmitted carrier frequency is converted to restricted isometry property of the observing matrix. Then practical problems of imaging model solution and signal parameter design are resolved. Due to the particularity of the proposed algorithm, two new indicators of range profile, i.e., average signal to sidelobe ratio and local similarity, are defined. The chamber measured data are adopted to testify the validity of the proposed algorithm, and simulations are performed to analyze the precision of velocity measurement as well as the performance of motion compensation. The simulation results show that the proposed algorithm has such advantages as high precision velocity measurement, low sidelobe and short period imaging, which ensure robust imaging for moving targets when signal-to-noise ratio is above 10 dB.

An improved Gaussian frequency domain sparse inversion method based on compressed sensing

The traditional compressed sensing method for improving resolution is realized in the frequency domain.This method is aff ected by noise,which limits the signal-to-noise ratio and resolution,resulting in poor inversion.To solve this problem,we improved the objective function that extends the frequency domain to the Gaussian frequency domain having denoising and smoothing characteristics.Moreover,the reconstruction of the sparse refl ection coeffi cient is implemented by the mixed L1_L2 norm algorithm,which converts the L0 norm problem into an L1 norm problem.Additionally,a fast threshold iterative algorithm is introduced to speed up convergence and the conjugate gradient algorithm is used to achieve debiasing for eliminating the threshold constraint and amplitude error.The model test indicates that the proposed method is superior to the conventional OMP and BPDN methods.It not only has better denoising and smoothing eff ects but also improves the recognition accuracy of thin interbeds.The actual data application also shows that the new method can eff ectively expand the seismic frequency band and improve seismic data resolution,so the method is conducive to the identifi cation of thin interbeds for beach-bar sand reservoirs.

Novel imaging methods of stepped frequency radar based on compressed sensing

The theory of compressed sensing （CS） provides a new chance to reduce the data acquisition time and improve the data usage factor of the stepped frequency radar system. In light of the sparsity of radar target reflectivity, two imaging methods based on CS, termed the CS-based 2D joint imaging algorithm and the CS-based 2D decoupled imaging algorithm, are proposed. These methods incorporate the coherent mixing operation into the sparse dictionary, and take random measurements in both range and azimuth directions to get high resolution radar images, thus can remarkably reduce the data rate and simplify the hardware design of the radar system while maintaining imaging quality. Ex- periments from both simulated data and measured data in the anechoic chamber show that the proposed imaging methods can get more focused images than the traditional fast Fourier trans- form method. Wherein the joint algorithm has stronger robustness and can provide clearer inverse synthetic aperture radar images, while the decoupled algorithm is computationally more efficient but has slightly degraded imaging quality, which can be improved by increasing measurements or using a robuster recovery algorithm nevertheless.

Identification of denatured and normal biological tissues based on compressed sensing and refined composite multi-scale fuzzy entropy during high intensity focused ultrasound treatment

In high intensity focused ultrasound(HIFU)treatment,it is crucial to accurately identify denatured and normal biological tissues.In this paper,a novel method based on compressed sensing(CS)and refined composite multi-scale fuzzy entropy(RCMFE)is proposed.First,CS is used to denoise the HIFU echo signals.Then the multi-scale fuzzy entropy(MFE)and RCMFE of the denoised HIFU echo signals are calculated.This study analyzed 90 cases of HIFU echo signals,including 45 cases in normal status and 45 cases in denatured status,and the results show that although both MFE and RCMFE can be used to identify denatured tissues,the intra-class distance of RCMFE on each scale factor is smaller than MFE,and the inter-class distance is larger than MFE.Compared with MFE,RCMFE can calculate the complexity of the signal more accurately and improve the stability,compactness,and separability.When RCMFE is selected as the characteristic parameter,the RCMFE difference between denatured and normal biological tissues is more evident than that of MFE,which helps doctors evaluate the treatment effect more accurately.When the scale factor is selected as 16,the best distinguishing effect can be obtained.

Wavelet Transform-Based Distributed Compressed Sensing in Wireless Sensor Networks

Wireless Sensor Networks(WSN) are mainly characterized by a potentially large number of distributed sensor nodes which collectively transmit information about sensed events to the sink.In this paper,we present a Distributed Wavelet Basis Generation(DWBG) algorithm performing at the sink to obtain the distributed wavelet basis in WSN.And on this basis,a Wavelet Transform-based Distributed Compressed Sensing(WTDCS) algorithm is proposed to compress and reconstruct the sensed data with spatial correlation.Finally,we make a detailed analysis of relationship between reconstruction performance and WTDCS algorithm parameters such as the compression ratio,the channel Signal-to-Noise Ratio(SNR),the observation noise power and the correlation decay parameter by simulation.The simulation results show that WTDCS can achieve high performance in terms of energy and reconstruction accuracy,as compared to the conventional distributed wavelet transform algorithm.

Data Traffic Reduction with Compressed Sensing in an AIoT System

To provide Artificial Intelligence(AI)services such as object detection,Internet of Things(IoT)sensor devices should be able to send a large amount of data such as images and videos.However,this inevitably causes IoT networks to be severely overloaded.In this paper,therefore,we propose a novel oneM2M-compliant Artificial Intelligence of Things(AIoT)system for reducing overall data traffic and offering object detection.It consists of some IoT sensor devices with random sampling functions controlled by a compressed sensing(CS)rate,an IoT edge gateway with CS recovery and domain transform functions related to compressed sensing,and a YOLOv5 deep learning function for object detection,and an IoT server.By analyzing the effects of compressed sensing on data traffic reduction in terms of data rate per IoT sensor device,we showed that the proposed AIoT system can reduce the overall data traffic by changing compressed sensing rates of random sampling functions in IoT sensor devices.In addition,we analyzed the effects of the compressed sensing on YOLOv5 object detection in terms of performance metrics such as recall,precision,mAP50,and mAP,and found that recall slightly decreases but precision remains almost constant even though the compressed sensing rate decreases and that mAP50 and mAP are gradually degraded according to the decreased compressed sensing rate.Consequently,if proper compressed sensing rates are chosen,the proposed AIoT system will reduce the overall data traffic without significant performance degradation of YOLOv5.

Compressed Sensing： Optimized Overcomplete Dictionary for Underwater Acoustic Channel Estimation

Compressed Sensing （CS） offers a method to solve the channel estimation problems for an underwater acoustic system, based on the existence of a sparse representation of the treated signal and an overcomplete dictionary with a set of non-orthogonal bases. In this paper, we proposed a new approach to optimize dictionaries by decreasing the average measure of the mutual coherence of the effective dictionary. A fixed link between the average mutual coherence and the CS perforrmnce is indicated by designing three factors： operating bandwidth, the number of pilot subcarriers, and coherence bandwidth. Both the Orthogonal Matching Pursuit （OMP） and the Basis Pursuit De-Noising （BPDN） are compared to the Dantzig Selector （DS） for different Signal Noise Ratio （SNR） and shown to benefit from the newly designed dictionary. Nurnerical sinmlations and experimental data of an OFDM receiver are used to evaluate the proposed method in comparison with the conventional LeastSquare （LS） estirmtor. The results show that the dictionary with a better condition considerably improves the perforrmnce of the channel estimation.

Sensing Matrix Optimization for Multi-Target Localization Using Compressed Sensing in Wireless Sensor Network

In the multi-target localization based on Compressed Sensing(CS),the sensing matrix's characteristic is significant to the localization accuracy.To improve the CS-based localization approach's performance,we propose a sensing matrix optimization method in this paper,which considers the optimization under the guidance of the t%-averaged mutual coherence.First,we study sensing matrix optimization and model it as a constrained combinatorial optimization problem.Second,the t%-averaged mutual coherence is adopted as the optimality index to evaluate the quality of different sensing matrixes,where the threshold t is derived through the K-means clustering.With the settled optimality index,a hybrid metaheuristic algorithm named Genetic Algorithm-Tabu Local Search(GA-TLS)is proposed to address the combinatorial optimization problem to obtain the final optimized sensing matrix.Extensive simulation results reveal that the CS localization approaches using different recovery algorithms benefit from the proposed sensing matrix optimization method,with much less localization error compared to the traditional sensing matrix optimization methods.

Compressed sensing based channel estimation for fast fading OFDM systems

A compressed sensing（CS） based channel estimation algorithm is proposed by using the delay-Doppler sparsity of the fast fading channel.A compressive basis expansion channel model with sparsity in both time and frequency domains is given.The pilots in accordance with a novel random pilot matrix in both time and frequency domains are sent to measure the delay-Doppler sparsity channel.The relatively nonzero channel coefficients are tracked by random pilots at a sampling rate significantly below the Nyquist rate.The sparsity channels are estimated from a very limited number of channel measurements by the basis pursuit algorithm.The proposed algorithm can effectively improve the channel estimation performance when the number of pilot symbols is reduced with improvement of throughput efficiency.

COOPERATIVE WIDEBAND SPECTRUM SENSING BASED ON SEQUENTIAL COMPRESSED SENSING

Compressed sensing offers a new wideband spectrum sensing scheme in Cognitive Radio (CR). A major challenge of this scheme is how to determinate the required measurements while the signal sparsity is not known a priori. This paper presents a cooperative sensing scheme based on se-quential compressed sensing where sequential measurements are collected from the analog-to-information converters. A novel cooperative compressed sensing recovery algorithm named Simul-taneous Sparsity Adaptive Matching Pursuit (SSAMP) is utilized for sequential compressed sensing in order to estimate the reconstruction errors and determinate the minimal number of required meas-urements. Once the fusion center obtains enough measurements, the reconstruction spectrum sparse vectors are then used to make a decision on spectrum occupancy. Simulations corroborate the effec-tiveness of the estimation and sensing performance of our cooperative scheme. Meanwhile, the per-formance of SSAMP and Simultaneous Orthogonal Matching Pursuit (SOMP) is evaluated by Mean-Square estimation Errors (MSE) and sensing time.

Image Reconstruction for ECT under Compressed Sensing Framework Based on an Overcomplete Dictionary

Electrical capacitance tomography(ECT)has great application potential inmultiphase processmonitoring,and its visualization results are of great significance for studying the changes in two-phase flow in closed environments.In this paper,compressed sensing(CS)theory based on dictionary learning is introduced to the inverse problem of ECT,and the K-SVD algorithm is used to learn the overcomplete dictionary to establish a nonlinear mapping between observed capacitance and sparse space.Because the trained overcomplete dictionary has the property to match few features of interest in the reconstructed image of ECT,it is not necessary to rely on the sparsity of coefficient vector to solve the nonlinear mapping as most algorithms based on CS theory.Two-phase flow distribution in a cylindrical pipe was modeled and simulated,and three variations without sparse constraint based on Landweber,Tikhonov,and Newton-Raphson algorithms were used to rapidly reconstruct a 2-D image.

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.

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.

Sparse channel estimation for MIMO-OFDM systems using distributed compressed sensing

A sparse channel estimation method is proposed for doubly selective channels in multiple- input multiple-output （ MIMO ） orthogonal frequency division multiplexing （ OFDM ） systems. Based on the basis expansion model （BEM） of the channel, the joint-sparsity of MIMO-OFDM channels is described. The sparse characteristics enable us to cast the channel estimation as a distributed compressed sensing （DCS） problem. Then, a low complexity DCS-based estimation scheme is designed. Compared with the conventional compressed channel estimators based on the compressed sensing （CS） theory, the DCS-based method has an improved efficiency because it reconstructs the MIMO channels jointly rather than addresses them separately. Furthermore, the group-sparse structure of each single channel is also depicted. To effectively use this additional structure of the sparsity pattern, the DCS algorithm is modified. The modified algorithm can further enhance the estimation performance. Simulation results demonstrate the superiority of our method over fast fading channels in MIMO-OFDM systems.