Search-Based Methods for the Sparse Signal Recovery Problem in Compressed Sensing (2013)
Abstract / truncated to 115 words
The sparse signal recovery, which appears not only in compressed sensing but also in other related problems such as sparse overcomplete representations, denoising, sparse learning, etc. has drawn a large attraction in the last decade. The literature contains a vast number of recovery methods, which have been analysed in theoretical and empirical aspects. This dissertation presents novel search-based sparse signal recovery methods. First, we discuss theoretical analysis of the orthogonal matching pursuit algorithm with more iterations than the number of nonzero elements of the underlying sparse signal. Second, best-fi rst tree search is incorporated for sparse recovery by a novel method, whose tractability follows from the properly de fined cost models and pruning techniques. The ...
compressed sensing – sparse signal recovery – best-first tree search – forward-backward search – mixed integer linear programming.
Information
- Author
- Karahanoglu, Nazim Burak
- Institution
- Sabanci University
- Supervisor
- Publication Year
- 2013
- Upload Date
- Sept. 26, 2013
The current layout is optimized for mobile phones. Page previews, thumbnails, and full abstracts will remain hidden until the browser window grows in width.
The current layout is optimized for tablet devices. Page previews and some thumbnails will remain hidden until the browser window grows in width.