A study on conditions for sparse solution recovery in compressive sensing
| dc.contributor.advisor | Zhang, Yin | |
| dc.creator | Eydelzon, Anatoly | |
| dc.date.accessioned | 2009-06-03T19:52:54Z | |
| dc.date.available | 2009-06-03T19:52:54Z | |
| dc.date.issued | 2008 | |
| dc.description.abstract | It is well-known by now that tinder suitable conditions ℓ1 minimization can recover sparse solutions to under-determined linear systems of equations. More precisely, by solving the convex optimization problem min{∥ x∥1 : Ax = b}, where A is an m x n measurement matrix with m < n, one can obtain the sparsest solution x* to Ax = b provided that the measurement matrix A has certain properties and the sparsity level k of x* is sufficiently small. This fact has led to active research in the area of compressive sensing and other applications. The central question for this problem is the following. Given a type of measurements, a signal's length n and sparsity level k, what is the minimum measurement size m that ensures recovery? Or equivalently, given a type of measurements, a signal length n and a measurement size m, what is the maximum recoverable sparsity level k? The above fundamental question has been answered, with varying degrees of precision, by a number of researchers for a number of different random or semi-random measurement matrices. However, all the existing results still involve unknown constants of some kind and thus are unable to provide precise answers to specific situations. For example, let A be an m x n partial DCT matrix with n = 107 and m = 5 x 105 (n/m = 20). Can we provide a reasonably good estimate on the maximum recoverable sparsity k? In this research we attempt to provide a more precise answer to the central question raised above. By studying new sufficient conditions for exact recovery of sparse solutions, we propose a new technique to estimate recoverable sparsity for different kinds of deterministic, random and semi-random matrices. We will present empirical evidence to show the practical success of our approach, though further research is still needed to formally establish its effectiveness. | |
| dc.format.extent | 80 p. | en_US |
| dc.format.mimetype | application/pdf | |
| dc.identifier.callno | THESIS MATH.SCI. 2008 EYDELZON | |
| dc.identifier.citation | Eydelzon, Anatoly. "A study on conditions for sparse solution recovery in compressive sensing." (2008) Diss., Rice University. <a href="https://hdl.handle.net/1911/22283">https://hdl.handle.net/1911/22283</a>. | |
| dc.identifier.uri | https://hdl.handle.net/1911/22283 | |
| dc.language.iso | eng | |
| dc.rights | Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. | |
| dc.subject | Mathematics | |
| dc.title | A study on conditions for sparse solution recovery in compressive sensing | |
| dc.type | Thesis | |
| dc.type.material | Text | |
| thesis.degree.department | Mathematical Sciences | |
| thesis.degree.discipline | Engineering | |
| thesis.degree.grantor | Rice University | |
| thesis.degree.level | Doctoral | |
| thesis.degree.name | Doctor of Philosophy |
Files
Original bundle
1 - 1 of 1