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 encryptionalgori...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.展开更多
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...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.展开更多
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. F...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.展开更多
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 image...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.展开更多
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 ti...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.展开更多
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 prop...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.展开更多
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 o...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.展开更多
A joint two-dimensional(2D)direction-of-arrival(DOA)and radial Doppler frequency estimation method for the L-shaped array is proposed in this paper based on the compressive sensing(CS)framework.Revised from the conven...A joint two-dimensional(2D)direction-of-arrival(DOA)and radial Doppler frequency estimation method for the L-shaped array is proposed in this paper based on the compressive sensing(CS)framework.Revised from the conventional CS-based methods where the joint spatial-temporal parameters are characterized in one large scale matrix,three smaller scale matrices with independent azimuth,elevation and Doppler frequency are introduced adopting a separable observation model.Afterwards,the estimation is achieved by L1-norm minimization and the Bayesian CS algorithm.In addition,under the L-shaped array topology,the azimuth and elevation are separated yet coupled to the same radial Doppler frequency.Hence,the pair matching problem is solved with the aid of the radial Doppler frequency.Finally,numerical simulations corroborate the feasibility and validity of the proposed algorithm.展开更多
Media based modulation(MBM)is expected to be a prominent modulation scheme,which has access to the high data rate by using radio frequency(RF)mirrors and fewer transmit antennas.Associated with multiuser multiple inpu...Media based modulation(MBM)is expected to be a prominent modulation scheme,which has access to the high data rate by using radio frequency(RF)mirrors and fewer transmit antennas.Associated with multiuser multiple input multiple output(MIMO),the MBM scheme achieves better performance than other conventional multiuser MIMO schemes.In this paper,the massive MIMO uplink is considered and a conjunctive MBM transmission scheme for each user is employed.This conjunctive MBM transmission scheme gathers aggregate MBM signals in multiple continuous time slots,which exploits the structured sparsity of these aggregate MBM signals.Under this kind of scenario,a multiuser detector with low complexity based on the compressive sensing(CS)theory to gain better detection performance is proposed.This detector is developed from the greedy sparse recovery technique compressive sampling matching pursuit(CoSaMP)and exploits not only the inherently distributed sparsity of MBM signals but also the structured sparsity of multiple aggregate MBM signals.By exploiting these sparsity,the proposed CoSaMP based multiuser detector achieves reliable detection with low complexity.Simulation results demonstrate that the proposed CoSaMP based multiuser detector achieves better detection performance compared with the conventional methods.展开更多
Ultra-wide-band (UWB) signals are suitable for localization, since their high time resolution can provide precise time of arrival (TOA) estimation. However, one major challenge in UWB signal processing is the requirem...Ultra-wide-band (UWB) signals are suitable for localization, since their high time resolution can provide precise time of arrival (TOA) estimation. However, one major challenge in UWB signal processing is the requirement of high sampling rate which leads to complicated signal processing and expensive hardware. In this paper, we present a novel UWB signal sampling method called UWB signal sampling via temporal sparsity (USSTS). Its sampling rate is much lower than Nyquist rate. Moreover, it is implemented in one step and no extra processing unit is needed. Simulation results show that USSTS can not recover the signal precisely, but for the use in localization, the accuracy of TOA estimation is the same as that in traditional methods. Therefore, USSTS gives a novel and effective solution for the use of UWB signals in localization.展开更多
In digital signal processing (DSP), Nyquistrate sampling completely describes a signal by exploiting its bandlimitedness. Compressed Sensing (CS), also known as compressive sampling, is a DSP technique efficiently acq...In digital signal processing (DSP), Nyquistrate sampling completely describes a signal by exploiting its bandlimitedness. Compressed Sensing (CS), also known as compressive sampling, is a DSP technique efficiently acquiring and reconstructing a signal completely from reduced number of measurements, by exploiting its compressibility. The measurements are not point samples but more general linear functions of the signal. CS can capture and represent sparse signals at a rate significantly lower than ordinarily used in the Shannon’s sampling theorem. It is interesting to notice that most signals in reality are sparse;especially when they are represented in some domain (such as the wavelet domain) where many coefficients are close to or equal to zero. A signal is called K-sparse, if it can be exactly represented by a basis, , and a set of coefficients , where only K coefficients are nonzero. A signal is called approximately K-sparse, if it can be represented up to a certain accuracy using K non-zero coefficients. As an example, a K-sparse signal is the class of signals that are the sum of K sinusoids chosen from the N harmonics of the observed time interval. Taking the DFT of any such signal would render only K non-zero values . An example of approximately sparse signals is when the coefficients , sorted by magnitude, decrease following a power law. In this case the sparse approximation constructed by choosing the K largest coefficients is guaranteed to have an approximation error that decreases with the same power law as the coefficients. The main limitation of CS-based systems is that they are employing iterative algorithms to recover the signal. The sealgorithms are slow and the hardware solution has become crucial for higher performance and speed. This technique enables fewer data samples than traditionally required when capturing a signal with relatively high bandwidth, but a low information rate. As a main feature of CS, efficient algorithms such as -minimization can be used for recovery. This paper gives a survey of both theoretical and numerical aspects of compressive sensing technique and its applications. The theory of CS has many potential applications in signal processing, wireless communication, cognitive radio and medical imaging.展开更多
Ghost imaging (GI) offers great potential with respect to conventional imaging techniques. It is an open problem in GI systems that a long acquisition time is be required for reconstructing images with good visibili...Ghost imaging (GI) offers great potential with respect to conventional imaging techniques. It is an open problem in GI systems that a long acquisition time is be required for reconstructing images with good visibility and signal-to-noise ratios (SNRs). In this paper, we propose a new scheme to get good performance with a shorter construction time. We call it correspondence normalized ghost imaging based on compressive sensing (CCNGI). In the scheme, we enhance the signal-to-noise performance by normalizing the reference beam intensity to eliminate the noise caused by laser power fluctuations, and reduce the reconstruction time by using both compressive sensing (CS) and time-correspondence imaging (CI) techniques. It is shown that the qualities of the images have been improved and the reconstruction time has been reduced using CCNGI scheme. For the two-grayscale "double-slit" image, the mean square error (MSE) by GI and the normalized GI (NGI) schemes with the measurement number of 5000 are 0.237 and 0.164, respectively, and that is 0.021 by CCNGI scheme with 2500 measurements. For the eight-grayscale "lena" object, the peak signal-to-noise rates (PSNRs) are 10.506 and 13.098, respectively using G1 and NGI schemes while the value turns to 16.198 using CCNGI scheme. The results also show that a high-fidelity GI reconstruction has been achieved using only 44% of the number of measurements corresponding to the Nyquist limit for the two-grayscale "double-slit" object. The qualities of the reconstructed images using CCNGI are almost the same as those from GI via sparsity constraints (GISC) with a shorter reconstruction time.展开更多
Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown. In order to match the sparsity more accurately, we presen...Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown. In order to match the sparsity more accurately, we presented an improved SAMP algorithm based on Regularized Backtracking (SAMP-RB). By adapting a regularized backtracking step to SAMP algorithm in each iteration stage, the proposed algorithm can flexibly remove the inappropriate atoms. The experimental results show that SAMP-RB reconstruction algorithm greatly improves SAMP algorithm both in reconstruction quality and computational time. It has better reconstruction efficiency than most of the available matching pursuit algorithms.展开更多
Compressive sensing (CS) creates a new framework of signal reconstruction or approximation from a smaller set of incoherent projection compared with the traditional Nyquist-rate sampling theory. Recently, it has been ...Compressive sensing (CS) creates a new framework of signal reconstruction or approximation from a smaller set of incoherent projection compared with the traditional Nyquist-rate sampling theory. Recently, it has been shown that CS can solve some signal processing problems given incoherent measurements without ever reconstructing the signals. Moreover, the number of measurements necessary for most compressive signal processing application such as detection, estimation and classification is lower than that necessary for signal reconstruction. Based on CS, this paper presents a novel identification algorithm of frequency hopping (FH) signals. Given the hop interval, the FH signals can be identified and the hopping frequencies can be estimated with a tiny number of measurements. Simulation results demonstrate that the method is effective and efficient.展开更多
Compressive sampling matching pursuit (CoSaMP) algorithm integrates the idea of combining algorithm to ensure running speed and provides rigorous error bounds which provide a good theoretical guarantee to convergenc...Compressive sampling matching pursuit (CoSaMP) algorithm integrates the idea of combining algorithm to ensure running speed and provides rigorous error bounds which provide a good theoretical guarantee to convergence. And compressive sensing (CS) can help us ease the pressure of hardware facility from the requirements of the huge amount in information processing. Therefore, a new video coding framework was proposed, which was based on CS and curvelet transform in this paper. Firstly, this new framework uses curvelet transform and CS to the key frame of test sequence, and then gains recovery frame via CoSaMP to achieve data compress. In the classic CoSaMP method, the halting criterion is that the number of iterations is fixed. Therefore, a new stopping rule is discussed to halting the algorithm in this paper to obtain better performance. According to a large number of experimental results, we ran see that this new framework has better performance and lower RMSE. Through the analysis of the experimental data, it is found that the selection of number of measurements and sparsity level has great influence on the new framework. So how to select the optimal parameters to gain better performance deserves worthy of further study.展开更多
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 ...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.展开更多
基金the National Natural Science Foundation of China(Nos.62002028,62102040 and 62202066).
文摘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.
基金supported by the Key Area R&D Program of Guangdong Province (Grant No.2022B0701180001)the National Natural Science Foundation of China (Grant No.61801127)+1 种基金the Science Technology Planning Project of Guangdong Province,China (Grant Nos.2019B010140002 and 2020B111110002)the Guangdong-Hong Kong-Macao Joint Innovation Field Project (Grant No.2021A0505080006)。
文摘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.
基金supported by the National Natural Science Foundation of China (Grant No. 61672124)the Password Theory Project of the 13th Five-Year Plan National Cryptography Development Fund (Grant No. MMJJ20170203)+3 种基金Liaoning Province Science and Technology Innovation Leading Talents Program Project (Grant No. XLYC1802013)Key R&D Projects of Liaoning Province (Grant No. 2019020105JH2/103)Jinan City ‘20 Universities’ Funding Projects Introducing Innovation Team Program (Grant No. 2019GXRC031)Research Fund of Guangxi Key Lab of Multi-source Information Mining & Security (Grant No. MIMS20-M-02)。
文摘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.
基金This work was supported in part by the National Natural Science Foundation of China under Grants 71571091,71771112the State Key Laboratory of Synthetical Automation for Process Industries Fundamental Research Funds under Grant PAL-N201801the Excellent Talent Training Project of University of Science and Technology Liaoning under Grant 2019RC05.
文摘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.
基金Project supported by the Natural Science Foundation of Shandong Province,China(Grant Nos.ZR2020MF119 and ZR2020MA082)the National Natural Science Foundation of China(Grant No.62002208)the National Key Research and Development Program of China(Grant No.2018YFB0504302).
文摘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.
文摘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.
基金This work was supported by the National Key R&D Program of China(2019YFC1605500,2018YFF01011700)the National Natural Science Foundation of China(21973111)+1 种基金Guangxi Natural Science Foundation(2017GXNSFAA198029)Scientific Development Fund of Guangxi Academy of Sciences(2018YFJ 403).
文摘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.
文摘A joint two-dimensional(2D)direction-of-arrival(DOA)and radial Doppler frequency estimation method for the L-shaped array is proposed in this paper based on the compressive sensing(CS)framework.Revised from the conventional CS-based methods where the joint spatial-temporal parameters are characterized in one large scale matrix,three smaller scale matrices with independent azimuth,elevation and Doppler frequency are introduced adopting a separable observation model.Afterwards,the estimation is achieved by L1-norm minimization and the Bayesian CS algorithm.In addition,under the L-shaped array topology,the azimuth and elevation are separated yet coupled to the same radial Doppler frequency.Hence,the pair matching problem is solved with the aid of the radial Doppler frequency.Finally,numerical simulations corroborate the feasibility and validity of the proposed algorithm.
文摘Media based modulation(MBM)is expected to be a prominent modulation scheme,which has access to the high data rate by using radio frequency(RF)mirrors and fewer transmit antennas.Associated with multiuser multiple input multiple output(MIMO),the MBM scheme achieves better performance than other conventional multiuser MIMO schemes.In this paper,the massive MIMO uplink is considered and a conjunctive MBM transmission scheme for each user is employed.This conjunctive MBM transmission scheme gathers aggregate MBM signals in multiple continuous time slots,which exploits the structured sparsity of these aggregate MBM signals.Under this kind of scenario,a multiuser detector with low complexity based on the compressive sensing(CS)theory to gain better detection performance is proposed.This detector is developed from the greedy sparse recovery technique compressive sampling matching pursuit(CoSaMP)and exploits not only the inherently distributed sparsity of MBM signals but also the structured sparsity of multiple aggregate MBM signals.By exploiting these sparsity,the proposed CoSaMP based multiuser detector achieves reliable detection with low complexity.Simulation results demonstrate that the proposed CoSaMP based multiuser detector achieves better detection performance compared with the conventional methods.
基金supported by National science foundation(No. 60772035): Key technique study on heterogeneous network convergenceDoctoral grant(No.20070004010)s: Study on cross layer design for heterogeneous network convergence+1 种基金National 863 Hi-Tech Projects(No.2007AA01Z277): Pa-rameter design based electromagnetic compatibility study in cognitive radio communication systemNational science foundation(No. 60830001): Wireless communication fundamentals and key techniuqes for high speed rail way control and safety data transmission
文摘Ultra-wide-band (UWB) signals are suitable for localization, since their high time resolution can provide precise time of arrival (TOA) estimation. However, one major challenge in UWB signal processing is the requirement of high sampling rate which leads to complicated signal processing and expensive hardware. In this paper, we present a novel UWB signal sampling method called UWB signal sampling via temporal sparsity (USSTS). Its sampling rate is much lower than Nyquist rate. Moreover, it is implemented in one step and no extra processing unit is needed. Simulation results show that USSTS can not recover the signal precisely, but for the use in localization, the accuracy of TOA estimation is the same as that in traditional methods. Therefore, USSTS gives a novel and effective solution for the use of UWB signals in localization.
文摘In digital signal processing (DSP), Nyquistrate sampling completely describes a signal by exploiting its bandlimitedness. Compressed Sensing (CS), also known as compressive sampling, is a DSP technique efficiently acquiring and reconstructing a signal completely from reduced number of measurements, by exploiting its compressibility. The measurements are not point samples but more general linear functions of the signal. CS can capture and represent sparse signals at a rate significantly lower than ordinarily used in the Shannon’s sampling theorem. It is interesting to notice that most signals in reality are sparse;especially when they are represented in some domain (such as the wavelet domain) where many coefficients are close to or equal to zero. A signal is called K-sparse, if it can be exactly represented by a basis, , and a set of coefficients , where only K coefficients are nonzero. A signal is called approximately K-sparse, if it can be represented up to a certain accuracy using K non-zero coefficients. As an example, a K-sparse signal is the class of signals that are the sum of K sinusoids chosen from the N harmonics of the observed time interval. Taking the DFT of any such signal would render only K non-zero values . An example of approximately sparse signals is when the coefficients , sorted by magnitude, decrease following a power law. In this case the sparse approximation constructed by choosing the K largest coefficients is guaranteed to have an approximation error that decreases with the same power law as the coefficients. The main limitation of CS-based systems is that they are employing iterative algorithms to recover the signal. The sealgorithms are slow and the hardware solution has become crucial for higher performance and speed. This technique enables fewer data samples than traditionally required when capturing a signal with relatively high bandwidth, but a low information rate. As a main feature of CS, efficient algorithms such as -minimization can be used for recovery. This paper gives a survey of both theoretical and numerical aspects of compressive sensing technique and its applications. The theory of CS has many potential applications in signal processing, wireless communication, cognitive radio and medical imaging.
基金Project supported by the National Natural Science Foundation of China(Grant No.61271238)the Specialized Research Fund for the Doctoral Program of Higher Education of China(Grant No.20123223110003)the University Natural Science Research Foundation of Jiangsu Province,China(Grant No.11KJA510002)
文摘Ghost imaging (GI) offers great potential with respect to conventional imaging techniques. It is an open problem in GI systems that a long acquisition time is be required for reconstructing images with good visibility and signal-to-noise ratios (SNRs). In this paper, we propose a new scheme to get good performance with a shorter construction time. We call it correspondence normalized ghost imaging based on compressive sensing (CCNGI). In the scheme, we enhance the signal-to-noise performance by normalizing the reference beam intensity to eliminate the noise caused by laser power fluctuations, and reduce the reconstruction time by using both compressive sensing (CS) and time-correspondence imaging (CI) techniques. It is shown that the qualities of the images have been improved and the reconstruction time has been reduced using CCNGI scheme. For the two-grayscale "double-slit" image, the mean square error (MSE) by GI and the normalized GI (NGI) schemes with the measurement number of 5000 are 0.237 and 0.164, respectively, and that is 0.021 by CCNGI scheme with 2500 measurements. For the eight-grayscale "lena" object, the peak signal-to-noise rates (PSNRs) are 10.506 and 13.098, respectively using G1 and NGI schemes while the value turns to 16.198 using CCNGI scheme. The results also show that a high-fidelity GI reconstruction has been achieved using only 44% of the number of measurements corresponding to the Nyquist limit for the two-grayscale "double-slit" object. The qualities of the reconstructed images using CCNGI are almost the same as those from GI via sparsity constraints (GISC) with a shorter reconstruction time.
基金Supported by the National Natural Science Foundation of China (No. 61073079)the Fundamental Research Funds for the Central Universities (2011JBM216,2011YJS021)
文摘Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown. In order to match the sparsity more accurately, we presented an improved SAMP algorithm based on Regularized Backtracking (SAMP-RB). By adapting a regularized backtracking step to SAMP algorithm in each iteration stage, the proposed algorithm can flexibly remove the inappropriate atoms. The experimental results show that SAMP-RB reconstruction algorithm greatly improves SAMP algorithm both in reconstruction quality and computational time. It has better reconstruction efficiency than most of the available matching pursuit algorithms.
基金supported by the National Natural Science Foundation of China(6107116361071164+5 种基金6147119161501233)the Fundamental Research Funds for the Central Universities(NP2014504)the Aeronautical Science Foundation(20152052026)the Electronic & Information School of Yangtze University Innovation Foundation(2016-DXCX-05)the Priority Academic Program Development of Jiangsu Higher Education Institutions
文摘Compressive sensing (CS) creates a new framework of signal reconstruction or approximation from a smaller set of incoherent projection compared with the traditional Nyquist-rate sampling theory. Recently, it has been shown that CS can solve some signal processing problems given incoherent measurements without ever reconstructing the signals. Moreover, the number of measurements necessary for most compressive signal processing application such as detection, estimation and classification is lower than that necessary for signal reconstruction. Based on CS, this paper presents a novel identification algorithm of frequency hopping (FH) signals. Given the hop interval, the FH signals can be identified and the hopping frequencies can be estimated with a tiny number of measurements. Simulation results demonstrate that the method is effective and efficient.
基金the Youth Foundation of Jiangxi Provincial Education Department,China
文摘Compressive sampling matching pursuit (CoSaMP) algorithm integrates the idea of combining algorithm to ensure running speed and provides rigorous error bounds which provide a good theoretical guarantee to convergence. And compressive sensing (CS) can help us ease the pressure of hardware facility from the requirements of the huge amount in information processing. Therefore, a new video coding framework was proposed, which was based on CS and curvelet transform in this paper. Firstly, this new framework uses curvelet transform and CS to the key frame of test sequence, and then gains recovery frame via CoSaMP to achieve data compress. In the classic CoSaMP method, the halting criterion is that the number of iterations is fixed. Therefore, a new stopping rule is discussed to halting the algorithm in this paper to obtain better performance. According to a large number of experimental results, we ran see that this new framework has better performance and lower RMSE. Through the analysis of the experimental data, it is found that the selection of number of measurements and sparsity level has great influence on the new framework. So how to select the optimal parameters to gain better performance deserves worthy of further study.
文摘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.