1 / 34

An Introduction to Compressed Sensing

An Introduction to Compressed Sensing. Student : Shenghan TSAI Advisor : Hsuan -Jung Su and Pin- Hsun Lin Date : M ay 02, 2014. Outline. Introduction Signal---Sparse and Compressible - Sparse & Compressible - Power law - The  p -norm in finite dimensions

zagiri
Download Presentation

An Introduction to Compressed Sensing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An Introduction to Compressed Sensing Student : Shenghan TSAI Advisor : Hsuan-Jung Su and Pin-Hsun Lin Date : May 02, 2014

  2. Outline • Introduction • Signal---Sparse and Compressible - Sparse & Compressible - Power law -The p-norm in finite dimensions • Sensing Matrices - NSP(Null space conditions) -RIP(Restricted isometryproerty) • Sparse Signal Recovery • Conclusion

  3. Introduction

  4. Compressed Sensing • Compressed sensing is a signal processing technique for efficiently acquiring and reconstructing a signal, by finding solutions to underdetermined linear systems.This takes advantage of the signal's sparseness or compressibility in some domain, allowing the entire signal to be determined from relatively few measurements.

  5. History • “If we sample a signal at twice its highest frequency, then we can recover it exactly.” Whittaker-Nyquist-Kotelnikov-Shannon • Emmanuel Candès, Terence Tao, and David Donoho proved that given knowledge about a signal's sparsity(2004)

  6. Motivation

  7. Motivation

  8. How it work? • Y=ΦX Sensing matrix : ,

  9. Deterministic compressive sensing Signal---Sparse and Compressible Sensing Matrices—NSP and RIP

  10. Sparse & Compressible • Sparse Model: Signals of interest are often sparse or compressible, i.e., very few large coefficients, many close to zero. • Sparse signals: have few non-zero coefficients. i.e. K-sparse mean it has at most K nonzeros. • Compressible signals: have few significant coefficients; coefficients decay as a power law.

  11. Power law • A signal is compressible if its sorted coefficient magnitudes in decay rapidly. x be a signal • The signal should observe a power law decay : s=1,2,… q decay faster, more compressible

  12. The p-norm in finite dimensions • Lp mean norm p • EX: P=2 Ex: p=0 Ex: p=∞

  13. The p-norm in finite dimensions • The grid distance between two points is never shorter than the length of the line segment between them. Formally, this means that the Euclidean norm of any vector is bounded by its 1-norm • Using Cauchy–Schwarz inequality.

  14. Sensing Matrices NSP(Null space conditions) RIP(Restricted isometryproerty)

  15. Sensing Matrices

  16. Sensing Matrices • Y=ΦX Sensing matrix : ,

  17. How to design Sensing Matrices • If we sure our date is sparse and compressible, then we want to design Φ with M<<N and want it can recover • To ensure Φ can recover there are two property NSP & RIP need to follow and we got a measurement bound

  18. The Null space property • If we want it can recover K-sparse signals it is that require Φx1 ≠ Φx2 for all K-sparse x1 ≠ x2 • So wenecessarythat Φ must have at least 2K rows otherwise there exist K-sparse x1,x2 s.t. Φ(x1-x2)=0 • Spark are almost the same meaning • M >=2K

  19. The Null space property • Null space property (NSP) of order K if there exists a constant C > 0 • holds for all and for all such that

  20. The restricted isometryproperty • A A matrix satises the restricted isometry property (RIP) of order K if there exists a (0~ 1) • Make sure Φx be stable

  21. The RIP and NSP(relationship between RIP & NSP) • Suppose that Φ satisfies the RIP of order 2K with . Then Φ satisfies the NSP of order 2K with constant (接第X幾頁) • Suppose that Φ satisfies the RIP of order 2K,

  22. Sparse Signal Recovery NSP(Null space conditions) RIP(Restricted isometryproerty)

  23. Sparse Signal Recovery • with noiseless in noise

  24. Cont. • When then

  25. Recovery in noise

  26. Conclusion • If signals are sparse and compressible then can useCS to compressed. • Signals can be perfect recovered ,if satisfies NSP & RIP.

  27. References 1. [E. Cand[U+FFFD] The restricted isometry property and its implications for compressed sensing. Comptes rendus de l'Acad[U+FFFD]e des Sciences, S[U+FFFD]e I, 346(9-10):5898211;592, 2008.. • [Yu TSP 11] G. Yu and Guillermo Sapiro, “Statistical Compressed Sensing of Gaussian Mixture Models,” IEEE Trans of Signal Processing, vol. 59, no. 12, pp. 5842–5857, Dec. 2011. • [R. Baraniuk, M.A. Davenport, M.F. Duarte, C. Hegde], An Introduction to Compressive Sensing, CONNEXIONS, Rice University, Houston, Texas, 2010. 4. [R.G. Baraniuk,] “Compressive sensing,” IEEE Signal Processing Mag., vol. 24, no. 4, pp. 118–120, 124, 2007. 5. http://en.wikipedia.org/wiki/Lp_space 6. http://en.wikipedia.org/wiki/Compressed_sensing

More Related