arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.0413stat.MLstat.APstat.COstat.ME
收藏

求非负最小二乘问题结构稀疏解的一种方法及其应用

A Method for Finding Structured Sparse Solutions to Non-negative Least Squares Problems with Applications

Ernie Esser, Yifei Lou, Jack Xin

摘要:

在许多领域,如高光谱成像和差分光学吸收光谱(DOAS)的分层问题,往往需要找到稀疏的非负线性组合的字典元素,匹配观察到的数据。我们展示了这些问题的各个方面,如DOAS参考和高光谱端元的不确定性,可以通过扩展字典与分组元素和实施结构化稀疏性假设,每组内的组合应该是稀疏的,甚至1-稀疏。如果字典是高度一致的,它是难以获得良好的解决方案,使用凸或贪婪的方法,如非负最小二乘(NNLS)或正交匹配追踪。我们使用与Hoyer测度相关的惩罚,Hoyer测度是$l_1$和$l_2$范数的比率,作为要添加到NNLS型模型中的目标的稀疏性惩罚。为了解决由此产生的非凸模型,我们提出了一个缩放梯度投影算法,需要解决一系列的强凸二次规划。讨论了它与凸分裂方法和凸规划差分的密切联系。我们还提出了有前途的数值结果,例如DOAS分析和高光谱解混问题。

英文摘要:

Demixing problems in many areas such as hyperspectral imaging and differential optical absorption spectroscopy (DOAS) often require finding sparse nonnegative linear combinations of dictionary elements that match observed data. We show how aspects of these problems, such as misalignment of DOAS references and uncertainty in hyperspectral endmembers, can be modeled by expanding the dictionary with grouped elements and imposing a structured sparsity assumption that the combinations within each group should be sparse or even 1-sparse. If the dictionary is highly coherent, it is difficult to obtain good solutions using convex or greedy methods, such as non-negative least squares (NNLS) or orthogonal matching pursuit. We use penalties related to the Hoyer measure, which is the ratio of the $l_1$ and $l_2$ norms, as sparsity penalties to be added to the objective in NNLS-type models. For solving the resulting nonconvex models, we propose a scaled gradient projection algorithm that requires solving a sequence of strongly convex quadratic programs. We discuss its close connections to convex splitting methods and difference of convex programming. We also present promising numerical results for example DOAS analysis and hyperspectral demixing problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑