Approximately Optimal Subspace Pursuit Based on Cosparse Analysis Model

ZHANG Zong-nian; LI Jin-hui; HUANG Ren-tai; YAN Jing-wen

doi:10.3969/j.issn.0372-2112.2016.10.001

您当前的位置：

首页 >

文章列表页 >

Approximately Optimal Subspace Pursuit Based on Cosparse Analysis Model

更新时间：2025-07-16

- Approximately Optimal Subspace Pursuit Based on Cosparse Analysis Model
- Acta Electronica Sinica Vol. 44, Issue 10, Pages: 2289-2293(2016)
- 作者机构：
  
  1. 东莞理工学院电子工程学院,广东,东莞,523808
  2. 东莞理工学院网络中心,广东,东莞,523808
  3. 东莞理工学院计算机学院,广东,东莞,523808
  4. 汕头大学电子工程系,广东,汕头,515063
  5. 东莞理工学院电子工程学院,广东,东莞,523808
  6. 东莞理工学院网络中心,广东,东莞,523808
  7. 东莞理工学院计算机学院,广东,东莞,523808
  8. 汕头大学电子工程系,广东,汕头,515063
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2016.10.001
  CLC： TN911.72
- Published Online：25 October 2016，
  
  Published：2016
- 稿件说明：
移动端阅览
ZHANG Zong-nian, LI Jin-hui, HUANG Ren-tai, et al. Approximately Optimal Subspace Pursuit Based on Cosparse Analysis Model[J]. Acta Electronica Sinica, 2016, 44(10): 2289-2293.
DOI：

ZHANG Zong-nian, LI Jin-hui, HUANG Ren-tai, et al. Approximately Optimal Subspace Pursuit Based on Cosparse Analysis Model[J]. Acta Electronica Sinica, 2016, 44(10): 2289-2293. DOI： 10.3969/j.issn.0372-2112.2016.10.001.

摘要

为了从含噪声的测量矢量中重构原始信号，研究了稀疏补分析模型下近似最优子空间追踪信号重构算法.针对直接采用稀疏综合模型下子空间追踪过程非最速梯度下降和信号重构概率不高的缺点，根据稀疏补分析模型下不同类型分析字典的结构特点来设计近似目标优化函数；改进了迭代追踪过程；优化了稀疏补取值方法；提出并实现了基于稀疏补分析模型的近似最优分析子空间追踪算法.仿真实验证明，当稀疏补运算符分别采用随机紧支框架和二维全变分矩阵时，算法的完全重构信号概率均明显高于ASP、AHTP、AIHT、AL1、GAP算法的完全重构信号概率；对于含高斯噪声的输入信号，算法的重构信号综合平均PSNR比相应的ASP、AHTP、AIHT算法分别提高了0.8dB、1.38dB、3.13 dB，但比GAP和AL1算法降低了0.32 dB和0.6dB.算法的完全重构概率与综合重构性能有了明显提高，收敛充分条件得到进一步简化.

Abstract

An approximately optimal subspace pursuit algorithm under cosparse analysis model was studied to reconstruct the original signal from the noisy measurement vectors.To overcome the drawbacks of the non steepest gradient during the pursuit process and the low successful reconstruction probability for sparse synthesis model

an approximately optimal subspace pursuit algorithm based on cosparse analysis model was presented and realized.The approximately optimal optimization object function for the algorithm was designed according to the structure of the different analysis dictionaries

the iterative pursuit process of the algorithm was revised

and the methods of selecting cosparsity was optimized.The simulation experiments show that the complete reconstruction probability of the new algorithm is evidently larger than that of the algorithm for ASP

AHTP

AIHT

AL1 and GAP when the cosparse operator is a random compact frame or a two dimension total variant matrix.The comprehensive average PSNR of the output signal for the new algorithm is larger than that of the algorithm of ASP

AHTP

and AIHT for 0.8dB

1.38dB and 3.13 dB respectively and is less than that of the algorithm of GAP and AL1 for 0.32 dB and 0.6dB when the input signal is with Gaussion noise.The complete reconstruction probability of the new algorithm was greatly improved by adopting the above measures

and the convergence condition for the new algorithm was simplified.

关键词

Keywords

references

Views

421

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Reconstructed Transfer Subspace Based Multi-View Domain Adaptation Method for Electroencephalogram Emotion Classification

Dual-Threshold CFAR Detection for Distributed Targets

Compressed Sensing of Block-Sparse Signals Recovery Based on Subspace

A Fast Codeword Search Algorithm for High-Dimensional VQ Encoding Using Triangle Inequality in Subspace

Related Author

YIN Xin-chun

ZHOU Guo-hua

HAN Shao-yong

JIAN Tao

GUAN Jian

ZHANG Xiao-li

HE You

PENG Xi-yuan

Related Institution

College of Information Engineering, Yangzhou University

Department of Information Engineering, Changzhou Vocational Institute of Industry Technology

Postdoctoral Scientific Research Workstation, Bank of Zhengzhou

School of Mathematics and Computer Science, Tongling University

Department of Electronic and Information Engineering, Navy Aeronautical and Astronautical University

⁰