This paper explores the recovery of block sparse signals in frame-based settings using the l_(2)/l_(q)-synthesis technique(0<q≤1).We propose a new null space property,referred to as block D-NSP_(q),which is based ...This paper explores the recovery of block sparse signals in frame-based settings using the l_(2)/l_(q)-synthesis technique(0<q≤1).We propose a new null space property,referred to as block D-NSP_(q),which is based on the dictionary D.We establish that matrices adhering to the block D-NSP_(q)condition are both necessary and sufficient for the exact recovery of block sparse signals via l_(2)/l_(q)-synthesis.Additionally,this condition is essential for the stable recovery of signals that are block-compressible with respect to D.This D-NSP_(q)property is identified as the first complete condition for successful signal recovery using l_(2)/l_(q)-synthesis.Furthermore,we assess the theoretical efficacy of the l2/lq-synthesis method under conditions of measurement noise.展开更多
BACKGROUND A key cardiac magnetic resonance(CMR)challenge is breath-holding duration,difficult for cardiac patients.AIM To evaluate whether artificial intelligence-assisted compressed sensing CINE(AICS-CINE)reduces im...BACKGROUND A key cardiac magnetic resonance(CMR)challenge is breath-holding duration,difficult for cardiac patients.AIM To evaluate whether artificial intelligence-assisted compressed sensing CINE(AICS-CINE)reduces image acquisition time of CMR compared to conventional CINE(C-CINE).METHODS Cardio-oncology patients(n=60)and healthy volunteers(n=29)underwent sequential C-CINE and AI-CS-CINE with a 1.5-T scanner.Acquisition time,visual image quality assessment,and biventricular metrics(end-diastolic volume,endsystolic volume,stroke volume,ejection fraction,left ventricular mass,and wall thickness)were analyzed and compared between C-CINE and AI-CS-CINE with Bland–Altman analysis,and calculation of intraclass coefficient(ICC).RESULTS In 89 participants(58.5±16.8 years,42 males,47 females),total AI-CS-CINE acquisition and reconstruction time(37 seconds)was 84%faster than C-CINE(238 seconds).C-CINE required repeats in 23%(20/89)of cases(approximately 8 minutes lost),while AI-CS-CINE only needed one repeat(1%;2 seconds lost).AICS-CINE had slightly lower contrast but preserved structural clarity.Bland-Altman plots and ICC(0.73≤r≤0.98)showed strong agreement for left ventricle(LV)and right ventricle(RV)metrics,including those in the cardiac amyloidosis subgroup(n=31).AI-CS-CINE enabled faster,easier imaging in patients with claustrophobia,dyspnea,arrhythmias,or restlessness.Motion-artifacted C-CINE images were reliably interpreted from AI-CS-CINE.CONCLUSION AI-CS-CINE accelerated CMR image acquisition and reconstruction,preserved anatomical detail,and diminished impact of patient-related motion.Quantitative AI-CS-CINE metrics agreed closely with C-CINE in cardio-oncology patients,including the cardiac amyloidosis cohort,as well as healthy volunteers regardless of left and right ventricular size and function.AI-CS-CINE significantly enhanced CMR workflow,particularly in challenging cases.The strong analytical concordance underscores reliability and robustness of AI-CS-CINE as a valuable tool.展开更多
This paper considers the fundamental channel estimation problem for the multiple-input multiple-output orthogonal frequency division multiplexing(MIMO-OFDM)system in the presence of multi-cell interference.Specificall...This paper considers the fundamental channel estimation problem for the multiple-input multiple-output orthogonal frequency division multiplexing(MIMO-OFDM)system in the presence of multi-cell interference.Specifically,this paper focuses on both channel modelling and receiver design for interference estimation and mitigation.We propose a delay-calibrated block-wise linear model,which extracts the delay of the dominant tap of each interference as a key parameter and approximates the residual channel coefficients by the recently developed blockwise linear model.Based on the delay-calibrated block-wise linear model and the angle-domain channel sparsity,we further conceive a message passing algorithm to solve the channel estimation problem.Numerical results demonstrate the superior performance of the proposed algorithm over the state-of-the-art algorithms.展开更多
It has been over a decade since the first coded aperture video compressive sensing(CS)system was reported.The underlying principle of this technology is to employ a high-frequency modulator in the optical path to modu...It has been over a decade since the first coded aperture video compressive sensing(CS)system was reported.The underlying principle of this technology is to employ a high-frequency modulator in the optical path to modulate a recorded high-speed scene within one integration time.The superimposed image captured in this manner is modulated and compressed,since multiple modulation patterns are imposed.Following this,reconstruction algorithms are utilized to recover the desired high-speed scene.One leading advantage of video CS is that a single captured measurement can be used to reconstruct a multi-frame video,thereby enabling a low-speed camera to capture high-speed scenes.Inspired by this,a number of variants of video CS systems have been built,mainly using different modulation devices.Meanwhile,in order to obtain high-quality reconstruction videos,many algorithms have been developed,from optimization-based iterative algorithms to deep-learning-based ones.Recently,emerging deep learning methods have been dominant due to their high-speed inference and high-quality reconstruction,highlighting the possibility of deploying video CS in practical applications.Toward this end,this paper reviews the progress that has been achieved in video CS during the past decade.We further analyze the efforts that need to be made—in terms of both hardware and algorithms—to enable real applications.Research gaps are put forward and future directions are summarized to help researchers and engineers working on this topic.展开更多
For image compression sensing reconstruction,most algorithms use the method of reconstructing image blocks one by one and stacking many convolutional layers,which usually have defects of obvious block effects,high com...For image compression sensing reconstruction,most algorithms use the method of reconstructing image blocks one by one and stacking many convolutional layers,which usually have defects of obvious block effects,high computational complexity,and long reconstruction time.An image compressed sensing reconstruction network based on self-attention mechanism(SAMNet)was proposed.For the compressed sampling,self-attention convolution was designed,which was conducive to capturing richer features,so that the compressed sensing measurement value retained more image structure information.For the reconstruction,a self-attention mechanism was introduced in the convolutional neural network.A reconstruction network including residual blocks,bottleneck transformer(BoTNet),and dense blocks was proposed,which strengthened the transfer of image features and reduced the amount of parameters dramatically.Under the Set5 dataset,when the measurement rates are 0.01,0.04,0.10,and 0.25,the average peak signal-to-noise ratio(PSNR)of SAMNet is improved by 1.27,1.23,0.50,and 0.15 dB,respectively,compared to the CSNet+.The running time of reconstructing a 256×256 image is reduced by 0.1473,0.1789,0.2310,and 0.2524 s compared to ReconNet.Experimental results showed that SAMNet improved the quality of reconstructed images and reduced the reconstruction time.展开更多
In the heterogeneous power internet of things(IoT)environment,data signals are acquired to support different business systems to realize advanced intelligent applications,with massive,multi-source,heterogeneous and ot...In the heterogeneous power internet of things(IoT)environment,data signals are acquired to support different business systems to realize advanced intelligent applications,with massive,multi-source,heterogeneous and other characteristics.Reliable perception of information and efficient transmission of energy in multi-source heterogeneous environments are crucial issues.Compressive sensing(CS),as an effective method of signal compression and transmission,can accurately recover the original signal only by very few sampling.In this paper,we study a new method of multi-source heterogeneous data signal reconstruction of power IoT based on compressive sensing technology.Based on the traditional compressive sensing technology to directly recover multi-source heterogeneous signals,we fully use the interference subspace information to design the measurement matrix,which directly and effectively eliminates the interference while making the measurement.The measure matrix is optimized by minimizing the average cross-coherence of the matrix,and the reconstruction performance of the new method is further improved.Finally,the effectiveness of the new method with different parameter settings under different multi-source heterogeneous data signal cases is verified by using orthogonal matching pursuit(OMP)and sparsity adaptive matching pursuit(SAMP)for considering the actual environment with prior information utilization of signal sparsity and no prior information utilization of signal sparsity.展开更多
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 s...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.展开更多
In order to reduce the pilot number and improve spectral efficiency, recently emerged compressive sensing （CS） is applied to the digital broadcast channel estimation. According to the six channel profiles of the Eur...In order to reduce the pilot number and improve spectral efficiency, recently emerged compressive sensing （CS） is applied to the digital broadcast channel estimation. According to the six channel profiles of the European Telecommunication Standards Institute（ETSI） digital radio mondiale （DRM） standard, the subspace pursuit （SP） algorithm is employed for delay spread and attenuation estimation of each path in the case where the channel profile is identified and the multipath number is known. The stop condition for SP is that the sparsity of the estimation equals the multipath number. For the case where the multipath number is unknown, the orthogonal matching pursuit （OMP） algorithm is employed for channel estimation, while the stop condition is that the estimation achieves the noise variance. Simulation results show that with the same number of pilots, CS algorithms outperform the traditional cubic-spline-interpolation-based least squares （LS） channel estimation. SP is also demonstrated to be better than OMP when the multipath number is known as a priori.展开更多
Face hallucination or super-resolution is an inverse problem which is underdetermined,and the compressive sensing(CS)theory provides an effective way of seeking inverse problem solutions.In this paper,a novel compress...Face hallucination or super-resolution is an inverse problem which is underdetermined,and the compressive sensing(CS)theory provides an effective way of seeking inverse problem solutions.In this paper,a novel compressive sensing based face hallucination method is presented,which is comprised of three steps:dictionary learning、sparse coding and solving maximum a posteriori(MAP)formulation.In the first step,the K-SVD dictionary learning algorithm is adopted to obtain a dictionary which can sparsely represent high resolution(HR)face image patches.In the second step,we seek the sparsest representation for each low-resolution(LR)face image paches input using the learned dictionary,super resolution image blocks are obtained from the sparsest coefficients and dictionaries,which then are assembled into super-resolution(SR)image.Finally,MAP formulation is introduced to satisfy the consistency restrictive condition and obtain the higher quality HR images.The experimental results demonstrate that our approach can achieve better super-resolution faces compared with other state-of-the-art method.展开更多
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 compres...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.展开更多
In deep mineral exploration, the acquisition of audio magnetotelluric （AMT） data is severely affected by ambient noise near the observation sites; This near-field noise restricts investigation depths. Mathematical m...In deep mineral exploration, the acquisition of audio magnetotelluric （AMT） data is severely affected by ambient noise near the observation sites; This near-field noise restricts investigation depths. Mathematical morphological filtering （MMF） proved effective in suppressing large-scale strong and variably shaped noise, typically low-frequency noise, but can not deal with pulse noise of AMT data. We combine compressive sensing and MMF. First we use MMF to suppress the large-scale strong ambient noise; second, we use the improved orthogonal match pursuit （IOMP） algorithm to remove the residual pulse noise. To remove the noise and protect the useful AMT signal, a redundant dictionary that matches with spikes and is insensitive to the useful signal is designed. Synthetic and field data from the Luzong field suggest that the proposed method suppresses the near-source noise and preserves the signal well; thus, better results are obtained that improve the output of either MMF or IOMP.展开更多
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 abil...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.展开更多
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 compress...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.展开更多
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 p...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.展开更多
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.展开更多
As the amount of data produced by ground penetrating radar （GPR） for roots is large, the transmission and the storage of data consumes great resources. To alleviate this problem, we propose here a root imaging algor...As the amount of data produced by ground penetrating radar （GPR） for roots is large, the transmission and the storage of data consumes great resources. To alleviate this problem, we propose here a root imaging algorithm using chaotic particle swarm optimal （CPSO） compressed sensing based on GPR data according to the sparsity of root space. Radar data are decomposed, observed, measured and represented in sparse manner, so roots image can be reconstructed with limited data. Firstly, radar signal measurement and sparse representation are implemented, and the solution space is established by wavelet basis and Gauss random matrix; secondly, the matching function is considered as the fitness function, and the best fitness value is found by a PSO algorithm; then, a chaotic search was used to obtain the global optimal operator; finally, the root image is reconstructed by the optimal operators. A-scan data, B-scan data, and complex data from American GSSI GPR is used, respectively, in the experimental test. For B-scan data, the computation time was reduced 60 % and PSNR was improved 5.539 dB; for actual root data imaging, the reconstruction PSNR was 26.300 dB, and total computation time was only 67.210 s. The CPSO-OMP algorithm overcomes the problem of local optimum trapping and comprehensively enhances the precision during reconstruction.展开更多
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 inversio...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.展开更多
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 refle...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.展开更多
The sparse nature of location finding in the spatial domain makes it possible to exploit the Compressive Sensing (CS) theory for wireless location.CS-based location algorithm can largely reduce the number of online me...The sparse nature of location finding in the spatial domain makes it possible to exploit the Compressive Sensing (CS) theory for wireless location.CS-based location algorithm can largely reduce the number of online measurements while achieving a high level of localization accuracy,which makes the CS-based solution very attractive for indoor positioning.However,CS theory offers exact deterministic recovery of the sparse or compressible signals under two basic restriction conditions of sparsity and incoherence.In order to achieve a good recovery performance of sparse signals,CS-based solution needs to construct an efficient CS model.The model must satisfy the practical application requirements as well as following theoretical restrictions.In this paper,we propose two novel CS-based location solutions based on two different points of view:the CS-based algorithm with raising-dimension pre-processing and the CS-based algorithm with Minor Component Analysis (MCA).Analytical studies and simulations indicate that the proposed novel schemes achieve much higher localization accuracy.展开更多
基金Supported by The Featured Innovation Projects of the General University of Guangdong Province(2023KTSCX096)The Special Projects in Key Areas of Guangdong Province(ZDZX1088)Research Team Project of Guangdong University of Education(2024KYCXTD018)。
文摘This paper explores the recovery of block sparse signals in frame-based settings using the l_(2)/l_(q)-synthesis technique(0<q≤1).We propose a new null space property,referred to as block D-NSP_(q),which is based on the dictionary D.We establish that matrices adhering to the block D-NSP_(q)condition are both necessary and sufficient for the exact recovery of block sparse signals via l_(2)/l_(q)-synthesis.Additionally,this condition is essential for the stable recovery of signals that are block-compressible with respect to D.This D-NSP_(q)property is identified as the first complete condition for successful signal recovery using l_(2)/l_(q)-synthesis.Furthermore,we assess the theoretical efficacy of the l2/lq-synthesis method under conditions of measurement noise.
基金Supported by James Russell Hornsby and Jun Xiong Fund and United Imaging Healthcare.
文摘BACKGROUND A key cardiac magnetic resonance(CMR)challenge is breath-holding duration,difficult for cardiac patients.AIM To evaluate whether artificial intelligence-assisted compressed sensing CINE(AICS-CINE)reduces image acquisition time of CMR compared to conventional CINE(C-CINE).METHODS Cardio-oncology patients(n=60)and healthy volunteers(n=29)underwent sequential C-CINE and AI-CS-CINE with a 1.5-T scanner.Acquisition time,visual image quality assessment,and biventricular metrics(end-diastolic volume,endsystolic volume,stroke volume,ejection fraction,left ventricular mass,and wall thickness)were analyzed and compared between C-CINE and AI-CS-CINE with Bland–Altman analysis,and calculation of intraclass coefficient(ICC).RESULTS In 89 participants(58.5±16.8 years,42 males,47 females),total AI-CS-CINE acquisition and reconstruction time(37 seconds)was 84%faster than C-CINE(238 seconds).C-CINE required repeats in 23%(20/89)of cases(approximately 8 minutes lost),while AI-CS-CINE only needed one repeat(1%;2 seconds lost).AICS-CINE had slightly lower contrast but preserved structural clarity.Bland-Altman plots and ICC(0.73≤r≤0.98)showed strong agreement for left ventricle(LV)and right ventricle(RV)metrics,including those in the cardiac amyloidosis subgroup(n=31).AI-CS-CINE enabled faster,easier imaging in patients with claustrophobia,dyspnea,arrhythmias,or restlessness.Motion-artifacted C-CINE images were reliably interpreted from AI-CS-CINE.CONCLUSION AI-CS-CINE accelerated CMR image acquisition and reconstruction,preserved anatomical detail,and diminished impact of patient-related motion.Quantitative AI-CS-CINE metrics agreed closely with C-CINE in cardio-oncology patients,including the cardiac amyloidosis cohort,as well as healthy volunteers regardless of left and right ventricular size and function.AI-CS-CINE significantly enhanced CMR workflow,particularly in challenging cases.The strong analytical concordance underscores reliability and robustness of AI-CS-CINE as a valuable tool.
基金supported in part by the National Key Research and Development Program of China under Grant 2020YFB1804800。
文摘This paper considers the fundamental channel estimation problem for the multiple-input multiple-output orthogonal frequency division multiplexing(MIMO-OFDM)system in the presence of multi-cell interference.Specifically,this paper focuses on both channel modelling and receiver design for interference estimation and mitigation.We propose a delay-calibrated block-wise linear model,which extracts the delay of the dominant tap of each interference as a key parameter and approximates the residual channel coefficients by the recently developed blockwise linear model.Based on the delay-calibrated block-wise linear model and the angle-domain channel sparsity,we further conceive a message passing algorithm to solve the channel estimation problem.Numerical results demonstrate the superior performance of the proposed algorithm over the state-of-the-art algorithms.
基金supported by the National Natural Science Foundation of China(61931012,62171258,62088102,and 62271414)the Zhejiang Provincial Outstanding Youth Science Foundation(LR23F010001)the Key Project of Westlake Institute for Optoelectronics(2023GD007).
文摘It has been over a decade since the first coded aperture video compressive sensing(CS)system was reported.The underlying principle of this technology is to employ a high-frequency modulator in the optical path to modulate a recorded high-speed scene within one integration time.The superimposed image captured in this manner is modulated and compressed,since multiple modulation patterns are imposed.Following this,reconstruction algorithms are utilized to recover the desired high-speed scene.One leading advantage of video CS is that a single captured measurement can be used to reconstruct a multi-frame video,thereby enabling a low-speed camera to capture high-speed scenes.Inspired by this,a number of variants of video CS systems have been built,mainly using different modulation devices.Meanwhile,in order to obtain high-quality reconstruction videos,many algorithms have been developed,from optimization-based iterative algorithms to deep-learning-based ones.Recently,emerging deep learning methods have been dominant due to their high-speed inference and high-quality reconstruction,highlighting the possibility of deploying video CS in practical applications.Toward this end,this paper reviews the progress that has been achieved in video CS during the past decade.We further analyze the efforts that need to be made—in terms of both hardware and algorithms—to enable real applications.Research gaps are put forward and future directions are summarized to help researchers and engineers working on this topic.
基金supported by National Natural Science Foundation of China(Nos.61261016,61661025)Science and Technology Plan of Gansu Province(No.20JR10RA273).
文摘For image compression sensing reconstruction,most algorithms use the method of reconstructing image blocks one by one and stacking many convolutional layers,which usually have defects of obvious block effects,high computational complexity,and long reconstruction time.An image compressed sensing reconstruction network based on self-attention mechanism(SAMNet)was proposed.For the compressed sampling,self-attention convolution was designed,which was conducive to capturing richer features,so that the compressed sensing measurement value retained more image structure information.For the reconstruction,a self-attention mechanism was introduced in the convolutional neural network.A reconstruction network including residual blocks,bottleneck transformer(BoTNet),and dense blocks was proposed,which strengthened the transfer of image features and reduced the amount of parameters dramatically.Under the Set5 dataset,when the measurement rates are 0.01,0.04,0.10,and 0.25,the average peak signal-to-noise ratio(PSNR)of SAMNet is improved by 1.27,1.23,0.50,and 0.15 dB,respectively,compared to the CSNet+.The running time of reconstructing a 256×256 image is reduced by 0.1473,0.1789,0.2310,and 0.2524 s compared to ReconNet.Experimental results showed that SAMNet improved the quality of reconstructed images and reduced the reconstruction time.
基金supported by National Natural Science Foundation of China(12174350)Science and Technology Project of State Grid Henan Electric Power Company(5217Q0240008).
文摘In the heterogeneous power internet of things(IoT)environment,data signals are acquired to support different business systems to realize advanced intelligent applications,with massive,multi-source,heterogeneous and other characteristics.Reliable perception of information and efficient transmission of energy in multi-source heterogeneous environments are crucial issues.Compressive sensing(CS),as an effective method of signal compression and transmission,can accurately recover the original signal only by very few sampling.In this paper,we study a new method of multi-source heterogeneous data signal reconstruction of power IoT based on compressive sensing technology.Based on the traditional compressive sensing technology to directly recover multi-source heterogeneous signals,we fully use the interference subspace information to design the measurement matrix,which directly and effectively eliminates the interference while making the measurement.The measure matrix is optimized by minimizing the average cross-coherence of the matrix,and the reconstruction performance of the new method is further improved.Finally,the effectiveness of the new method with different parameter settings under different multi-source heterogeneous data signal cases is verified by using orthogonal matching pursuit(OMP)and sparsity adaptive matching pursuit(SAMP)for considering the actual environment with prior information utilization of signal sparsity and no prior information utilization of signal sparsity.
基金The National Natural Science Foundation of China(No.11274259)the Open Project Program of the Key Laboratory of Underwater Acoustic Signal Processing of Ministry of Education(No.UASP1305)
文摘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.
基金The National Natural Science Foundation of China (No.60872075)the National High Technology Research and Development Program of China (863 Program) (No.2008AA01Z227)
文摘In order to reduce the pilot number and improve spectral efficiency, recently emerged compressive sensing （CS） is applied to the digital broadcast channel estimation. According to the six channel profiles of the European Telecommunication Standards Institute（ETSI） digital radio mondiale （DRM） standard, the subspace pursuit （SP） algorithm is employed for delay spread and attenuation estimation of each path in the case where the channel profile is identified and the multipath number is known. The stop condition for SP is that the sparsity of the estimation equals the multipath number. For the case where the multipath number is unknown, the orthogonal matching pursuit （OMP） algorithm is employed for channel estimation, while the stop condition is that the estimation achieves the noise variance. Simulation results show that with the same number of pilots, CS algorithms outperform the traditional cubic-spline-interpolation-based least squares （LS） channel estimation. SP is also demonstrated to be better than OMP when the multipath number is known as a priori.
文摘Face hallucination or super-resolution is an inverse problem which is underdetermined,and the compressive sensing(CS)theory provides an effective way of seeking inverse problem solutions.In this paper,a novel compressive sensing based face hallucination method is presented,which is comprised of three steps:dictionary learning、sparse coding and solving maximum a posteriori(MAP)formulation.In the first step,the K-SVD dictionary learning algorithm is adopted to obtain a dictionary which can sparsely represent high resolution(HR)face image patches.In the second step,we seek the sparsest representation for each low-resolution(LR)face image paches input using the learned dictionary,super resolution image blocks are obtained from the sparsest coefficients and dictionaries,which then are assembled into super-resolution(SR)image.Finally,MAP formulation is introduced to satisfy the consistency restrictive condition and obtain the higher quality HR images.The experimental results demonstrate that our approach can achieve better super-resolution faces compared with other state-of-the-art method.
基金The National Natural Science Foundation of China(No.51575256)the Fundamental Research Funds for the Central Universities(No.NP2015101,XZA16003)the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD)
文摘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.
基金supported by the National High Technology Research and Development Program of China(No.2014AA06A602)National Natural Science Foundation of China(No.41404111)Natural Science Foundation of Hunan Province(No.2015JJ3088)
文摘In deep mineral exploration, the acquisition of audio magnetotelluric （AMT） data is severely affected by ambient noise near the observation sites; This near-field noise restricts investigation depths. Mathematical morphological filtering （MMF） proved effective in suppressing large-scale strong and variably shaped noise, typically low-frequency noise, but can not deal with pulse noise of AMT data. We combine compressive sensing and MMF. First we use MMF to suppress the large-scale strong ambient noise; second, we use the improved orthogonal match pursuit （IOMP） algorithm to remove the residual pulse noise. To remove the noise and protect the useful AMT signal, a redundant dictionary that matches with spikes and is insensitive to the useful signal is designed. Synthetic and field data from the Luzong field suggest that the proposed method suppresses the near-source noise and preserves the signal well; thus, better results are obtained that improve the output of either MMF or IOMP.
基金The National Basic Research Program of China(973Program)(No.2011CB707904)the National Natural Science Foundation of China(No.61201344,61271312,61073138)+1 种基金the Specialized Research Fund for the Doctoral Program of Higher Education(No.20110092110023,20120092120036)the Natural Science Foundation of Jiangsu Province(No.BK2012329)
文摘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.
基金Project(61171133) supported by the National Natural Science Foundation of ChinaProject(CX2011B019) supported by Hunan Provincial Innovation Foundation for Postgraduate,ChinaProject(B110404) supported by Innovation Foundation for Outstanding Postgraduates of National University of Defense Technology,China
文摘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.
基金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
文摘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.
文摘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.
基金supported by the Fundamental Research Funds for the Central Universities(DL13BB21)the Natural Science Foundation of Heilongjiang Province(C2015054)+1 种基金Heilongjiang Province Technology Foundation for Selected Osverseas ChineseNatural Science Foundation of Heilongjiang Province(F2015036)
文摘As the amount of data produced by ground penetrating radar （GPR） for roots is large, the transmission and the storage of data consumes great resources. To alleviate this problem, we propose here a root imaging algorithm using chaotic particle swarm optimal （CPSO） compressed sensing based on GPR data according to the sparsity of root space. Radar data are decomposed, observed, measured and represented in sparse manner, so roots image can be reconstructed with limited data. Firstly, radar signal measurement and sparse representation are implemented, and the solution space is established by wavelet basis and Gauss random matrix; secondly, the matching function is considered as the fitness function, and the best fitness value is found by a PSO algorithm; then, a chaotic search was used to obtain the global optimal operator; finally, the root image is reconstructed by the optimal operators. A-scan data, B-scan data, and complex data from American GSSI GPR is used, respectively, in the experimental test. For B-scan data, the computation time was reduced 60 % and PSNR was improved 5.539 dB; for actual root data imaging, the reconstruction PSNR was 26.300 dB, and total computation time was only 67.210 s. The CPSO-OMP algorithm overcomes the problem of local optimum trapping and comprehensively enhances the precision during reconstruction.
基金National Science and Technology Major Project(No.2016ZX05006-002 and 2017ZX05072-001).
文摘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.
基金supported by the Prominent Youth Fund of the National Natural Science Foundation of China (61025006)
文摘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.
基金supported by the National Natural Science Foundation of China under Grant No.61001119the Fund for Creative Research Groups of China under Grant No.61121001
文摘The sparse nature of location finding in the spatial domain makes it possible to exploit the Compressive Sensing (CS) theory for wireless location.CS-based location algorithm can largely reduce the number of online measurements while achieving a high level of localization accuracy,which makes the CS-based solution very attractive for indoor positioning.However,CS theory offers exact deterministic recovery of the sparse or compressible signals under two basic restriction conditions of sparsity and incoherence.In order to achieve a good recovery performance of sparse signals,CS-based solution needs to construct an efficient CS model.The model must satisfy the practical application requirements as well as following theoretical restrictions.In this paper,we propose two novel CS-based location solutions based on two different points of view:the CS-based algorithm with raising-dimension pre-processing and the CS-based algorithm with Minor Component Analysis (MCA).Analytical studies and simulations indicate that the proposed novel schemes achieve much higher localization accuracy.
