A fast converging sparse reconstruction algorithm in ghost imaging is presented. It utilizes total variation regularization and its formulation is based on the Karush-Kuhn-Tucker (KKT) theorem in the theory of convex ...A fast converging sparse reconstruction algorithm in ghost imaging is presented. It utilizes total variation regularization and its formulation is based on the Karush-Kuhn-Tucker (KKT) theorem in the theory of convex optimization. Tests using experimental data show that, compared with the algorithm of Gradient Projection for Sparse Reconstruction (GPSR), the proposed algorithm yields better results with less computation work.展开更多
Return signal processing and reconstruction plays a pivotal role in coherent field imaging, having a significant in- fluence on the quality of the reconstructed image. To reduce the required samples and accelerate the...Return signal processing and reconstruction plays a pivotal role in coherent field imaging, having a significant in- fluence on the quality of the reconstructed image. To reduce the required samples and accelerate the sampling process, we propose a genuine sparse reconstruction scheme based on compressed sensing theory. By analyzing the sparsity of the received signal in the Fourier spectrum domain, we accomplish an effective random projection and then reconstruct the return signal from as little as 10% of traditional samples, finally acquiring the target image precisely. The results of the numerical simulations and practical experiments verify the correctness of the proposed method, providing an efficient processing approach for imaging fast-moving targets in the future.展开更多
For the direction of arrival(DOA) estimation,traditional sparse reconstruction methods for wideband signals usually need many iteration times.For this problem,a new method for two-dimensional wideband signals based ...For the direction of arrival(DOA) estimation,traditional sparse reconstruction methods for wideband signals usually need many iteration times.For this problem,a new method for two-dimensional wideband signals based on block sparse reconstruction is proposed.First,a prolate spheroidal wave function(PSWF) is used to fit the wideband signals,then the block sparse reconstruction technology is employed for DOA estimation.The proposed method uses orthogonalization to choose the matching atoms,ensuring that the residual components correspond to the minimum absolute value.Meanwhile,the vectors obtained by iteration are back-disposed according to the corresponding atomic matching rules,so the extra atoms are abandoned in the course of iteration,and the residual components of current iteration are reduced.Thus the original sparse signals are reconstructed.The proposed method reduces iteration times comparing with the traditional reconstruction methods,and the estimation precision is better than the classical two-sided correlation transformation(TCT)algorithm when the snapshot is small or the signal-to-noise ratio(SNR) is low.展开更多
Orthogonal time-frequency space(OTFS)is a new modulation technique proposed in recent years for high Doppler wireless scenes.To solve the parameter estimation problem of the OTFS-integrated radar and communications sy...Orthogonal time-frequency space(OTFS)is a new modulation technique proposed in recent years for high Doppler wireless scenes.To solve the parameter estimation problem of the OTFS-integrated radar and communications system,we propose a parameter estimation method based on sparse reconstruction preprocessing to reduce the computational effort of the traditional weighted subspace fitting(WSF)algorithm.First,an OTFS-integrated echo signal model is constructed.Then,the echo signal is transformed to the time domain to separate the target angle from the range,and the range and angle of the detected target are coarsely estimated by using the sparse reconstruction algorithm.Finally,the WSF algorithm is used to refine the search with the coarse estimate at the center to obtain an accurate estimate.The simulations demonstrate the effectiveness and superiority of the proposed parameterestimation algorithm.展开更多
Although many multi-view clustering(MVC) algorithms with acceptable performances have been presented, to the best of our knowledge, nearly all of them need to be fed with the correct number of clusters. In addition, t...Although many multi-view clustering(MVC) algorithms with acceptable performances have been presented, to the best of our knowledge, nearly all of them need to be fed with the correct number of clusters. In addition, these existing algorithms create only the hard and fuzzy partitions for multi-view objects,which are often located in highly-overlapping areas of multi-view feature space. The adoption of hard and fuzzy partition ignores the ambiguity and uncertainty in the assignment of objects, likely leading to performance degradation. To address these issues, we propose a novel sparse reconstructive multi-view evidential clustering algorithm(SRMVEC). Based on a sparse reconstructive procedure, SRMVEC learns a shared affinity matrix across views, and maps multi-view objects to a 2-dimensional humanreadable chart by calculating 2 newly defined mathematical metrics for each object. From this chart, users can detect the number of clusters and select several objects existing in the dataset as cluster centers. Then, SRMVEC derives a credal partition under the framework of evidence theory, improving the fault tolerance of clustering. Ablation studies show the benefits of adopting the sparse reconstructive procedure and evidence theory. Besides,SRMVEC delivers effectiveness on benchmark datasets by outperforming some state-of-the-art methods.展开更多
Compressed sensing(CS) has achieved great success in single noise removal. However, it cannot restore the images contaminated with mixed noise efficiently. This paper introduces nonlocal similarity and cosparsity insp...Compressed sensing(CS) has achieved great success in single noise removal. However, it cannot restore the images contaminated with mixed noise efficiently. This paper introduces nonlocal similarity and cosparsity inspired by compressed sensing to overcome the difficulties in mixed noise removal, in which nonlocal similarity explores the signal sparsity from similar patches, and cosparsity assumes that the signal is sparse after a possibly redundant transform. Meanwhile, an adaptive scheme is designed to keep the balance between mixed noise removal and detail preservation based on local variance. Finally, IRLSM and RACoSaMP are adopted to solve the objective function. Experimental results demonstrate that the proposed method is superior to conventional CS methods, like K-SVD and state-of-art method nonlocally centralized sparse representation(NCSR), in terms of both visual results and quantitative measures.展开更多
The full wavefield detection method based on guided waves can efficiently detect and locate damages relying on the collection of large amounts of wavefield data.The acquisition process by scanning laser Doppler vibrom...The full wavefield detection method based on guided waves can efficiently detect and locate damages relying on the collection of large amounts of wavefield data.The acquisition process by scanning laser Doppler vibrometer(SLDV)is generally time-consuming,which is limited by Nyquist sampling theorem.To reduce the acquisition time,full wavefield data can be reconstructed from a small number of random sampling point signals combining with compressed sensing.However,the random sampling point signals need to be obtained by adding additional components to the SLDV system or offline processing.Because the random sparse sampling is difficult to achieve via the SLDV system,a new uniform sparse sampling strategy is proposed in this paper.By using the uniform sparse sampling coordinates instead of the random spatial sampling point coordinates,sparse sampling can be applied to SLDV without adding additional components or offline processing.The simulation and experimental results show that the proposed strategy can reduce the measurement locations required for accurate signal recovery to less than 90%of the Nyquist sampling grid,and the damage location error is within the minimum half wavelength.Compared with the conventional jittered sampling strategy,the proposed sampling strategy can directly reduce the sampling time of the SLDV system by more than 90%without adding additional components and achieve the same accuracy of guided wavefield reconstruction and damage location as the jittered sampling strategy.The research results can greatly improve the efficiency of damage detection technology based on wavefield analysis.展开更多
We propose and study an iterative sparse reconstruction for Fourier domain optical coherence tomography (FD OCT) image by solving a constrained optimization problem that minimizes L-1 norm. Our method takes the spec...We propose and study an iterative sparse reconstruction for Fourier domain optical coherence tomography (FD OCT) image by solving a constrained optimization problem that minimizes L-1 norm. Our method takes the spectral shape of the OCT light source into consideration in the iterative image reconstruction procedure that allows deconvolution of the axial point spread function from the blurred image during reconstruction rather than after reconstruction. By minimizing the L-1 norm, the axial resolution and the signal to noise ratio of image can both be enhanced. The effectiveness of our method is validated using numerical simulation and experiment.展开更多
Traditional direction of arrival(DOA)estimation methods based on sparse reconstruction commonly use convex or smooth functions to approximate non-convex and non-smooth sparse representation problems.This approach ofte...Traditional direction of arrival(DOA)estimation methods based on sparse reconstruction commonly use convex or smooth functions to approximate non-convex and non-smooth sparse representation problems.This approach often introduces errors into the sparse representation model,necessitating the development of improved DOA estimation algorithms.Moreover,conventional DOA estimation methods typically assume that the signal coincides with a predetermined grid.However,in reality,this assumption often does not hold true.The likelihood of a signal not aligning precisely with the predefined grid is high,resulting in potential grid mismatch issues for the algorithm.To address the challenges associated with grid mismatch and errors in sparse representation models,this article proposes a novel high-performance off-grid DOA estimation approach based on iterative proximal projection(IPP).In the proposed method,we employ an alternating optimization strategy to jointly estimate sparse signals and grid offset parameters.A proximal function optimization model is utilized to address non-convex and non-smooth sparse representation problems in DOA estimation.Subsequently,we leverage the smoothly clipped absolute deviation penalty(SCAD)function to compute the proximal operator for solving the model.Simulation and sea trial experiments have validated the superiority of the proposed method in terms of higher resolution and more accurate DOA estimation performance when compared to both traditional sparse reconstruction methods and advanced off-grid techniques.展开更多
A new iterative algorithm is proposed to reconstruct an unknown sparse signal from a set of projected measurements. Unlike existing greedy pursuit methods which only consider the atoms having the highest correlation w...A new iterative algorithm is proposed to reconstruct an unknown sparse signal from a set of projected measurements. Unlike existing greedy pursuit methods which only consider the atoms having the highest correlation with the residual signal, the proposed algorithm not only considers the higher correlation atoms but also reserves the lower correlation atoms with the residual signal. In the lower correlation atoms, only a few are correct which usually impact the reconstructive performance and decide the reconstruction dynamic range of greedy pursuit methods. The others are redundant. In order to avoid redundant atoms impacting the reconstructive accuracy, the Bayesian pursuit algorithm is used to eliminate them. Simulation results show that the proposed algorithm can improve the reconstructive dynamic range and the reconstructive accuracy. Furthermore, better noise immunity compared with the existing greedy pursuit methods can be obtained.展开更多
Synthetic aperture radar based on the matched filter theory has the ability of obtaining two-di- mensional image of the scattering areas. Nevertheless, the resolution and sidelobe level of SAR imaging is limited by th...Synthetic aperture radar based on the matched filter theory has the ability of obtaining two-di- mensional image of the scattering areas. Nevertheless, the resolution and sidelobe level of SAR imaging is limited by the antenna length and bandwidth of transmitted signal. However, for sparse signals (direct or indirect), sparse imaging methods can break through limitations of the conventional SAR methods. In this paper, we introduce the basic theory of sparse representation and reconstruction, and then analyze several common sparse imaging algorithms: the greed algorithm, the convex optimization algorithm. We apply some of these algorithms into SAR imaging using RadBasedata. The results show the presented method based on sparse construction theory outperforms the conventional SAR method based on MF theory.展开更多
In this paper,we propose a Quasi-Orthogonal Matching Pursuit(QOMP)algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials.For the two kinds of sampled data,data ...In this paper,we propose a Quasi-Orthogonal Matching Pursuit(QOMP)algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials.For the two kinds of sampled data,data with noises and without noises,we apply the mutual coherence of measurement matrix to establish the convergence of the QOMP algorithm which can reconstruct s-sparse Legendre polynomials,Chebyshev polynomials and trigonometric polynomials in s step iterations.The results are also extended to general bounded orthogonal system including tensor product of these three univariate orthogonal polynomials.Finally,numerical experiments will be presented to verify the effectiveness of the QOMP method.展开更多
An imaging algorithm based on compressed sensing(CS) for the multi-ship motion target is presented. In order to reduce the quantity of data transmission in searching the ships on a large sea area, both range and azi...An imaging algorithm based on compressed sensing(CS) for the multi-ship motion target is presented. In order to reduce the quantity of data transmission in searching the ships on a large sea area, both range and azimuth of the moving ship targets are converted into sparse representation under certain signal basis. The signal reconstruction algorithm based on CS at a distant calculation station, and the Keystone and fractional Fourier transform(FRFT) algorithm are used to compensate range migration and obtain Doppler frequency. When the sea ships satisfy the sparsity, the algorithm can obtain higher resolution in both range and azimuth than the conventional imaging algorithm. Some simulations are performed to verify the reliability and stability.展开更多
By studying the traditional spectral reflectance reconstruction method, spectral reflectance and the relative spectral power distribution of a lighting source are sparsely decomposed, and the orthogonal property of th...By studying the traditional spectral reflectance reconstruction method, spectral reflectance and the relative spectral power distribution of a lighting source are sparsely decomposed, and the orthogonal property of the principal component orthogonal basis is used to eliminate basis; then spectral reflectance data are obtained by solving a sparse coefficient. After theoretical analysis, the spectral reflectance reconstruction based on sparse prior knowledge of the principal component orthogonal basis by a single-pixel detector is carried out by software simulation and experiment. It can reduce the complexity and cost of the system, and has certain significance for the improvement of multispectral image acquisition technology.展开更多
The direction-of-arrival(DOA)estimation problem can be solved by the methods based on sparse Bayesian learning(SBL).To assure the accuracy,SBL needs massive amounts of snapshots which may lead to a huge computational ...The direction-of-arrival(DOA)estimation problem can be solved by the methods based on sparse Bayesian learning(SBL).To assure the accuracy,SBL needs massive amounts of snapshots which may lead to a huge computational workload.In order to reduce the snapshot number and computational complexity,a randomize-then-optimize(RTO)algorithm based DOA estimation method is proposed.The“learning”process for updating hyperparameters in SBL can be avoided by using the optimization and Metropolis-Hastings process in the RTO algorithm.To apply the RTO algorithm for a Laplace prior,a prior transformation technique is induced.To demonstrate the effectiveness of the proposed method,several simulations are proceeded,which verifies that the proposed method has better accuracy with 1 snapshot and shorter processing time than conventional compressive sensing(CS)based DOA methods.展开更多
A new method which employs compressive sensing(CS) to reconstruct the sparse spectrum is designed and experimentally demonstrated. On the basis of CS theory, the simulation results indicate that the probability of rec...A new method which employs compressive sensing(CS) to reconstruct the sparse spectrum is designed and experimentally demonstrated. On the basis of CS theory, the simulation results indicate that the probability of reconstruction is high when the step of the sparsity adaptive matching pursuit algorithm is confirmed as 1. Contrastive analysis for four kinds of commonly used measurement matrices: part Hadamard, Bernoulli, Toeplitz and Circular matrix, has been conducted. The results illustrate that the part Hadamard matrix has better performance of reconstruction than the other matrices. The experimental system of the spectral compression reconstruction is mainly based on the digital micro-mirror device(DMD). The experimental results prove that CS can reconstruct sparse spectrum well under the condition of 50% sampling rate. The system error 0.0781 is obtained, which is defined by the average value of the 2-norm. Furthermore, the proposed method shows a dominant ability to discard redundancy.展开更多
The performance guarantees of generalized orthogonal matching pursuit( gOMP) are considered in the framework of mutual coherence. The gOMP algorithmis an extension of the well-known OMP greed algorithmfor compressed...The performance guarantees of generalized orthogonal matching pursuit( gOMP) are considered in the framework of mutual coherence. The gOMP algorithmis an extension of the well-known OMP greed algorithmfor compressed sensing. It identifies multiple N indices per iteration to reconstruct sparse signals.The gOMP with N≥2 can perfectly reconstruct any K-sparse signals frommeasurement y = Φx if K 〈1/N(1/μ-1) +1,where μ is coherence parameter of measurement matrix Φ. Furthermore,the performance of the gOMP in the case of y = Φx + e with bounded noise ‖e‖2≤ε is analyzed and the sufficient condition ensuring identification of correct indices of sparse signals via the gOMP is derived,i. e.,K 〈1/N(1/μ-1)+1-(2ε/Nμxmin) ,where x min denotes the minimummagnitude of the nonzero elements of x. Similarly,the sufficient condition in the case of G aussian noise is also given.展开更多
A high resolution range profile(HRRP) is a summation vector of the sub-echoes of the target scattering points acquired by a wide-band radar.Generally, HRRPs obtained in a noncooperative complex electromagnetic environ...A high resolution range profile(HRRP) is a summation vector of the sub-echoes of the target scattering points acquired by a wide-band radar.Generally, HRRPs obtained in a noncooperative complex electromagnetic environment are contaminated by strong noise.Effective pre-processing of the HRRP data can greatly improve the accuracy of target recognition.In this paper, a denoising and reconstruction method for HRRP is proposed based on a Modified Sparse Auto-Encoder, which is a representative non-linear model.To better reconstruct the HRRP, a sparse constraint is added to the proposed model and the sparse coefficient is calculated based on the intrinsic dimension of HRRP.The denoising of the HRRP is performed by adding random noise to the input HRRP data during the training process and fine-tuning the weight matrix through singular-value decomposition.The results of simulations showed that the proposed method can both reconstruct the signal with fidelity and suppress noise effectively, significantly outperforming other methods, especially in low Signal-to-Noise Ratio conditions.展开更多
Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classi...Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classical research methods using mutual coherence or restricted isometry property of the measurement matrix,the recovery guarantee and the success probability of OMP are obtained directly by the greedy selection ratio and the probability theory.The results show that the failure probability of OMP given in this paper is exponential small with respect to the number of sampling points.In addition,the recovery guarantee of OMP obtained through classical methods is lager than that of ℓ_(1)-minimization whatever the sparsity of sparse polynomials is,while the recovery guarantee given in this paper is roughly the same as that of ℓ_(1)-minimization when the sparsity is less than 93.Finally,the numerical experiments verify the availability of the theoretical results.展开更多
In this paper,we present a surface reconstruction via 2D strokes and a vector field on the strokes based on a two-step method.In the first step,from sparse strokes drawn by artists and a given vector field on the stro...In this paper,we present a surface reconstruction via 2D strokes and a vector field on the strokes based on a two-step method.In the first step,from sparse strokes drawn by artists and a given vector field on the strokes,we propose a nonlinear vector interpolation combining total variation(TV)and H1 regularization with a curl-free constraint for obtaining a dense vector field.In the second step,a height map is obtained by integrating the dense vector field in the first step.Jump discontinuities in surface and discontinuities of surface gradients can be well reconstructed without any surface distortion.We also provide a fast and efficient algorithm for solving the proposed functionals.Since vectors on the strokes are interpreted as a projection of surface gradients onto the plane,different types of strokes are easily devised to generate geometrically crucial structures such as ridge,valley,jump,bump,and dip on the surface.The stroke types help users to create a surface which they intuitively imagine from 2D strokes.We compare our results with conventional methods via many examples.展开更多
基金Supported by the Hi-Tech Research and Development Program of China (No. 2011AA120102)
文摘A fast converging sparse reconstruction algorithm in ghost imaging is presented. It utilizes total variation regularization and its formulation is based on the Karush-Kuhn-Tucker (KKT) theorem in the theory of convex optimization. Tests using experimental data show that, compared with the algorithm of Gradient Projection for Sparse Reconstruction (GPSR), the proposed algorithm yields better results with less computation work.
基金supported by the National Natural Science Foundation of China(Grant No.61505248)the Fund from Chinese Academy of Sciences,the Light of"Western"Talent Cultivation Plan"Dr.Western Fund Project"(Grant No.Y429621213)
文摘Return signal processing and reconstruction plays a pivotal role in coherent field imaging, having a significant in- fluence on the quality of the reconstructed image. To reduce the required samples and accelerate the sampling process, we propose a genuine sparse reconstruction scheme based on compressed sensing theory. By analyzing the sparsity of the received signal in the Fourier spectrum domain, we accomplish an effective random projection and then reconstruct the return signal from as little as 10% of traditional samples, finally acquiring the target image precisely. The results of the numerical simulations and practical experiments verify the correctness of the proposed method, providing an efficient processing approach for imaging fast-moving targets in the future.
基金supported by the National Natural Science Foundation of China(6150117661201399)+1 种基金the Education Department of Heilongjiang Province Science and Technology Research Projects(12541638)the Developing Key Laboratory of Sensing Technology and Systems in Cold Region of Heilongjiang Province and Ministry of Education,(Heilongjiang University),P.R.China(P201408)
文摘For the direction of arrival(DOA) estimation,traditional sparse reconstruction methods for wideband signals usually need many iteration times.For this problem,a new method for two-dimensional wideband signals based on block sparse reconstruction is proposed.First,a prolate spheroidal wave function(PSWF) is used to fit the wideband signals,then the block sparse reconstruction technology is employed for DOA estimation.The proposed method uses orthogonalization to choose the matching atoms,ensuring that the residual components correspond to the minimum absolute value.Meanwhile,the vectors obtained by iteration are back-disposed according to the corresponding atomic matching rules,so the extra atoms are abandoned in the course of iteration,and the residual components of current iteration are reduced.Thus the original sparse signals are reconstructed.The proposed method reduces iteration times comparing with the traditional reconstruction methods,and the estimation precision is better than the classical two-sided correlation transformation(TCT)algorithm when the snapshot is small or the signal-to-noise ratio(SNR) is low.
基金supported by the National Natural Science Foundation of China(No.61871203)the Postgraduate Scientific Research and Innovation Projects of Jiangsu Province,China(No.KYCX23_3878)。
文摘Orthogonal time-frequency space(OTFS)is a new modulation technique proposed in recent years for high Doppler wireless scenes.To solve the parameter estimation problem of the OTFS-integrated radar and communications system,we propose a parameter estimation method based on sparse reconstruction preprocessing to reduce the computational effort of the traditional weighted subspace fitting(WSF)algorithm.First,an OTFS-integrated echo signal model is constructed.Then,the echo signal is transformed to the time domain to separate the target angle from the range,and the range and angle of the detected target are coarsely estimated by using the sparse reconstruction algorithm.Finally,the WSF algorithm is used to refine the search with the coarse estimate at the center to obtain an accurate estimate.The simulations demonstrate the effectiveness and superiority of the proposed parameterestimation algorithm.
基金supported in part by NUS startup grantthe National Natural Science Foundation of China (52076037)。
文摘Although many multi-view clustering(MVC) algorithms with acceptable performances have been presented, to the best of our knowledge, nearly all of them need to be fed with the correct number of clusters. In addition, these existing algorithms create only the hard and fuzzy partitions for multi-view objects,which are often located in highly-overlapping areas of multi-view feature space. The adoption of hard and fuzzy partition ignores the ambiguity and uncertainty in the assignment of objects, likely leading to performance degradation. To address these issues, we propose a novel sparse reconstructive multi-view evidential clustering algorithm(SRMVEC). Based on a sparse reconstructive procedure, SRMVEC learns a shared affinity matrix across views, and maps multi-view objects to a 2-dimensional humanreadable chart by calculating 2 newly defined mathematical metrics for each object. From this chart, users can detect the number of clusters and select several objects existing in the dataset as cluster centers. Then, SRMVEC derives a credal partition under the framework of evidence theory, improving the fault tolerance of clustering. Ablation studies show the benefits of adopting the sparse reconstructive procedure and evidence theory. Besides,SRMVEC delivers effectiveness on benchmark datasets by outperforming some state-of-the-art methods.
基金supported by the National Natural Science Foundation of China(Nos.61403146 and 61603105)the Fundamental Research Funds for the Central Universities(No.2015ZM128)the Science and Technology Program of Guangzhou in China(Nos.201707010054 and 201704030072)
文摘Compressed sensing(CS) has achieved great success in single noise removal. However, it cannot restore the images contaminated with mixed noise efficiently. This paper introduces nonlocal similarity and cosparsity inspired by compressed sensing to overcome the difficulties in mixed noise removal, in which nonlocal similarity explores the signal sparsity from similar patches, and cosparsity assumes that the signal is sparse after a possibly redundant transform. Meanwhile, an adaptive scheme is designed to keep the balance between mixed noise removal and detail preservation based on local variance. Finally, IRLSM and RACoSaMP are adopted to solve the objective function. Experimental results demonstrate that the proposed method is superior to conventional CS methods, like K-SVD and state-of-art method nonlocally centralized sparse representation(NCSR), in terms of both visual results and quantitative measures.
基金the National Science Foundation of China(NSFC)with agreement number 11520101001.
文摘The full wavefield detection method based on guided waves can efficiently detect and locate damages relying on the collection of large amounts of wavefield data.The acquisition process by scanning laser Doppler vibrometer(SLDV)is generally time-consuming,which is limited by Nyquist sampling theorem.To reduce the acquisition time,full wavefield data can be reconstructed from a small number of random sampling point signals combining with compressed sensing.However,the random sampling point signals need to be obtained by adding additional components to the SLDV system or offline processing.Because the random sparse sampling is difficult to achieve via the SLDV system,a new uniform sparse sampling strategy is proposed in this paper.By using the uniform sparse sampling coordinates instead of the random spatial sampling point coordinates,sparse sampling can be applied to SLDV without adding additional components or offline processing.The simulation and experimental results show that the proposed strategy can reduce the measurement locations required for accurate signal recovery to less than 90%of the Nyquist sampling grid,and the damage location error is within the minimum half wavelength.Compared with the conventional jittered sampling strategy,the proposed sampling strategy can directly reduce the sampling time of the SLDV system by more than 90%without adding additional components and achieve the same accuracy of guided wavefield reconstruction and damage location as the jittered sampling strategy.The research results can greatly improve the efficiency of damage detection technology based on wavefield analysis.
基金supported in part by the government of United States,NIH BRP grants 1R01 EB 007969NIH/NIE R011R01EY021540-01A1,and by internal start-up research funding from Michigan Technological University
文摘We propose and study an iterative sparse reconstruction for Fourier domain optical coherence tomography (FD OCT) image by solving a constrained optimization problem that minimizes L-1 norm. Our method takes the spectral shape of the OCT light source into consideration in the iterative image reconstruction procedure that allows deconvolution of the axial point spread function from the blurred image during reconstruction rather than after reconstruction. By minimizing the L-1 norm, the axial resolution and the signal to noise ratio of image can both be enhanced. The effectiveness of our method is validated using numerical simulation and experiment.
基金supported by the National Science Foundation for Distinguished Young Scholars(Grant No.62125104)the National Natural Science Foundation of China(Grant No.52071111).
文摘Traditional direction of arrival(DOA)estimation methods based on sparse reconstruction commonly use convex or smooth functions to approximate non-convex and non-smooth sparse representation problems.This approach often introduces errors into the sparse representation model,necessitating the development of improved DOA estimation algorithms.Moreover,conventional DOA estimation methods typically assume that the signal coincides with a predetermined grid.However,in reality,this assumption often does not hold true.The likelihood of a signal not aligning precisely with the predefined grid is high,resulting in potential grid mismatch issues for the algorithm.To address the challenges associated with grid mismatch and errors in sparse representation models,this article proposes a novel high-performance off-grid DOA estimation approach based on iterative proximal projection(IPP).In the proposed method,we employ an alternating optimization strategy to jointly estimate sparse signals and grid offset parameters.A proximal function optimization model is utilized to address non-convex and non-smooth sparse representation problems in DOA estimation.Subsequently,we leverage the smoothly clipped absolute deviation penalty(SCAD)function to compute the proximal operator for solving the model.Simulation and sea trial experiments have validated the superiority of the proposed method in terms of higher resolution and more accurate DOA estimation performance when compared to both traditional sparse reconstruction methods and advanced off-grid techniques.
基金supported by the National Natural Science Foundation of China (61172138)the Specialized Research Fund for the Doctoral Program of Higher Education (200807011007)the Natural Science Basic Research Program in Shannxi Province of China (2013JQ8040)
文摘A new iterative algorithm is proposed to reconstruct an unknown sparse signal from a set of projected measurements. Unlike existing greedy pursuit methods which only consider the atoms having the highest correlation with the residual signal, the proposed algorithm not only considers the higher correlation atoms but also reserves the lower correlation atoms with the residual signal. In the lower correlation atoms, only a few are correct which usually impact the reconstructive performance and decide the reconstruction dynamic range of greedy pursuit methods. The others are redundant. In order to avoid redundant atoms impacting the reconstructive accuracy, the Bayesian pursuit algorithm is used to eliminate them. Simulation results show that the proposed algorithm can improve the reconstructive dynamic range and the reconstructive accuracy. Furthermore, better noise immunity compared with the existing greedy pursuit methods can be obtained.
文摘Synthetic aperture radar based on the matched filter theory has the ability of obtaining two-di- mensional image of the scattering areas. Nevertheless, the resolution and sidelobe level of SAR imaging is limited by the antenna length and bandwidth of transmitted signal. However, for sparse signals (direct or indirect), sparse imaging methods can break through limitations of the conventional SAR methods. In this paper, we introduce the basic theory of sparse representation and reconstruction, and then analyze several common sparse imaging algorithms: the greed algorithm, the convex optimization algorithm. We apply some of these algorithms into SAR imaging using RadBasedata. The results show the presented method based on sparse construction theory outperforms the conventional SAR method based on MF theory.
基金supported by National Natural Science Foundation of China no.12071019.
文摘In this paper,we propose a Quasi-Orthogonal Matching Pursuit(QOMP)algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials.For the two kinds of sampled data,data with noises and without noises,we apply the mutual coherence of measurement matrix to establish the convergence of the QOMP algorithm which can reconstruct s-sparse Legendre polynomials,Chebyshev polynomials and trigonometric polynomials in s step iterations.The results are also extended to general bounded orthogonal system including tensor product of these three univariate orthogonal polynomials.Finally,numerical experiments will be presented to verify the effectiveness of the QOMP method.
基金supported by the National Natural Science Foundation of China(61271342)
文摘An imaging algorithm based on compressed sensing(CS) for the multi-ship motion target is presented. In order to reduce the quantity of data transmission in searching the ships on a large sea area, both range and azimuth of the moving ship targets are converted into sparse representation under certain signal basis. The signal reconstruction algorithm based on CS at a distant calculation station, and the Keystone and fractional Fourier transform(FRFT) algorithm are used to compensate range migration and obtain Doppler frequency. When the sea ships satisfy the sparsity, the algorithm can obtain higher resolution in both range and azimuth than the conventional imaging algorithm. Some simulations are performed to verify the reliability and stability.
基金supported by the National Natural Science Foundation of China (Grant No.61405115)the Natural Science Foundation of Shanghai (Grant No.14ZR1428400)+1 种基金the Innovation Project of Shanghai Municipal Education Commission (Grant No.14YZ099)National Basic Research Program of China (973 Program) (Grant No.2015CB352004)
文摘By studying the traditional spectral reflectance reconstruction method, spectral reflectance and the relative spectral power distribution of a lighting source are sparsely decomposed, and the orthogonal property of the principal component orthogonal basis is used to eliminate basis; then spectral reflectance data are obtained by solving a sparse coefficient. After theoretical analysis, the spectral reflectance reconstruction based on sparse prior knowledge of the principal component orthogonal basis by a single-pixel detector is carried out by software simulation and experiment. It can reduce the complexity and cost of the system, and has certain significance for the improvement of multispectral image acquisition technology.
基金This work was supported by the National Natural Science Foundation of China under Grants No.61871083 and No.61721001.
文摘The direction-of-arrival(DOA)estimation problem can be solved by the methods based on sparse Bayesian learning(SBL).To assure the accuracy,SBL needs massive amounts of snapshots which may lead to a huge computational workload.In order to reduce the snapshot number and computational complexity,a randomize-then-optimize(RTO)algorithm based DOA estimation method is proposed.The“learning”process for updating hyperparameters in SBL can be avoided by using the optimization and Metropolis-Hastings process in the RTO algorithm.To apply the RTO algorithm for a Laplace prior,a prior transformation technique is induced.To demonstrate the effectiveness of the proposed method,several simulations are proceeded,which verifies that the proposed method has better accuracy with 1 snapshot and shorter processing time than conventional compressive sensing(CS)based DOA methods.
基金supported by the National Natural Science Foundation of China(Nos.61002013 and 11504435)the Natural Science Foundation of Hubei Province(No.2014CFA051)+1 种基金the Key Technology R&D Program of Hubei Province(No.2015BCE048)the Fundamental Research Funds for the Central Universities,South-Central University for Nationalities(Nos.CZY13034,CZW15055 and CZP17026)
文摘A new method which employs compressive sensing(CS) to reconstruct the sparse spectrum is designed and experimentally demonstrated. On the basis of CS theory, the simulation results indicate that the probability of reconstruction is high when the step of the sparsity adaptive matching pursuit algorithm is confirmed as 1. Contrastive analysis for four kinds of commonly used measurement matrices: part Hadamard, Bernoulli, Toeplitz and Circular matrix, has been conducted. The results illustrate that the part Hadamard matrix has better performance of reconstruction than the other matrices. The experimental system of the spectral compression reconstruction is mainly based on the digital micro-mirror device(DMD). The experimental results prove that CS can reconstruct sparse spectrum well under the condition of 50% sampling rate. The system error 0.0781 is obtained, which is defined by the average value of the 2-norm. Furthermore, the proposed method shows a dominant ability to discard redundancy.
基金Supported by the National Natural Science Foundation of China(60119944,61331021)the National Key Basic Research Program Founded by MOST(2010C B731902)+1 种基金the Program for Changjiang Scholars and Innovative Research Team in University(IRT1005)Beijing Higher Education Young Elite Teacher Project(YET P1159)
文摘The performance guarantees of generalized orthogonal matching pursuit( gOMP) are considered in the framework of mutual coherence. The gOMP algorithmis an extension of the well-known OMP greed algorithmfor compressed sensing. It identifies multiple N indices per iteration to reconstruct sparse signals.The gOMP with N≥2 can perfectly reconstruct any K-sparse signals frommeasurement y = Φx if K 〈1/N(1/μ-1) +1,where μ is coherence parameter of measurement matrix Φ. Furthermore,the performance of the gOMP in the case of y = Φx + e with bounded noise ‖e‖2≤ε is analyzed and the sufficient condition ensuring identification of correct indices of sparse signals via the gOMP is derived,i. e.,K 〈1/N(1/μ-1)+1-(2ε/Nμxmin) ,where x min denotes the minimummagnitude of the nonzero elements of x. Similarly,the sufficient condition in the case of G aussian noise is also given.
基金co-supported by the National Natural Science Foundation of China(Nos.61671463,61471379,61790551 and 61102166)。
文摘A high resolution range profile(HRRP) is a summation vector of the sub-echoes of the target scattering points acquired by a wide-band radar.Generally, HRRPs obtained in a noncooperative complex electromagnetic environment are contaminated by strong noise.Effective pre-processing of the HRRP data can greatly improve the accuracy of target recognition.In this paper, a denoising and reconstruction method for HRRP is proposed based on a Modified Sparse Auto-Encoder, which is a representative non-linear model.To better reconstruct the HRRP, a sparse constraint is added to the proposed model and the sparse coefficient is calculated based on the intrinsic dimension of HRRP.The denoising of the HRRP is performed by adding random noise to the input HRRP data during the training process and fine-tuning the weight matrix through singular-value decomposition.The results of simulations showed that the proposed method can both reconstruct the signal with fidelity and suppress noise effectively, significantly outperforming other methods, especially in low Signal-to-Noise Ratio conditions.
基金supported by the National Natural Science Foundation of China(Grant No.12071019).
文摘Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classical research methods using mutual coherence or restricted isometry property of the measurement matrix,the recovery guarantee and the success probability of OMP are obtained directly by the greedy selection ratio and the probability theory.The results show that the failure probability of OMP given in this paper is exponential small with respect to the number of sampling points.In addition,the recovery guarantee of OMP obtained through classical methods is lager than that of ℓ_(1)-minimization whatever the sparsity of sparse polynomials is,while the recovery guarantee given in this paper is roughly the same as that of ℓ_(1)-minimization when the sparsity is less than 93.Finally,the numerical experiments verify the availability of the theoretical results.
基金The research is supported by MOE(Ministry of Education)Tier II project T207N2202and National Research Foundation grant,which is administered by the Media Development Authority Interactive Digital Media Programme Office,MDA(IDMPO).
文摘In this paper,we present a surface reconstruction via 2D strokes and a vector field on the strokes based on a two-step method.In the first step,from sparse strokes drawn by artists and a given vector field on the strokes,we propose a nonlinear vector interpolation combining total variation(TV)and H1 regularization with a curl-free constraint for obtaining a dense vector field.In the second step,a height map is obtained by integrating the dense vector field in the first step.Jump discontinuities in surface and discontinuities of surface gradients can be well reconstructed without any surface distortion.We also provide a fast and efficient algorithm for solving the proposed functionals.Since vectors on the strokes are interpreted as a projection of surface gradients onto the plane,different types of strokes are easily devised to generate geometrically crucial structures such as ridge,valley,jump,bump,and dip on the surface.The stroke types help users to create a surface which they intuitively imagine from 2D strokes.We compare our results with conventional methods via many examples.