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.

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.

Sparse Modal Decomposition Method Addressing Underdetermined Vortex-Induced Vibration Reconstruction Problem for Marine Risers

When investigating the vortex-induced vibration(VIV)of marine risers,extrapolating the dynamic response on the entire length based on limited sensor measurements is a crucial step in both laboratory experiments and fatigue monitoring of real risers.The problem is conventionally solved using the modal decomposition method,based on the principle that the response can be approximated by a weighted sum of limited vibration modes.However,the method is not valid when the problem is underdetermined,i.e.,the number of unknown mode weights is more than the number of known measurements.This study proposed a sparse modal decomposition method based on the compressed sensing theory and the Compressive Sampling Matching Pursuit(Co Sa MP)algorithm,exploiting the sparsity of VIV in the modal space.In the validation study based on high-order VIV experiment data,the proposed method successfully reconstructed the response using only seven acceleration measurements when the conventional methods failed.A primary advantage of the proposed method is that it offers a completely data-driven approach for the underdetermined VIV reconstruction problem,which is more favorable than existing model-dependent solutions for many practical applications such as riser structural health monitoring.

Dynamics analysis and cryptographic implementation of a fractional-order memristive cellular neural network model

Due to the fact that a memristor with memory properties is an ideal electronic component for implementation of the artificial neural synaptic function,a brand-new tristable locally active memristor model is first proposed in this paper.Here,a novel four-dimensional fractional-order memristive cellular neural network(FO-MCNN)model with hidden attractors is constructed to enhance the engineering feasibility of the original CNN model and its performance.Then,its hardware circuit implementation and complicated dynamic properties are investigated on multi-simulation platforms.Subsequently,it is used toward secure communication application scenarios.Taking it as the pseudo-random number generator(PRNG),a new privacy image security scheme is designed based on the adaptive sampling rate compressive sensing(ASR-CS)model.Eventually,the simulation analysis and comparative experiments manifest that the proposed data encryption scheme possesses strong immunity against various security attack models and satisfactory compression performance.

THE STABLE RECONSTRUCTION OF STRONGLY-DECAYING BLOCK SPARSE SIGNALS

In this paper,we reconstruct strongly-decaying block sparse signals by the block generalized orthogonal matching pursuit(BgOMP)algorithm in the l2-bounded noise case.Under some restraints on the minimum magnitude of the nonzero elements of the strongly-decaying block sparse signal,if the sensing matrix satisfies the the block restricted isometry property(block-RIP),then arbitrary strongly-decaying block sparse signals can be accurately and steadily reconstructed by the BgOMP algorithm in iterations.Furthermore,we conjecture that this condition is sharp.

Off-Grid Compressed Channel Estimation with Parallel Interference Cancellation for Millimeter Wave Massive MIMO

Millimeter wave(mmWave)massive multiple-input multiple-output(MIMO)plays an important role in the fifth-generation(5G)mobile communications and beyond wireless communication systems owing to its potential of high capacity.However,channel estimation has become very challenging due to the use of massive MIMO antenna array.Fortunately,the mmWave channel has strong sparsity in the spatial angle domain,and the compressed sensing technology can be used to convert the original channel matrix into the sparse matrix of discrete angle grid.Thus the high-dimensional channel matrix estimation is transformed into a sparse recovery problem with greatly reduced computational complexity.However,the path angle in the actual scene appears randomly and is unlikely to be completely located on the quantization angle grid,thus leading to the problem of power leakage.Moreover,multiple paths with the random distribution of angles will bring about serious interpath interference and further deteriorate the performance of channel estimation.To address these off-grid issues,we propose a parallel interference cancellation assisted multi-grid matching pursuit(PIC-MGMP)algorithm in this paper.The proposed algorithm consists of three stages,including coarse estimation,refined estimation,and inter-path cyclic iterative inter-ference cancellation.More specifically,the angular resolution can be improved by locally refining the grid to reduce power leakage,while the inter-path interference is eliminated by parallel interference cancellation(PIC),and the two together improve the estimation accuracy.Simulation results show that compared with the traditional orthogonal matching pursuit(OMP)algorithm,the normalized mean square error(NMSE)of the proposed algorithm decreases by over 14dB in the case of 2 paths.

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.

Cluster-Based Massive Access for Massive MIMO Systems

Massive machine type communication aims to support the connection of massive devices,which is still an important scenario in 6G.In this paper,a novel cluster-based massive access method is proposed for massive multiple input multiple output systems.By exploiting the angular domain characteristics,devices are separated into multiple clusters with a learned cluster-specific dictionary,which enhances the identification of active devices.For detected active devices whose data recovery fails,power domain nonorthogonal multiple access with successive interference cancellation is employed to recover their data via re-transmission.Simulation results show that the proposed scheme and algorithm achieve improved performance on active user detection and data recovery.

Design Framework of Unsourced Multiple Access for 6G Massive IoT

In this paper,ambient IoT is used as a typical use case of massive connections for the sixth generation(6G)mobile communications where we derive the performance requirements to facilitate the evaluation of technical solutions.A rather complete design of unsourced multiple access is proposed in which two key parts:a compressed sensing module for active user detection,and a sparse interleaver-division multiple access(SIDMA)module are simulated side by side on a same platform at balanced signal to noise ratio(SNR)operating points.With a proper combination of compressed sensing matrix,a convolutional encoder,receiver algorithms,the simulated performance results appear superior to the state-of-the-art benchmark,yet with relatively less complicated processing.

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.

DOA estimation of high-dimensional signals based on Krylov subspace and weighted l_(1)-norm

With the extensive application of large-scale array antennas,the increasing number of array elements leads to the increasing dimension of received signals,making it difficult to meet the real-time requirement of direction of arrival(DOA)estimation due to the computational complexity of algorithms.Traditional subspace algorithms require estimation of the covariance matrix,which has high computational complexity and is prone to producing spurious peaks.In order to reduce the computational complexity of DOA estimation algorithms and improve their estimation accuracy under large array elements,this paper proposes a DOA estimation method based on Krylov subspace and weighted l_(1)-norm.The method uses the multistage Wiener filter(MSWF)iteration to solve the basis of the Krylov subspace as an estimate of the signal subspace,further uses the measurement matrix to reduce the dimensionality of the signal subspace observation,constructs a weighted matrix,and combines the sparse reconstruction to establish a convex optimization function based on the residual sum of squares and weighted l_(1)-norm to solve the target DOA.Simulation results show that the proposed method has high resolution under large array conditions,effectively suppresses spurious peaks,reduces computational complexity,and has good robustness for low signal to noise ratio(SNR)environment.

A Disturbance Localization Method for Power System Based on Group Sparse Representation and Entropy Weight Method

This paper addresses the problem of complex and challenging disturbance localization in the current power system operation environment by proposing a disturbance localization method for power systems based on group sparse representation and entropy weight method.Three different electrical quantities are selected as observations in the compressed sensing algorithm.The entropy weighting method is employed to calculate the weights of different observations based on their relative disturbance levels.Subsequently,by leveraging the topological information of the power system and pre-designing an overcomplete dictionary of disturbances based on the corresponding system parameter variations caused by disturbances,an improved Joint Generalized Orthogonal Matching Pursuit(J-GOMP)algorithm is utilized for reconstruction.The reconstructed sparse vectors are divided into three parts.If at least two parts have consistent node identifiers,the node is identified as the disturbance node.If the node identifiers in all three parts are inconsistent,further analysis is conducted considering the weights to determine the disturbance node.Simulation results based on the IEEE 39-bus system model demonstrate that the proposed method,utilizing electrical quantity information from only 8 measurement points,effectively locates disturbance positions and is applicable to various disturbance types with strong noise resistance.

Optimal Configuration of Fault Location Measurement Points in DC Distribution Networks Based on Improved Particle Swarm Optimization Algorithm

The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimalconfiguration of measurement points, this paper presents an optimal configuration scheme for fault locationmeasurement points in DC distribution networks based on an improved particle swarm optimization algorithm.Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing.The model aims to achieve the minimum number of measurement points while attaining the best compressivesensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Haltonsequence for population initialization, generating uniformly distributed individuals. This enhancement reducesindividual search blindness and overlap probability, thereby promoting population diversity. Furthermore, anadaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the globalsearch capability and search speed. The established model for the optimal configuration of measurement points issolved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configurationreduces the number of measurement points, enhances localization accuracy, and improves the convergence speedof the algorithm. These findings validate the effectiveness and utility of the proposed approach.

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.

CQI Feedback Compression Method for Multi-Carrier MIMO Transmission

In multi-user wireless communication systems,adaptive modulation and scheduling are promising techniques for increasing system throughput.However,for multi-carrier systems,they will lead to overwhelming user feedback overhead for Channel Quality Indication(CQI) in every subcarrier.In our work,novel CQI feedback schemes are proposed based on the recently proposed theory of Compressive Sensing(CS).First,the standard CS method is introduced to reduce CQI feedback overhead for multi-carrier Multiple-Input Multiple-Output transmission.In addition,via further research on the design of measurement matrix with standard CS,a novel CQI feedback scheme based on subspace CS is proposed by exploiting the subspace information of the underlying signal and the feedback rate is greatly decreased.Simulation results show that,with the same feedback rate,the throughputs with subspace CS outperform the Discrete Cosine Transform(DCT)-based method which is usually employed,and the throughputs with standard CS outperform DCT when the feedback rate is larger than 0.13 bits/subcarrier.

Efficient Data Compression of ECG Signal Based on Modified Discrete Cosine Transform

This paper introduced an efficient compression technique that uses the compressive sensing(CS)method to obtain and recover sparse electrocardiography(ECG)signals.The recovery of the signal can be achieved by using sampling rates lower than the Nyquist frequency.A novel analysis was proposed in this paper.To apply CS on ECG signal,the first step is to generate a sparse signal,which can be obtained using Modified Discrete Cosine Transform(MDCT)on the given ECGsignal.This transformation is a promising key for other transformations used in this search domain and can be considered as the main contribution of this paper.A small number of wavelet components can describe the ECG signal as related work to obtain a sparse ECGsignal.Asensing technique for ECGsignal compression,which is a novel area of research,is proposed.ECG signals are introduced randomly between any successive beats of the heart.MIT-BIH database can be represented as the experimental database in this domain of research.TheMIT-BIH database consists of various ECG signals involving a patient and standard ECG signals.MATLAB can be considered as the simulation tool used in this work.The proposed method’s uniqueness was inspired by the compression ratio(CR)and achieved by MDCT.The performance measurement of the recovered signal was done by calculating the percentage root mean difference(PRD),mean square error(MSE),and peak signal to noise ratio(PSNR)besides the calculation of CR.Finally,the simulation results indicated that this work is one of the most important works in ECG signal compression.

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.

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.