Algorithms for recovery of sparse signals in compressed sensing
In real-world applications, most of the signals can be approximated by sparse signals. When dealing with sparse or compressible signal, the traditional process of acquiring the signal and then discard most of the samples for compression is inefficient and memory consuming. Recent developments in sta...
Huvudupphovsman: | Tran, Anh Vu. |
---|---|
Övriga upphovsmän: | Justin Dauwels |
Materialtyp: | Final Year Project (FYP) |
Språk: | English |
Publicerad: |
2013
|
Ämnen: | |
Länkar: | http://hdl.handle.net/10356/52687 |
Liknande verk
Liknande verk
-
Random walks in distributed networks and their applications
av: Anisur Rahaman Molla
Publicerad: (2014) -
AGV scheduling algorithms for container ports
av: Lim, Hyun Jeong
Publicerad: (2019) -
Game theory based algorithms for community detection
av: Radhika Arava
Publicerad: (2015) -
On viterbi-like algorithms and their application to Reed–Muller codes
av: Ling, San, et al.
Publicerad: (2013) -
Combinatorial algorithms for scheduling jobs to minimize server usage time
av: Ren, Runtian
Publicerad: (2018)