修正多源线性测量和压缩感知中的误差
Correcting Errors in Linear Measurements and Compressed Sensing of Multiple Sources
AI总结:
本文提出了一种算法,用于解决矩形矩阵Φ的线性方程组Φx=y的稀疏解问题,当测量向量y受稀疏误差向量e扰动时。算法结合了贪婪和慷慨策略,能高效处理线性数据测量,无需额外冗余编码。
摘要:
我们提出了一种算法,用于求解线性方程组Φx=y的稀疏解,其中Φ是大小为n×N的矩形矩阵,n<N,当测量向量y受到稀疏误差向量e的扰动时。我们称该算法为ℓ^1-贪心慷慨(LGGA),因为它在解码过程中结合了贪婪和慷慨策略。与传统纠错方法相比,LGGA的主要优势在于能够高效地直接处理线性数据测量。它利用测量的自然残差冗余,不需要任何额外的冗余信道编码。我们展示了如何使用该算法对多通道源进行编码-解码。该算法在处理编码源具有不同密度/稀疏性信息内容时,相较于现有直接解码器有显著优势。这一特性可用于非常高效的分块编码,用于信息分布不均匀的数据集。图像是最典型的此类源的例子。LGGA的重要特性是其与编码器的分离。解码器不需要任何额外的来自编码器的侧信息,除了线性测量和知道这些测量是不同源的线性组合。
英文摘要:
We present an algorithm for finding sparse solutions of the system of linear equations $Φ\mathbf{x}=\mathbf{y}$ with rectangular matrices $Φ$ of size $n\times N$, where $n<N$, when measurement vector $\mathbf{y}$ is corrupted by a sparse vector of errors $\mathbf e$. We call our algorithm the $\ell^1$-greedy-generous (LGGA) since it combines both greedy and generous strategies in decoding. Main advantage of LGGA over traditional error correcting methods consists in its ability to work efficiently directly on linear data measurements. It uses the natural residual redundancy of the measurements and does not require any additional redundant channel encoding. We show how to use this algorithm for encoding-decoding multichannel sources. This algorithm has a significant advantage over existing straightforward decoders when the encoded sources have different density/sparsity of the information content. That nice property can be used for very efficient blockwise encoding of the sets of data with a non-uniform distribution of the information. The images are the most typical example of such sources. The important feature of LGGA is its separation from the encoder. The decoder does not need any additional side information from the encoder except for linear measurements and the knowledge that those measurements created as a linear combination of different sources.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。