检索结果-内蒙古大学图书馆

multi-variable intelligent matching pursuit algorithm using prior knowledge for image reconstruction by l₀ minimization

引用

NEUROCOMPUTING 2016年 207卷 548-559页

作者： Li, Dan Wang, Qiang Shen, Yi Harbin Inst Technol Control Sci & Engn 92 West Da Zhi St Harbin 150001 Peoples R China

Image reconstruction by l(0) minimization is an NP-hard problem that requires exhaustively listing all possibilities of the original signal with a very high computational complexity, which is difficult to be achieved by traditional algorithms. Although greedy algorithm aims at solving l(0) minimization, it is more likely to fall into a suboptimal solution. In this paper, we propose a multi:variable intelligent matching pursuit algorithm (MIMP), which can solve l(0) minimization problem essentially by taking the advantage of the intelligent optimization algorithm in solving combinatorial optimization problems and searching for the global optimal solution to improve the performance of image reconstruction. The updating mechanism of MIMP is designed by introducing the matching strategies of greedy algorithm to accelerate the reconstruction speed. Also, the multi-variable scheme is utilized to sample images and then the joint reconstruction is implemented to the measurements, which can not only improve the reconstruction accuracy but also reduce the computational complexity. Moreover, the edge saliency can be obtained as the prior knowledge to guide the compressive sensing reconstruction, which contributes a lot to reduce the computational complexity and accelerate the reconstruction speed. As the sparsity level of image is hard to be estimated, anew optimization function is proposed to solve this problem without knowing the sparsity level as a prior. Compared with other state-of-the-art algorithms, the proposed method MIMP can achieve a better reconstruction accuracy by solving l(0) minimization essentially with intelligent optimization algorithms. Also, MIMP has a reasonable relatively faster reconstruction speed by introducing the matching strategies of greedy algorithm and using the edge saliency as a prior knowledge. Numerical experiments on several images demonstrate that the proposed method MIMP significantly outperforms the state-of-the-art algorithms and the st

关键词： Compressive sensing l(0) minimization Intelligent optimization algorithm Prior knowledge multi -variable scheme

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：