压缩感知（Compressed Sensing）的数学原理

• 压缩感知与变换编码（transform coding）的区别
  与变换编码不同的是，CS首先就通过直接地稀疏采样，然后根据算法恢复结果。This is the fundamental idea behind CS: rather than first sampling at a high rate and then compressing the sampled data, we would like to find ways to directly sense the data in a compressed form – i.e., at a lower sampling rate.
• 数学原理
  $x={\sum }_{i=1}^n{c}_i{\varphi }_i$ 其中， { ϕ i } i = 1 n \left\{\phi_{i}\right\}_{i=1}^{n} { ϕi​}i=1n​是$R_n$空间的一组线性无关的基，而$x\in {\mathbb{R}}^n$。将这些基组成$n\times n$ 矩阵$\Phi$