In this paper,we focus on the recovery of piecewise sparse signals containing both fast-decaying and slow-decaying nonzero entries.In order to improve the performance of classic Orthogonal Matching Pursuit(OMP)and Gen...In this paper,we focus on the recovery of piecewise sparse signals containing both fast-decaying and slow-decaying nonzero entries.In order to improve the performance of classic Orthogonal Matching Pursuit(OMP)and Generalized Orthogonal Matching Pursuit(GOMP)algorithms for solving this problem,we propose the Piecewise Generalized Orthogonal Matching Pursuit(PGOMP)algorithm,by considering the mixed-decaying sparse signals as piecewise sparse signals with two components containing nonzero entries with different decay factors.The algorithm incorporates piecewise selection and deletion to retain the most significant entries according to the sparsity of each component.We provide a theoretical analysis based on the mutual coherence of the measurement matrix and the decay factors of the nonzero entries,establishing a sufficient condition for the PGOMP algorithm to select at least two correct indices in each iteration.Numerical simulations and an image decomposition experiment demonstrate that the proposed algorithm significantly improves the support recovery probability by effectively matching piecewise sparsity with decay factors.展开更多
This research proposes a novel three-dimensional gravity inversion based on sparse recovery in compress sensing. Zero norm is selected as the objective function, which is then iteratively solved by the approximate zer...This research proposes a novel three-dimensional gravity inversion based on sparse recovery in compress sensing. Zero norm is selected as the objective function, which is then iteratively solved by the approximate zero norm solution. The inversion approach mainly employs forward modeling; a depth weight function is introduced into the objective function of the zero norms. Sparse inversion results are obtained by the corresponding optimal mathematical method. To achieve the practical geophysical and geological significance of the results, penalty function is applied to constrain the density values. Results obtained by proposed provide clear boundary depth and density contrast distribution information. The method's accuracy, validity, and reliability are verified by comparing its results with those of synthetic models. To further explain its reliability, a practical gravity data is obtained for a region in Texas, USA is applied. Inversion results for this region are compared with those of previous studies, including a research of logging data in the same area. The depth of salt dome obtained by the inversion method is 4.2 km, which is in good agreement with the 4.4 km value from the logging data. From this, the practicality of the inversion method is also validated.展开更多
Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design...Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.展开更多
The traditional super-resolution direction finding methods based on sparse recovery need to divide the estimation space into several discrete angle grids, which will bring the final result some error. To this problem,...The traditional super-resolution direction finding methods based on sparse recovery need to divide the estimation space into several discrete angle grids, which will bring the final result some error. To this problem, a novel method for wideband signals by sparse recovery in the frequency domain is proposed. The optimization functions are found and solved by the received data at every frequency, on this basis, the sparse support set is obtained, then the direction of arrival (DOA) is acquired by integrating the information of all frequency bins, and the initial signal can also be recovered. This method avoids the error caused by sparse recovery methods based on grid division, and the degree of freedom is also expanded by array transformation, especially it has a preferable performance under the circumstances of a small number of snapshots and a low signal to noise ratio (SNR).展开更多
A novel Direction-Of-Arrival (DOA) estimation method is proposed in the presence of mutual coupling using the joint sparse recovery. In the proposed method, the eigenvector corresponding to the maximum eigenvalue of c...A novel Direction-Of-Arrival (DOA) estimation method is proposed in the presence of mutual coupling using the joint sparse recovery. In the proposed method, the eigenvector corresponding to the maximum eigenvalue of covariance matrix of array measurement is viewed as the signal to be represented. By exploiting the geometrical property in steering vectors and the symmetric Toeplitz structure of Mutual Coupling Matrix (MCM), the redundant dictionaries containing the DOA information are constructed. Consequently, the optimization model based on joint sparse recovery is built and then is solved through Second Order Cone Program (SOCP) and Interior Point Method (IPM). The DOA estimates are gotten according to the positions of nonzeros elements. At last, computer simulations demonstrate the excellent performance of the proposed method.展开更多
Sparse recovery(or sparse representation) is a widely studied issue in the fields of signal processing, image processing, computer vision, machine learning and so on, since signals such as videos and images, can be sp...Sparse recovery(or sparse representation) is a widely studied issue in the fields of signal processing, image processing, computer vision, machine learning and so on, since signals such as videos and images, can be sparsely represented under some frames. Most of fast algorithms at present are based on solving l0or l1minimization problems and they are efficient in sparse recovery. However, the theoretically sufficient conditions on the sparsity of the signal for l0or l1minimization problems and algorithms are too strict. In some applications, there are signals with structures, i.e., the nonzero entries have some certain distribution. In this paper,we consider the uniqueness and feasible conditions for piecewise sparse recovery. Piecewise sparsity means that the sparse signal x is a union of several sparse sub-signals xi(i=1, 2,..., N),i.e., x=(x_(1)^(T), x_(2)^(T),..., x_(N)^(T))T, corresponding to the measurement matrix A which is composed of union of bases A=[A_(1), A_(2),..., A_(N)]. We introduce the mutual coherence for the sub-matrices Ai(i = 1, 2,..., N) by considering the block structure of A corresponding to piecewise sparse signal x, to study the new upper bounds of ‖x‖0(number of nonzero entries of signal) recovered by both l0and l1optimizations. The structured information of measurement matrix A is exploited to improve the sufficient conditions for successfully piecewise sparse recovery and also improve the reliability of l0and l1optimization models on recovering global sparse vectors.展开更多
The method of recovering a low-rank matrix with an unknown fraction whose entries are arbitrarily corrupted is known as the robust principal component analysis （RPCA）. This RPCA problem, under some conditions, can b...The method of recovering a low-rank matrix with an unknown fraction whose entries are arbitrarily corrupted is known as the robust principal component analysis （RPCA）. This RPCA problem, under some conditions, can be exactly solved via convex optimization by minimizing a combination of the nuclear norm and the 11 norm. In this paper, an algorithm based on the Douglas-Rachford splitting method is proposed for solving the RPCA problem. First, the convex optimization problem is solved by canceling the constraint of the variables, and ~hen the proximity operators of the objective function are computed alternately. The new algorithm can exactly recover the low-rank and sparse components simultaneously, and it is proved to be convergent. Numerical simulations demonstrate the practical utility of the proposed algorithm.展开更多
In order to improve the performance of linear time-varying（LTV）channel estimation,based on the sparsity of channel taps in time domain,a sparse recovery method of LTV channel in orthogonal frequency division multipl...In order to improve the performance of linear time-varying（LTV）channel estimation,based on the sparsity of channel taps in time domain,a sparse recovery method of LTV channel in orthogonal frequency division multiplexing（OFDM）system is proposed.Firstly,based on the compressive sensing theory,the average of the channel taps over one symbol duration in the LTV channel model is estimated.Secondly,in order to deal with the inter-carrier interference（ICI）,the group-pilot design criterion is used based on the minimization of mutual coherence of the measurement.Finally,an efficient pilot pattern optimization algorithm is proposed by a dual layer loops iteration.The simulation results show that the new method uses less pilots,has a smaller bit error ratio（BER）,and greater ability to deal with Doppler frequency shift than the traditional method does.展开更多
Sparse signal recovery is a topic of considerable interest,and the literature in this field is already quite immense.Many problems that arise in sparse signal recovery can be generalized as a convex programming with l...Sparse signal recovery is a topic of considerable interest,and the literature in this field is already quite immense.Many problems that arise in sparse signal recovery can be generalized as a convex programming with linear conic constraints.In this paper,we present a new proximal point algorithm(PPA) termed as relaxed-PPA(RPPA) contraction method,for solving this common convex programming.More precisely,we first reformulate the convex programming into an equivalent variational inequality(VI),and then efficiently explore its inner structure.In each step,our method relaxes the VI-subproblem to a tractable one,which can be solved much more efficiently than the original VI.Under mild conditions,the convergence of the proposed method is proved.Experiments with l1 analysis show that RPPA is a computationally efficient algorithm and compares favorably with the recently proposed state-of-the-art algorithms.展开更多
A greedy algorithm used for the recovery of sparse signals,multiple orthogonal least squares(MOLS)have recently attracted quite a big of attention.In this paper,we consider the number of iterations required for the MO...A greedy algorithm used for the recovery of sparse signals,multiple orthogonal least squares(MOLS)have recently attracted quite a big of attention.In this paper,we consider the number of iterations required for the MOLS algorithm for recovery of a K-sparse signal x∈R^(n).We show that MOLS provides stable reconstruction of all K-sparse signals x from y=Ax+w in|6K/ M|iterations when the matrix A satisfies the restricted isometry property(RIP)with isometry constantδ_(7K)≤0.094.Compared with the existing results,our sufficient condition is not related to the sparsity level K.展开更多
Pulse signal recovery is to extract useful amplitude and time information from the pulse signal contaminated by noise. It is a great challenge to precisely recover the pulse signal in loud background noise. The conven...Pulse signal recovery is to extract useful amplitude and time information from the pulse signal contaminated by noise. It is a great challenge to precisely recover the pulse signal in loud background noise. The conventional approaches,which are mostly based on the distribution of the pulse energy spectrum,do not well determine the locations and shapes of the pulses. In this paper,we propose a time domain method to reconstruct pulse signals. In the proposed approach,a sparse representation model is established to deal with the issue of the pulse signal recovery under noise conditions. The corresponding problem based on the sparse optimization model is solved by a matching pursuit algorithm. Simulations and experiments validate the effectiveness of the proposed approach on pulse signal recovery.展开更多
Separation and recovery of 152+154Eu and 90Sr from radioactive waste using tracer concentration from active material from waste tank in the ET-RR1 Egypt via hollow fiber supported liquid membrane (HFSLM) were achieved...Separation and recovery of 152+154Eu and 90Sr from radioactive waste using tracer concentration from active material from waste tank in the ET-RR1 Egypt via hollow fiber supported liquid membrane (HFSLM) were achieved. The Polypropylene was used as supporter to carrier 0.5M Cyanex301/kerosene (bis(2,4,4-trimethylpentyl)dithiophosphinic acid and 0.1MEDTA as stripping of 152+154Eu and 90Sr ions from nitrate medium at pH ~3.6. The separation factor was found to be ~4 for 152+154Eu over 90Sr. The aqueous feed of mass transfer coefficient (ki) and the organic mass transfer coefficient (km) were calculated to be (1.52 and 4.5) × 10﹣2cm/s, respectively. In addition, the mass transfer modeling was performed and the validity of the developed model from experimental data was found to join in well with the theoretical values when the Cyanex301 concentration is higher than 1% (v/v). The number of cycles evaluated for complete separation of 152+154Eu and 90Sr is five cycles.展开更多
We consider the problem of constructing one sparse signal from a few measurements. This problem has been extensively addressed in the literature, providing many sub-optimal methods that assure convergence to a locally...We consider the problem of constructing one sparse signal from a few measurements. This problem has been extensively addressed in the literature, providing many sub-optimal methods that assure convergence to a locally optimal solution under specific conditions. There are a few measurements associated with every signal, where the size of each measurement vector is less than the sparse signal＇s size. All of the sparse signals have the same unknown support. We generalize an existing algorithm for the recovery of one sparse signal from a single measurement to this problem and analyze its performances through simulations. We also compare the construction performance with other existing algorithms. Finally, the proposed method also shows advantages over the OMP （Orthogonal Matching Pursuit） algorithm in terms of the computational complexity.展开更多
基于稀疏恢复的空时自适应算法(Sparse Recovery Space Time Adaptive Processing,SR-STAP)能有效改善机载雷达在复杂环境下对杂波的抑制能力,通常是将空时平面均匀离散为若干个网格来构造字典。然而,真实的杂波点往往不能落在预先离散...基于稀疏恢复的空时自适应算法(Sparse Recovery Space Time Adaptive Processing,SR-STAP)能有效改善机载雷达在复杂环境下对杂波的抑制能力,通常是将空时平面均匀离散为若干个网格来构造字典。然而,真实的杂波点往往不能落在预先离散的网格点上,此时会出现离网效应,导致SR-STAP的性能降低。本文针对此问题,提出了一种基于知识辅助的字典校正方法。首先利用载机平台参数等先验知识均匀离散空间频率,然后计算和修正多普勒频率,并根据先验知识修正空间频率,最后利用修正后的空间频率和多普勒频率对应的空时导向矢量来构造超完备稀疏字典。仿真结果表明,与传统字典构造算法相比,该字典校正方法有效克服了离网效应,改善了STAP的性能。展开更多
Inverse synthetic aperture radar (ISAR) image can be represented and reconstructed by sparse recovery (SR) approaches. However, the existing SR algorithms, which are used for ISAR imaging, have suffered from high comp...Inverse synthetic aperture radar (ISAR) image can be represented and reconstructed by sparse recovery (SR) approaches. However, the existing SR algorithms, which are used for ISAR imaging, have suffered from high computational cost and poor imaging quality under a low signal to noise ratio (SNR) condition. This paper proposes a fast decoupled ISAR imaging method by exploiting the inherent structural sparse information of the targets. Firstly, the ISAR imaging problem is decoupled into two sub-problems. One is range direction imaging and the other is azimuth direction focusing. Secondly, an efficient two-stage SR method is proposed to obtain higher resolution range profiles by using jointly sparse information. Finally, the residual linear Bregman iteration via fast Fourier transforms (RLBI-FFT) is proposed to perform the azimuth focusing on low SNR efficiently. Theoretical analysis and simulation results show that the proposed method has better performence to efficiently implement higher-resolution ISAR imaging under the low SNR condition.展开更多
基金Supported by the National Key R&D Program of China(Grant No.2023YFA1009200)the National Natural Science Foundation of China(Grant Nos.12271079+1 种基金12494552)the Fundamental Research Funds for the Central Universities of China(Grant No.DUT24LAB127)。
文摘In this paper,we focus on the recovery of piecewise sparse signals containing both fast-decaying and slow-decaying nonzero entries.In order to improve the performance of classic Orthogonal Matching Pursuit(OMP)and Generalized Orthogonal Matching Pursuit(GOMP)algorithms for solving this problem,we propose the Piecewise Generalized Orthogonal Matching Pursuit(PGOMP)algorithm,by considering the mixed-decaying sparse signals as piecewise sparse signals with two components containing nonzero entries with different decay factors.The algorithm incorporates piecewise selection and deletion to retain the most significant entries according to the sparsity of each component.We provide a theoretical analysis based on the mutual coherence of the measurement matrix and the decay factors of the nonzero entries,establishing a sufficient condition for the PGOMP algorithm to select at least two correct indices in each iteration.Numerical simulations and an image decomposition experiment demonstrate that the proposed algorithm significantly improves the support recovery probability by effectively matching piecewise sparsity with decay factors.
基金supported by the Development of airborne gravity gradiometer(No.2017YFC0601601)open subject of Key Laboratory of Petroleum Resources Research,Institute of Geology and Geophysics,Chinese Academy of Sciences(No.KLOR2018-8)
文摘This research proposes a novel three-dimensional gravity inversion based on sparse recovery in compress sensing. Zero norm is selected as the objective function, which is then iteratively solved by the approximate zero norm solution. The inversion approach mainly employs forward modeling; a depth weight function is introduced into the objective function of the zero norms. Sparse inversion results are obtained by the corresponding optimal mathematical method. To achieve the practical geophysical and geological significance of the results, penalty function is applied to constrain the density values. Results obtained by proposed provide clear boundary depth and density contrast distribution information. The method's accuracy, validity, and reliability are verified by comparing its results with those of synthetic models. To further explain its reliability, a practical gravity data is obtained for a region in Texas, USA is applied. Inversion results for this region are compared with those of previous studies, including a research of logging data in the same area. The depth of salt dome obtained by the inversion method is 4.2 km, which is in good agreement with the 4.4 km value from the logging data. From this, the practicality of the inversion method is also validated.
基金Project supported by the National Natural Science Foundation of China(No.61603322)the Research Foundation of Education Bureau of Hunan Province of China(No.16C1542)
文摘Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.
基金supported by the National Natural Science Foundation of China(61501176)University Nursing Program for Young Scholars with Creative Talents in Heilongjiang Province(UNPYSCT-2016017)
文摘The traditional super-resolution direction finding methods based on sparse recovery need to divide the estimation space into several discrete angle grids, which will bring the final result some error. To this problem, a novel method for wideband signals by sparse recovery in the frequency domain is proposed. The optimization functions are found and solved by the received data at every frequency, on this basis, the sparse support set is obtained, then the direction of arrival (DOA) is acquired by integrating the information of all frequency bins, and the initial signal can also be recovered. This method avoids the error caused by sparse recovery methods based on grid division, and the degree of freedom is also expanded by array transformation, especially it has a preferable performance under the circumstances of a small number of snapshots and a low signal to noise ratio (SNR).
基金Supported by the Innovation Foundation for Outstanding Postgraduates in the Electronic Engineering Institute of PLA (No. 2009YB005)
文摘A novel Direction-Of-Arrival (DOA) estimation method is proposed in the presence of mutual coupling using the joint sparse recovery. In the proposed method, the eigenvector corresponding to the maximum eigenvalue of covariance matrix of array measurement is viewed as the signal to be represented. By exploiting the geometrical property in steering vectors and the symmetric Toeplitz structure of Mutual Coupling Matrix (MCM), the redundant dictionaries containing the DOA information are constructed. Consequently, the optimization model based on joint sparse recovery is built and then is solved through Second Order Cone Program (SOCP) and Interior Point Method (IPM). The DOA estimates are gotten according to the positions of nonzeros elements. At last, computer simulations demonstrate the excellent performance of the proposed method.
基金Supported by the National Natural Science Foundation of China (Grant Nos.1187113711572081)the Fundamental Research Funds for the Central Universities of China (Grant No.QYWKC2018007)。
文摘Sparse recovery(or sparse representation) is a widely studied issue in the fields of signal processing, image processing, computer vision, machine learning and so on, since signals such as videos and images, can be sparsely represented under some frames. Most of fast algorithms at present are based on solving l0or l1minimization problems and they are efficient in sparse recovery. However, the theoretically sufficient conditions on the sparsity of the signal for l0or l1minimization problems and algorithms are too strict. In some applications, there are signals with structures, i.e., the nonzero entries have some certain distribution. In this paper,we consider the uniqueness and feasible conditions for piecewise sparse recovery. Piecewise sparsity means that the sparse signal x is a union of several sparse sub-signals xi(i=1, 2,..., N),i.e., x=(x_(1)^(T), x_(2)^(T),..., x_(N)^(T))T, corresponding to the measurement matrix A which is composed of union of bases A=[A_(1), A_(2),..., A_(N)]. We introduce the mutual coherence for the sub-matrices Ai(i = 1, 2,..., N) by considering the block structure of A corresponding to piecewise sparse signal x, to study the new upper bounds of ‖x‖0(number of nonzero entries of signal) recovered by both l0and l1optimizations. The structured information of measurement matrix A is exploited to improve the sufficient conditions for successfully piecewise sparse recovery and also improve the reliability of l0and l1optimization models on recovering global sparse vectors.
基金supported by the National Natural Science Foundation of China(No.61271014)the Specialized Research Fund for the Doctoral Program of Higher Education(No.20124301110003)the Graduated Students Innovation Fund of Hunan Province(No.CX2012B238)
文摘The method of recovering a low-rank matrix with an unknown fraction whose entries are arbitrarily corrupted is known as the robust principal component analysis （RPCA）. This RPCA problem, under some conditions, can be exactly solved via convex optimization by minimizing a combination of the nuclear norm and the 11 norm. In this paper, an algorithm based on the Douglas-Rachford splitting method is proposed for solving the RPCA problem. First, the convex optimization problem is solved by canceling the constraint of the variables, and ~hen the proximity operators of the objective function are computed alternately. The new algorithm can exactly recover the low-rank and sparse components simultaneously, and it is proved to be convergent. Numerical simulations demonstrate the practical utility of the proposed algorithm.
基金Supported by the National Natural Science Foundation of China(61571368)the Ministerial Level Advanced Research Foundation(950303HK,C9149C0511)
文摘In order to improve the performance of linear time-varying（LTV）channel estimation,based on the sparsity of channel taps in time domain,a sparse recovery method of LTV channel in orthogonal frequency division multiplexing（OFDM）system is proposed.Firstly,based on the compressive sensing theory,the average of the channel taps over one symbol duration in the LTV channel model is estimated.Secondly,in order to deal with the inter-carrier interference（ICI）,the group-pilot design criterion is used based on the minimization of mutual coherence of the measurement.Finally,an efficient pilot pattern optimization algorithm is proposed by a dual layer loops iteration.The simulation results show that the new method uses less pilots,has a smaller bit error ratio（BER）,and greater ability to deal with Doppler frequency shift than the traditional method does.
基金the National Natural Science Foundation of China(No.70901018)
文摘Sparse signal recovery is a topic of considerable interest,and the literature in this field is already quite immense.Many problems that arise in sparse signal recovery can be generalized as a convex programming with linear conic constraints.In this paper,we present a new proximal point algorithm(PPA) termed as relaxed-PPA(RPPA) contraction method,for solving this common convex programming.More precisely,we first reformulate the convex programming into an equivalent variational inequality(VI),and then efficiently explore its inner structure.In each step,our method relaxes the VI-subproblem to a tractable one,which can be solved much more efficiently than the original VI.Under mild conditions,the convergence of the proposed method is proved.Experiments with l1 analysis show that RPPA is a computationally efficient algorithm and compares favorably with the recently proposed state-of-the-art algorithms.
基金supported by the National Natural Science Foundation of China(61907014,11871248,11701410,61901160)Youth Science Foundation of Henan Normal University(2019QK03).
文摘A greedy algorithm used for the recovery of sparse signals,multiple orthogonal least squares(MOLS)have recently attracted quite a big of attention.In this paper,we consider the number of iterations required for the MOLS algorithm for recovery of a K-sparse signal x∈R^(n).We show that MOLS provides stable reconstruction of all K-sparse signals x from y=Ax+w in|6K/ M|iterations when the matrix A satisfies the restricted isometry property(RIP)with isometry constantδ_(7K)≤0.094.Compared with the existing results,our sufficient condition is not related to the sparsity level K.
基金Supported by the National Natural Science Foundation of China(61501385)Science and Technology Planning Project of Sichuan Province,China(2016JY0242,2016GZ0210)Foundation of Southwest University of Science and Technology(15kftk02,15kffk01)
文摘Pulse signal recovery is to extract useful amplitude and time information from the pulse signal contaminated by noise. It is a great challenge to precisely recover the pulse signal in loud background noise. The conventional approaches,which are mostly based on the distribution of the pulse energy spectrum,do not well determine the locations and shapes of the pulses. In this paper,we propose a time domain method to reconstruct pulse signals. In the proposed approach,a sparse representation model is established to deal with the issue of the pulse signal recovery under noise conditions. The corresponding problem based on the sparse optimization model is solved by a matching pursuit algorithm. Simulations and experiments validate the effectiveness of the proposed approach on pulse signal recovery.
文摘Separation and recovery of 152+154Eu and 90Sr from radioactive waste using tracer concentration from active material from waste tank in the ET-RR1 Egypt via hollow fiber supported liquid membrane (HFSLM) were achieved. The Polypropylene was used as supporter to carrier 0.5M Cyanex301/kerosene (bis(2,4,4-trimethylpentyl)dithiophosphinic acid and 0.1MEDTA as stripping of 152+154Eu and 90Sr ions from nitrate medium at pH ~3.6. The separation factor was found to be ~4 for 152+154Eu over 90Sr. The aqueous feed of mass transfer coefficient (ki) and the organic mass transfer coefficient (km) were calculated to be (1.52 and 4.5) × 10﹣2cm/s, respectively. In addition, the mass transfer modeling was performed and the validity of the developed model from experimental data was found to join in well with the theoretical values when the Cyanex301 concentration is higher than 1% (v/v). The number of cycles evaluated for complete separation of 152+154Eu and 90Sr is five cycles.
文摘We consider the problem of constructing one sparse signal from a few measurements. This problem has been extensively addressed in the literature, providing many sub-optimal methods that assure convergence to a locally optimal solution under specific conditions. There are a few measurements associated with every signal, where the size of each measurement vector is less than the sparse signal＇s size. All of the sparse signals have the same unknown support. We generalize an existing algorithm for the recovery of one sparse signal from a single measurement to this problem and analyze its performances through simulations. We also compare the construction performance with other existing algorithms. Finally, the proposed method also shows advantages over the OMP （Orthogonal Matching Pursuit） algorithm in terms of the computational complexity.
文摘基于稀疏恢复的空时自适应算法(Sparse Recovery Space Time Adaptive Processing,SR-STAP)能有效改善机载雷达在复杂环境下对杂波的抑制能力,通常是将空时平面均匀离散为若干个网格来构造字典。然而,真实的杂波点往往不能落在预先离散的网格点上,此时会出现离网效应,导致SR-STAP的性能降低。本文针对此问题,提出了一种基于知识辅助的字典校正方法。首先利用载机平台参数等先验知识均匀离散空间频率,然后计算和修正多普勒频率,并根据先验知识修正空间频率,最后利用修正后的空间频率和多普勒频率对应的空时导向矢量来构造超完备稀疏字典。仿真结果表明,与传统字典构造算法相比,该字典校正方法有效克服了离网效应,改善了STAP的性能。
基金supported by the National Natural Science Foundation of China(61671469)
文摘Inverse synthetic aperture radar (ISAR) image can be represented and reconstructed by sparse recovery (SR) approaches. However, the existing SR algorithms, which are used for ISAR imaging, have suffered from high computational cost and poor imaging quality under a low signal to noise ratio (SNR) condition. This paper proposes a fast decoupled ISAR imaging method by exploiting the inherent structural sparse information of the targets. Firstly, the ISAR imaging problem is decoupled into two sub-problems. One is range direction imaging and the other is azimuth direction focusing. Secondly, an efficient two-stage SR method is proposed to obtain higher resolution range profiles by using jointly sparse information. Finally, the residual linear Bregman iteration via fast Fourier transforms (RLBI-FFT) is proposed to perform the azimuth focusing on low SNR efficiently. Theoretical analysis and simulation results show that the proposed method has better performence to efficiently implement higher-resolution ISAR imaging under the low SNR condition.
