arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1102.0844stat.ML
收藏

物理空间上非负矩阵分解和降维的凸模型

A convex model for non-negative matrix factorization and dimensionality reduction on physical space

Ernie Esser, Michael Möller, Stanley Osher, Guillermo Sapiro, Jack Xin

摘要:

提出了一种协作凸框架,用于将数据矩阵$X$分解为具有稀疏系数矩阵$S$的非负积$AS$。我们限制字典矩阵$A$的列与数据矩阵$X$的某些列一致,从而保证物理上有意义的字典和降维。我们使用$l_{1,\infty}$正则化从数据中选择字典,并显示这导致$l_0$在不同的无噪声数据的情况下的精确凸松弛。我们还展示了如何放松的限制,$X$约束,通过初始化一个交替的最小化方法与凸模型的解决方案,获得一个字典接近,但不一定在$X$。我们专注于所提出的框架,高光谱端元和丰度识别的应用程序,也显示了应用程序的核磁共振数据的盲源分离。

英文摘要:

A collaborative convex framework for factoring a data matrix $X$ into a non-negative product $AS$, with a sparse coefficient matrix $S$, is proposed. We restrict the columns of the dictionary matrix $A$ to coincide with certain columns of the data matrix $X$, thereby guaranteeing a physically meaningful dictionary and dimensionality reduction. We use $l_{1,\infty}$ regularization to select the dictionary from the data and show this leads to an exact convex relaxation of $l_0$ in the case of distinct noise free data. We also show how to relax the restriction-to-$X$ constraint by initializing an alternating minimization approach with the solution of the convex model, obtaining a dictionary close to but not necessarily in $X$. We focus on applications of the proposed framework to hyperspectral endmember and abundances identification and also show an application to blind source separation of NMR data.

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

↑