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.展开更多
航空发动机叶尖间隙是监控其运行状态的有效参数,现有间隙测量方法很难满足超高转速下间隙距离的奈奎斯特采样率,因此无法有效提取精确的叶尖间隙值。本文基于压缩感知原理,针对间隙距离数据特征提出一种采用K-SVD(K-singular value dec...航空发动机叶尖间隙是监控其运行状态的有效参数,现有间隙测量方法很难满足超高转速下间隙距离的奈奎斯特采样率,因此无法有效提取精确的叶尖间隙值。本文基于压缩感知原理,针对间隙距离数据特征提出一种采用K-SVD(K-singular value decomposition)字典训练稀疏基的数据重构方法,该方法首先构建出K-SVD字典稀疏基对数据进行稀疏化表示,然后使用m序列高斯随机矩阵对数据进行压缩观测,最后基于压缩欠采样观测值使用正交匹配追踪算法对数据进行重构,进而精确提取叶尖间隙值。实验结果表明,在欠采样条件下间隙距离数据可精确恢复重构,与高采样率下的间隙数据相比,重构误差不超过0.02 mm。展开更多
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.展开更多
基金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.
文摘航空发动机叶尖间隙是监控其运行状态的有效参数,现有间隙测量方法很难满足超高转速下间隙距离的奈奎斯特采样率,因此无法有效提取精确的叶尖间隙值。本文基于压缩感知原理,针对间隙距离数据特征提出一种采用K-SVD(K-singular value decomposition)字典训练稀疏基的数据重构方法,该方法首先构建出K-SVD字典稀疏基对数据进行稀疏化表示,然后使用m序列高斯随机矩阵对数据进行压缩观测,最后基于压缩欠采样观测值使用正交匹配追踪算法对数据进行重构,进而精确提取叶尖间隙值。实验结果表明,在欠采样条件下间隙距离数据可精确恢复重构,与高采样率下的间隙数据相比,重构误差不超过0.02 mm。
基金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.
