In an underdetermined system,compressive sensing can be used to recover the support vector.Greedy algorithms will recover the support vector indices in an iterative manner.Generalized Orthogonal Matching Pursuit(GOMP)...In an underdetermined system,compressive sensing can be used to recover the support vector.Greedy algorithms will recover the support vector indices in an iterative manner.Generalized Orthogonal Matching Pursuit(GOMP)is the generalized form of the Orthogonal Matching Pursuit(OMP)algorithm where a number of indices selected per iteration will be greater than or equal to 1.To recover the support vector of unknown signal‘x’from the compressed measurements,the restricted isometric property should be satisfied as a sufficient condition.Finding the restricted isometric constant is a non-deterministic polynomial-time hardness problem due to that the coherence of the sensing matrix can be used to derive the sufficient condition for support recovery.In this paper a sufficient condition based on the coherence parameter to recover the support vector indices of an unknown sparse signal‘x’using GOMP has been derived.The derived sufficient condition will recover support vectors of P-sparse signal within‘P’iterations.The recovery guarantee for GOMP is less restrictive,and applies to OMP when the number of selection elements equals one.Simulation shows the superior performance of the GOMP algorithm compared with other greedy algorithms.展开更多
Compressive sensing theory mainly includes the sparsely of signal processing,the structure of the measurement matrix and reconstruction algorithm.Reconstruction algorithm is the core content of CS theory,that is,throu...Compressive sensing theory mainly includes the sparsely of signal processing,the structure of the measurement matrix and reconstruction algorithm.Reconstruction algorithm is the core content of CS theory,that is,through the low dimensional sparse signal recovers the original signal accurately.This thesis based on the theory of CS to study further on seismic data reconstruction algorithm.We select orthogonal matching pursuit algorithm as a base reconstruction algorithm.Then do the specific research for the implementation principle,the structure of the algorithm of AOMP and make the signal simulation at the same time.In view of the OMP algorithm reconstruction speed is slow and the problems need to be a given number of iterations,which developed an improved scheme.We combine the optimized OMP algorithm of constraint the optimal matching of item selection strategy,the backwards gradient projection ideas of adaptive variance step gradient projection method and the original algorithm to improve it.Simulation experiments show that improved OMP algorithm is superior to traditional OMP algorithm of improvement in the reconstruction time and effect under the same condition.This paper introduces CS and most mature compressive sensing algorithm at present orthogonal matching pursuit algorithm.Through the program design realize basic orthogonal matching pursuit algorithms,and design realize basic orthogonal matching pursuit algorithm of one-dimensional,two-dimensional signal processing simulation.展开更多
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.展开更多
Orthogonal matching pursuit(OMP)algorithm is a classical greedy algorithm widely used in compressed sensing.In this paper,by exploiting the Wielandt inequality and some properties of orthogonal projection matrix,we ob...Orthogonal matching pursuit(OMP)algorithm is a classical greedy algorithm widely used in compressed sensing.In this paper,by exploiting the Wielandt inequality and some properties of orthogonal projection matrix,we obtained a new number of iterations required for the OMP algorithm to perform exact recovery of sparse signals,which improves significantly upon the latest results as we know.展开更多
This paper aims to investigate sufficient conditions for the recovery of sparse signals via the orthogonal matching pursuit (OMP) algorithm. In the noiseless case, we present a novel sufficient condition for the exa...This paper aims to investigate sufficient conditions for the recovery of sparse signals via the orthogonal matching pursuit (OMP) algorithm. In the noiseless case, we present a novel sufficient condition for the exact recovery of all k-sparse signals by the OMP algorithm, and demonstrate that this condition is sharp. In the noisy case, a sufficient condition for recovering the support of k-sparse signal is also presented. Generally, the computation for the restricted isometry constant (RIC) in these sufficient conditions is typically difficult, therefore we provide a new condition which is not only computable but also sufficient for the exact recovery of all k-sparse signals.展开更多
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.展开更多
At present,the traditional channel estimation algorithms have the disadvantages of over-reliance on initial conditions and high complexity.The bacterial foraging optimization(BFO)-based algorithm has been applied in w...At present,the traditional channel estimation algorithms have the disadvantages of over-reliance on initial conditions and high complexity.The bacterial foraging optimization(BFO)-based algorithm has been applied in wireless communication and signal processing because of its simple operation and strong self-organization ability.But the BFO-based algorithm is easy to fall into local optimum.Therefore,this paper proposes the quantum bacterial foraging optimization(QBFO)-binary orthogonal matching pursuit(BOMP)channel estimation algorithm to the problem of local optimization.Firstly,the binary matrix is constructed according to whether atoms are selected or not.And the support set of the sparse signal is recovered according to the BOMP-based algorithm.Then,the QBFO-based algorithm is used to obtain the estimated channel matrix.The optimization function of the least squares method is taken as the fitness function.Based on the communication between the quantum bacteria and the fitness function value,chemotaxis,reproduction and dispersion operations are carried out to update the bacteria position.Simulation results showthat compared with other algorithms,the estimationmechanism based onQBFOBOMP algorithm can effectively improve the channel estimation performance of millimeter wave(mmWave)massive multiple input multiple output(MIMO)systems.Meanwhile,the analysis of the time ratio shows that the quantization of the bacteria does not significantly increase the complexity.展开更多
The conventional two dimensional(2D)inverse synthetic aperture radar(ISAR)imaging fails to provide the targets'three dimensional(3D)information.In this paper,a 3D ISAR imaging method for the space target is propos...The conventional two dimensional(2D)inverse synthetic aperture radar(ISAR)imaging fails to provide the targets'three dimensional(3D)information.In this paper,a 3D ISAR imaging method for the space target is proposed based on mutliorbit observation data and an improved orthogonal matching pursuit(OMP)algorithm.Firstly,the 3D scattered field data is converted into a set of 2D matrix by stacking slices of the 3D data along the elevation direction dimension.Then,an improved OMP algorithm is applied to recover the space target's amplitude information via the 2D matrix data.Finally,scattering centers can be reconstructed with specific three dimensional locations.Numerical simulations are provided to demonstrate the effectiveness and superiority of the proposed 3D imaging method.展开更多
Text classification is an essential task of natural language processing. Preprocessing, which determines the representation of text features, is one of the key steps of text classification architecture. It proposed a ...Text classification is an essential task of natural language processing. Preprocessing, which determines the representation of text features, is one of the key steps of text classification architecture. It proposed a novel efficient and effective preprocessing algorithm with three methods for text classification combining the Orthogonal Matching Pursuit algorithm to perform the classification. The main idea of the novel preprocessing strategy is that it combined stopword removal and/or regular filtering with tokenization and lowercase conversion, which can effectively reduce the feature dimension and improve the text feature matrix quality. Simulation tests on the 20 newsgroups dataset show that compared with the existing state-of-the-art method, the new method reduces the number of features by 19.85%, 34.35%, 26.25% and 38.67%, improves accuracy by 7.36%, 8.8%, 5.71% and 7.73%, and increases the speed of text classification by 17.38%, 25.64%, 23.76% and 33.38% on the four data, respectively.展开更多
Sparse representation has recently been proved to be a powerful tool in image processing and object recognition.This paper proposes a novel small target detection algorithm based on this technique.By modelling a small...Sparse representation has recently been proved to be a powerful tool in image processing and object recognition.This paper proposes a novel small target detection algorithm based on this technique.By modelling a small target as a linear combination of certain target samples and then solving a sparse 0-minimization problem,the proposed apporach successfully improves and optimizes the small target representation with innovation.Furthermore,the sparsity concentration index(SCI) is creatively employed to evaluate the coefficients of each block representation and simpfy target identification.In the detection frame,target samples are firstly generated to constitute an over-complete dictionary matrix using Gaussian intensity model(GIM),and then sparse model solvers are applied to finding sparse representation for each sub-image block.Finally,SCI lexicographical evalution of the entire image incorparates with a simple threshold locate target position.The effectiveness and robustness of the proposed algorithm are demonstrated by the exprimental results.展开更多
This paper analyzes the performance of the orthogonal matching pursuit (OMP) algorithm in recovering sparse signals from noisy measurement. Considering the fact that some matrices satisfy some restricted isometry pr...This paper analyzes the performance of the orthogonal matching pursuit (OMP) algorithm in recovering sparse signals from noisy measurement. Considering the fact that some matrices satisfy some restricted isometry properties (RIPs) but not the coherence condition, a superior RIP-based condition is proposed, which means that if the measurement matrix satisfies δk+1 〈 1/(2 + √k) and the minimum component signal-to-noise ratio (MCSNR) is bounded, the OMP algorithm can exactly identify the support of the original sparse signal within k iterations. Finally, the theoretical results are verified by numerical simulations con- cerning different values of MCSNR and noise levels.展开更多
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.展开更多
Introducing frequency agility into a distributed multipleinput multiple-output(MIMO)radar can significantly enhance its anti-jamming ability.However,it would cause the sidelobe pedestal problem in multi-target paramet...Introducing frequency agility into a distributed multipleinput multiple-output(MIMO)radar can significantly enhance its anti-jamming ability.However,it would cause the sidelobe pedestal problem in multi-target parameter estimation.Sparse recovery is an effective way to address this problem,but it cannot be directly utilized for multi-target parameter estimation in frequency-agile distributed MIMO radars due to spatial diversity.In this paper,we propose an algorithm for multi-target parameter estimation according to the signal model of frequency-agile distributed MIMO radars,by modifying the orthogonal matching pursuit(OMP)algorithm.The effectiveness of the proposed method is then verified by simulation results.展开更多
An Adaptive Measurement Scheme (AMS) is investigated with Compressed Sensing (CS) theory in Cognitive Wireless Sensor Network (C-WSN). Local sensing information is collected via energy detection with Analog-to-Informa...An Adaptive Measurement Scheme (AMS) is investigated with Compressed Sensing (CS) theory in Cognitive Wireless Sensor Network (C-WSN). Local sensing information is collected via energy detection with Analog-to-Information Converter (AIC) at massive cognitive sensors, and sparse representation is considered with the exploration of spatial temporal correlation structure of detected signals. Adaptive measurement matrix is designed in AMS, which is based on maximum energy subset selection. Energy subset is calculated with sparse transformation of sensing information, and maximum energy subset is selected as the row vector of adaptive measurement matrix. In addition, the measurement matrix is constructed by orthogonalization of those selected row vectors, which also satisfies the Restricted Isometry Property (RIP) in CS theory. Orthogonal Matching Pursuit (OMP) reconstruction algorithm is implemented at sink node to recover original information. Simulation results are performed with the comparison of Random Measurement Scheme (RMS). It is revealed that, signal reconstruction effect based on AMS is superior to conventional RMS Gaussian measurement. Moreover, AMS has better detection performance than RMS at lower compression rate region, and it is suitable for large-scale C-WSN wideband spectrum sensing.展开更多
The paper proposes a new method of multi-band signal reconstruction based on Orthogonal Matching Pursuit(OMP),which aims to develop a robust Ecological Sounds Recognition(ESR)system.Firstly,the OMP is employed to spar...The paper proposes a new method of multi-band signal reconstruction based on Orthogonal Matching Pursuit(OMP),which aims to develop a robust Ecological Sounds Recognition(ESR)system.Firstly,the OMP is employed to sparsely decompose the original signal,thus the high correlation components are retained to reconstruct in the first stage.Then,according to the frequency distribution of both foreground sound and background noise,the signal can be compensated by the residual components in the second stage.Via the two-stage reconstruction,high non-stationary noises are effectively reduced,and the reconstruction precision of foreground sound is improved.At recognition stage,we employ deep belief networks to model the composite feature sets extracted from reconstructed signal.The experimental results show that the proposed approach achieved superior recognition performance on 60 classes of ecological sounds in different environments under different Signal-to-Noise Ratio(SNR),compared with the existing method.展开更多
In the uplink grant-free non-orthogonal multiple access(NOMA)scenario,since the active user at the sender has a structured sparsity transmission characteristic,the compressive sensing recovery algorithm is initially a...In the uplink grant-free non-orthogonal multiple access(NOMA)scenario,since the active user at the sender has a structured sparsity transmission characteristic,the compressive sensing recovery algorithm is initially applied to the joint detection of the active user and the transmitted data.However,the existing compressed sensing recovery algorithms with unknown sparsity often require noise power or signal-to-noise ratio(SNR)as the priori conditions,which greatly reduces the algorithm adaptability in multi-user detection.Therefore,an algorithm based on cross validation aided structured sparsity adaptive orthogonal matching pursuit(CVA-SSAOMP)is proposed to realize multi-user detection in dynamic change communication scenario of channel state information(CSI).The proposed algorithm transforms the structured sparsity model into a block sparse model,and without the priori conditions above,the cross validation method in the field of statistics and machine learning is used to adaptively estimate the sparsity of active user through the residual update of cross validation.The simulation results show that,compared with the traditional orthogonal matching pursuit(OMP)algorithm,subspace pursuit(SP)algorithm and cross validation aided block sparsity adaptive subspace pursuit(CVA-BSASP)algorithm,the proposed algorithm can effectively improve the accurate estimation of the sparsity of active user and the performance of system bit error ratio(BER),and has the advantage of low-complexity.展开更多
In this paper, we propose a face recognition approach-Structed Sparse Representation-based classification when the measurement of the test sample is less than the number training samples of each subject. When this con...In this paper, we propose a face recognition approach-Structed Sparse Representation-based classification when the measurement of the test sample is less than the number training samples of each subject. When this condition is not satisfied, we exploit Nearest Subspaee approach to classify the test sample. In order to adapt all the eases, we combine the two approaches to an adaptive classification method-Adaptive approach. The adaptive approach yields greater recognition accuracy than the SRC approach and CRC_RLS approach with low ~ample rate on the Extend Yale B dataset. And it is more efficient than other two approaches.展开更多
Based on mode acoustic emission theory,the paper analyses the acoustic emission analog signal of thin steel plate using matching pursuit,then obtains the characteristics interpretation of the different frequency signa...Based on mode acoustic emission theory,the paper analyses the acoustic emission analog signal of thin steel plate using matching pursuit,then obtains the characteristics interpretation of the different frequency signal energy concentration degree; Combined with four-point arc positioning method,the papers researches the damage localization of the plate-like structure. Simulation experiment shows that this method can accurately detect and locate the damage. This can provide data support for further imaging research based on time reverse theory.展开更多
Sparse decomposition is a new theory in signal processing,with the advantage in that the base(dictionary)used in this theory is over-complete,and can reflect the nature of a signal.Thus,the sparse decomposition of sig...Sparse decomposition is a new theory in signal processing,with the advantage in that the base(dictionary)used in this theory is over-complete,and can reflect the nature of a signal.Thus,the sparse decomposition of signal can obtain sparse representation,which is very important in data compression.The algorithm of compression based on sparse decomposition is investigated.By training on and learning electrocardiogram(ECG)data in the MIT-BIH Arrhythmia Database,we constructed an over-complete dictionary of ECGs.Since the atoms in this dictionary are in accord with the character of ECGs,it is possible that an extensive ECG datum is reconstructed by a few nonzero coefficients and atoms.The proposed compression algorithm can adjust compression ratio according to practical request,and the distortion is low(when the compression ratio is 20∶1,the standard error is 5.11%).The experiments prove the feasibility of the proposed compression algorithm.展开更多
In recent years,there has been a growing usage of sparse representations in signal processing.This paper revisits theK-SVD,an algorithm for designing overcomplete dictionaries for sparse and redundant representations....In recent years,there has been a growing usage of sparse representations in signal processing.This paper revisits theK-SVD,an algorithm for designing overcomplete dictionaries for sparse and redundant representations.We present a newapproach to solve dictionary learning models by combining the alternating direction method of multipliers and the orthogonal matching pursuit.The experimental results show that our approach can reliably obtain better learned dictionary elements and outperform other algorithms.展开更多
文摘In an underdetermined system,compressive sensing can be used to recover the support vector.Greedy algorithms will recover the support vector indices in an iterative manner.Generalized Orthogonal Matching Pursuit(GOMP)is the generalized form of the Orthogonal Matching Pursuit(OMP)algorithm where a number of indices selected per iteration will be greater than or equal to 1.To recover the support vector of unknown signal‘x’from the compressed measurements,the restricted isometric property should be satisfied as a sufficient condition.Finding the restricted isometric constant is a non-deterministic polynomial-time hardness problem due to that the coherence of the sensing matrix can be used to derive the sufficient condition for support recovery.In this paper a sufficient condition based on the coherence parameter to recover the support vector indices of an unknown sparse signal‘x’using GOMP has been derived.The derived sufficient condition will recover support vectors of P-sparse signal within‘P’iterations.The recovery guarantee for GOMP is less restrictive,and applies to OMP when the number of selection elements equals one.Simulation shows the superior performance of the GOMP algorithm compared with other greedy algorithms.
基金This study was supported by the Yangtze University Innovation and Entrepreneurship Course Construction Project of“Mobile Internet Entrepreneurship”.
文摘Compressive sensing theory mainly includes the sparsely of signal processing,the structure of the measurement matrix and reconstruction algorithm.Reconstruction algorithm is the core content of CS theory,that is,through the low dimensional sparse signal recovers the original signal accurately.This thesis based on the theory of CS to study further on seismic data reconstruction algorithm.We select orthogonal matching pursuit algorithm as a base reconstruction algorithm.Then do the specific research for the implementation principle,the structure of the algorithm of AOMP and make the signal simulation at the same time.In view of the OMP algorithm reconstruction speed is slow and the problems need to be a given number of iterations,which developed an improved scheme.We combine the optimized OMP algorithm of constraint the optimal matching of item selection strategy,the backwards gradient projection ideas of adaptive variance step gradient projection method and the original algorithm to improve it.Simulation experiments show that improved OMP algorithm is superior to traditional OMP algorithm of improvement in the reconstruction time and effect under the same condition.This paper introduces CS and most mature compressive sensing algorithm at present orthogonal matching pursuit algorithm.Through the program design realize basic orthogonal matching pursuit algorithms,and design realize basic orthogonal matching pursuit algorithm of one-dimensional,two-dimensional signal processing simulation.
基金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.
基金support from the National Natural Science Foundation of China No.11971204Natural Science Foundation of Jiangsu Province of China No.BK20200108the Zhongwu Youth Innovative Talent Program of Jiangsu University of Technology.
文摘Orthogonal matching pursuit(OMP)algorithm is a classical greedy algorithm widely used in compressed sensing.In this paper,by exploiting the Wielandt inequality and some properties of orthogonal projection matrix,we obtained a new number of iterations required for the OMP algorithm to perform exact recovery of sparse signals,which improves significantly upon the latest results as we know.
基金The authors are very grateful to the anonymous referees for their valuable comments and suggestions. We want to thank Mr. Liang Chen at Hunan University for many useful comments. This work was supported by the National Natural Science Foundation of China under Grant 11271117.
文摘This paper aims to investigate sufficient conditions for the recovery of sparse signals via the orthogonal matching pursuit (OMP) algorithm. In the noiseless case, we present a novel sufficient condition for the exact recovery of all k-sparse signals by the OMP algorithm, and demonstrate that this condition is sharp. In the noisy case, a sufficient condition for recovering the support of k-sparse signal is also presented. Generally, the computation for the restricted isometry constant (RIC) in these sufficient conditions is typically difficult, therefore we provide a new condition which is not only computable but also sufficient for the exact recovery of all k-sparse signals.
基金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.
基金supported by the National Natural Science Foundation of China(Nos.61861015,62061013 and 61961013)Key Research and Development Program of Hainan Province(No.ZDYF2019011)+3 种基金National Key Research and Development Program of China(No.2019CXTD400)Young Elite Scientists Sponsorship Program by CAST(No.2018QNRC001)Scientific Research Setup Fund of Hainan University(No.KYQD(ZR)1731)the Natural Science Foundation High-Level Talent Project of Hainan Province(No.622RC619).
文摘At present,the traditional channel estimation algorithms have the disadvantages of over-reliance on initial conditions and high complexity.The bacterial foraging optimization(BFO)-based algorithm has been applied in wireless communication and signal processing because of its simple operation and strong self-organization ability.But the BFO-based algorithm is easy to fall into local optimum.Therefore,this paper proposes the quantum bacterial foraging optimization(QBFO)-binary orthogonal matching pursuit(BOMP)channel estimation algorithm to the problem of local optimization.Firstly,the binary matrix is constructed according to whether atoms are selected or not.And the support set of the sparse signal is recovered according to the BOMP-based algorithm.Then,the QBFO-based algorithm is used to obtain the estimated channel matrix.The optimization function of the least squares method is taken as the fitness function.Based on the communication between the quantum bacteria and the fitness function value,chemotaxis,reproduction and dispersion operations are carried out to update the bacteria position.Simulation results showthat compared with other algorithms,the estimationmechanism based onQBFOBOMP algorithm can effectively improve the channel estimation performance of millimeter wave(mmWave)massive multiple input multiple output(MIMO)systems.Meanwhile,the analysis of the time ratio shows that the quantization of the bacteria does not significantly increase the complexity.
文摘The conventional two dimensional(2D)inverse synthetic aperture radar(ISAR)imaging fails to provide the targets'three dimensional(3D)information.In this paper,a 3D ISAR imaging method for the space target is proposed based on mutliorbit observation data and an improved orthogonal matching pursuit(OMP)algorithm.Firstly,the 3D scattered field data is converted into a set of 2D matrix by stacking slices of the 3D data along the elevation direction dimension.Then,an improved OMP algorithm is applied to recover the space target's amplitude information via the 2D matrix data.Finally,scattering centers can be reconstructed with specific three dimensional locations.Numerical simulations are provided to demonstrate the effectiveness and superiority of the proposed 3D imaging method.
文摘Text classification is an essential task of natural language processing. Preprocessing, which determines the representation of text features, is one of the key steps of text classification architecture. It proposed a novel efficient and effective preprocessing algorithm with three methods for text classification combining the Orthogonal Matching Pursuit algorithm to perform the classification. The main idea of the novel preprocessing strategy is that it combined stopword removal and/or regular filtering with tokenization and lowercase conversion, which can effectively reduce the feature dimension and improve the text feature matrix quality. Simulation tests on the 20 newsgroups dataset show that compared with the existing state-of-the-art method, the new method reduces the number of features by 19.85%, 34.35%, 26.25% and 38.67%, improves accuracy by 7.36%, 8.8%, 5.71% and 7.73%, and increases the speed of text classification by 17.38%, 25.64%, 23.76% and 33.38% on the four data, respectively.
基金supported by the Inter-governmental Science and Technology Cooperation Project (2009DFA12870)
文摘Sparse representation has recently been proved to be a powerful tool in image processing and object recognition.This paper proposes a novel small target detection algorithm based on this technique.By modelling a small target as a linear combination of certain target samples and then solving a sparse 0-minimization problem,the proposed apporach successfully improves and optimizes the small target representation with innovation.Furthermore,the sparsity concentration index(SCI) is creatively employed to evaluate the coefficients of each block representation and simpfy target identification.In the detection frame,target samples are firstly generated to constitute an over-complete dictionary matrix using Gaussian intensity model(GIM),and then sparse model solvers are applied to finding sparse representation for each sub-image block.Finally,SCI lexicographical evalution of the entire image incorparates with a simple threshold locate target position.The effectiveness and robustness of the proposed algorithm are demonstrated by the exprimental results.
基金supported by the National Natural Science Foundation of China(6117401661171197)
文摘This paper analyzes the performance of the orthogonal matching pursuit (OMP) algorithm in recovering sparse signals from noisy measurement. Considering the fact that some matrices satisfy some restricted isometry properties (RIPs) but not the coherence condition, a superior RIP-based condition is proposed, which means that if the measurement matrix satisfies δk+1 〈 1/(2 + √k) and the minimum component signal-to-noise ratio (MCSNR) is bounded, the OMP algorithm can exactly identify the support of the original sparse signal within k iterations. Finally, the theoretical results are verified by numerical simulations con- cerning different values of MCSNR and noise levels.
基金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.
文摘Introducing frequency agility into a distributed multipleinput multiple-output(MIMO)radar can significantly enhance its anti-jamming ability.However,it would cause the sidelobe pedestal problem in multi-target parameter estimation.Sparse recovery is an effective way to address this problem,but it cannot be directly utilized for multi-target parameter estimation in frequency-agile distributed MIMO radars due to spatial diversity.In this paper,we propose an algorithm for multi-target parameter estimation according to the signal model of frequency-agile distributed MIMO radars,by modifying the orthogonal matching pursuit(OMP)algorithm.The effectiveness of the proposed method is then verified by simulation results.
基金Supported by the National Natural Science Foundation of China (No. 61102066, 60972058)the China Postdoctoral Science Foundation (No. 2012M511365)the Scientific Research Project of Zhejiang Provincial Education Department (No. Y201119890)
文摘An Adaptive Measurement Scheme (AMS) is investigated with Compressed Sensing (CS) theory in Cognitive Wireless Sensor Network (C-WSN). Local sensing information is collected via energy detection with Analog-to-Information Converter (AIC) at massive cognitive sensors, and sparse representation is considered with the exploration of spatial temporal correlation structure of detected signals. Adaptive measurement matrix is designed in AMS, which is based on maximum energy subset selection. Energy subset is calculated with sparse transformation of sensing information, and maximum energy subset is selected as the row vector of adaptive measurement matrix. In addition, the measurement matrix is constructed by orthogonalization of those selected row vectors, which also satisfies the Restricted Isometry Property (RIP) in CS theory. Orthogonal Matching Pursuit (OMP) reconstruction algorithm is implemented at sink node to recover original information. Simulation results are performed with the comparison of Random Measurement Scheme (RMS). It is revealed that, signal reconstruction effect based on AMS is superior to conventional RMS Gaussian measurement. Moreover, AMS has better detection performance than RMS at lower compression rate region, and it is suitable for large-scale C-WSN wideband spectrum sensing.
基金Supported by the National Natural Science Foundation of China(No.61075022)
文摘The paper proposes a new method of multi-band signal reconstruction based on Orthogonal Matching Pursuit(OMP),which aims to develop a robust Ecological Sounds Recognition(ESR)system.Firstly,the OMP is employed to sparsely decompose the original signal,thus the high correlation components are retained to reconstruct in the first stage.Then,according to the frequency distribution of both foreground sound and background noise,the signal can be compensated by the residual components in the second stage.Via the two-stage reconstruction,high non-stationary noises are effectively reduced,and the reconstruction precision of foreground sound is improved.At recognition stage,we employ deep belief networks to model the composite feature sets extracted from reconstructed signal.The experimental results show that the proposed approach achieved superior recognition performance on 60 classes of ecological sounds in different environments under different Signal-to-Noise Ratio(SNR),compared with the existing method.
基金Supported by the National Natural Science Foundation of China(No.62001001)。
文摘In the uplink grant-free non-orthogonal multiple access(NOMA)scenario,since the active user at the sender has a structured sparsity transmission characteristic,the compressive sensing recovery algorithm is initially applied to the joint detection of the active user and the transmitted data.However,the existing compressed sensing recovery algorithms with unknown sparsity often require noise power or signal-to-noise ratio(SNR)as the priori conditions,which greatly reduces the algorithm adaptability in multi-user detection.Therefore,an algorithm based on cross validation aided structured sparsity adaptive orthogonal matching pursuit(CVA-SSAOMP)is proposed to realize multi-user detection in dynamic change communication scenario of channel state information(CSI).The proposed algorithm transforms the structured sparsity model into a block sparse model,and without the priori conditions above,the cross validation method in the field of statistics and machine learning is used to adaptively estimate the sparsity of active user through the residual update of cross validation.The simulation results show that,compared with the traditional orthogonal matching pursuit(OMP)algorithm,subspace pursuit(SP)algorithm and cross validation aided block sparsity adaptive subspace pursuit(CVA-BSASP)algorithm,the proposed algorithm can effectively improve the accurate estimation of the sparsity of active user and the performance of system bit error ratio(BER),and has the advantage of low-complexity.
基金Supported by National Natural Science Foundation of China(No.61170324 and No.61100105)
文摘In this paper, we propose a face recognition approach-Structed Sparse Representation-based classification when the measurement of the test sample is less than the number training samples of each subject. When this condition is not satisfied, we exploit Nearest Subspaee approach to classify the test sample. In order to adapt all the eases, we combine the two approaches to an adaptive classification method-Adaptive approach. The adaptive approach yields greater recognition accuracy than the SRC approach and CRC_RLS approach with low ~ample rate on the Extend Yale B dataset. And it is more efficient than other two approaches.
基金supported by the Natural Science Foundation of Naval University of Engineering(under Grant No.HGDYDJJ13152)
文摘Based on mode acoustic emission theory,the paper analyses the acoustic emission analog signal of thin steel plate using matching pursuit,then obtains the characteristics interpretation of the different frequency signal energy concentration degree; Combined with four-point arc positioning method,the papers researches the damage localization of the plate-like structure. Simulation experiment shows that this method can accurately detect and locate the damage. This can provide data support for further imaging research based on time reverse theory.
文摘Sparse decomposition is a new theory in signal processing,with the advantage in that the base(dictionary)used in this theory is over-complete,and can reflect the nature of a signal.Thus,the sparse decomposition of signal can obtain sparse representation,which is very important in data compression.The algorithm of compression based on sparse decomposition is investigated.By training on and learning electrocardiogram(ECG)data in the MIT-BIH Arrhythmia Database,we constructed an over-complete dictionary of ECGs.Since the atoms in this dictionary are in accord with the character of ECGs,it is possible that an extensive ECG datum is reconstructed by a few nonzero coefficients and atoms.The proposed compression algorithm can adjust compression ratio according to practical request,and the distortion is low(when the compression ratio is 20∶1,the standard error is 5.11%).The experiments prove the feasibility of the proposed compression algorithm.
文摘In recent years,there has been a growing usage of sparse representations in signal processing.This paper revisits theK-SVD,an algorithm for designing overcomplete dictionaries for sparse and redundant representations.We present a newapproach to solve dictionary learning models by combining the alternating direction method of multipliers and the orthogonal matching pursuit.The experimental results show that our approach can reliably obtain better learned dictionary elements and outperform other algorithms.