Random sparse sampling → interpolationNyquist frequency 보다 훨씬 적은 샘플링 만으로도 원 신호를 복원Sparse하기만 하다면 신호를 완벽하게 복원가능 by Measurement Matrix with low mutual coherenceExact compressed sensing is NP-hard Compressed sensing notionMeasurement MatrixMutual CoherenceSparse coding theorySparse RepresentationStructured sparsity regularization DL Donohoieeexplore.ieee.orghttps://ieeexplore.ieee.org/document/1614066arxiv.orghttps://arxiv.org/pdf/1703.03208.pdfCompressed sensingCompressed sensing (also known as compressive sensing, compressive sampling, or sparse sampling) is a signal processing technique for efficiently acquiring and reconstructing a signal, by finding solutions to underdetermined linear systems. This is based on the principle that, through optimization, the sparsity of a signal can be exploited to recover it from far fewer samples than required by the Nyquist–Shannon sampling theorem. There are two conditions under which recovery is possible.[1] The first one is sparsity, which requires the signal to be sparse in some domain. The second one is incoherence, which is applied through the isometric property, which is sufficient for sparse signals.[2][3] Compressed sensing has applications in, for example, MRI where the incoherence condition is typically satisfied.[4]https://en.wikipedia.org/wiki/Compressed_sensingRandom의 재발견, 압축센싱(Compressed Sensing)압축센싱은 영어로 Compressed Sensing 또는 Compressive Sensing 이라고도 부릅니다. 압축센싱이란 무엇일까요? - 위 움짤은 Nyquist Sampling 정리 를 표현하고 있습니다.https://www.linkedin.com/pulse/random의-재발견-압축센싱compressed-sensing-gromit-park/?originalSubdomain=kr