arrow
返回

Algorithms for simultaneous sparse approximation. Part II: Convex relaxation

delete2006-03-01
delete553
PRE
AI
J
Joel A. Tropp
DOI:10.1016/j.sigpro.2005.05.031delete
delete原文链接
delete分享
delete收藏
摘要

摘要

En 中文
A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear combinations of the same elementary signals. At the same time, the problem balances the error in approximation against the total number of elementary signals that participate. These elementary signals typically model coherent structures in the input signals, and they are chosen from a large, linearly dependent collection. The first part of this paper presents theoretical and numerical results for a greedy pursuit algorithm, called simultaneous orthogonal matching pursuit. The second part of the paper develops another algorithmic approach called convex relaxation. This method replaces the combinatorial simultaneous sparse approximation problem with a closely related convex program that can be solved efficiently with standard mathematical programming software. The paper develops conditions Linder which convex relaxation computes good solutions to simultaneous sparse approximation problems. (C) 2005 Elsevier B.V. All rights reserved.
Keyword:
combinatorial optimization
convex relaxation
multiple measurement vectors
simultaneous sparse approximation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Signal Processing 封面图
Signal Processing
IF:
3.6
论文数:
10.0K
被引数:
1.7W

机构

暂无机构信息
引用论文

引用论文

The characteristics of ammonium and nitrate uptake by phytoplankton in Lake Kinneret1
err2003-12-22
err0
errOAAI
errT. Berman; B. F. Sherr; E. Sherr; D. Wynne; J. J. McCarthy
err分享
err收藏
err分享
err收藏
Detecting the Misfire of Motorcycle Engine with Wide Band Oxygen Sensor
err
IF0
err2013-10-01
err0
PREAI
errYameogo Amadou; Chang-Tai Wu; Yu-Cheng Jiang; Jau-Huai Lu
err分享
err收藏
err分享
err收藏
没有更多内容