arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.0277cs.ITcs.DMmath.IT
收藏

最优矩阵感知

Sensing with Optimal Matrices

Hema Kumari Achanta, Soura Dasgupta, Weiyu Xu

摘要:

我们考虑的问题,设计最佳的$M \times N$($M \leq N$)的传感矩阵,最大限度地减少最大条件数的所有子矩阵的$K$列。当在给定时间只有$N$传感器中的$K$传感器可用于感测时,这样的矩阵使最坏情况的估计误差最小化。对于M=2且列为单位范数的矩阵,该问题等价于求$K$列的所有子矩阵的最小奇异值的最大化问题.当M=2时,我们能够给出子矩阵的条件数的封闭形式公式。当M=2,K=3时,对于任意的$N\geq3$,我们导出了使$K$列的所有子矩阵的最大条件数最小的最优矩阵。令人惊讶的是,均匀分布设计通常是最小化最大条件数的最优设计\emph{not}。

英文摘要:

We consider the problem of designing optimal $M \times N$ ($M \leq N$) sensing matrices which minimize the maximum condition number of all the submatrices of $K$ columns. Such matrices minimize the worst-case estimation errors when only $K$ sensors out of $N$ sensors are available for sensing at a given time. For M=2 and matrices with unit-normed columns, this problem is equivalent to the problem of maximizing the minimum singular value among all the submatrices of $K$ columns. For M=2, we are able to give a closed form formula for the condition number of the submatrices. When M=2 and K=3, for an arbitrary $N\geq3$, we derive the optimal matrices which minimize the maximum condition number of all the submatrices of $K$ columns. Surprisingly, a uniformly distributed design is often \emph{not} the optimal design minimizing the maximum condition number.

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

↑