2026-09-18T22:51:22Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/645922022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Pablo A. Parrilo.
Misra, Sidhant
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2011-06-20T15:56:58Z
2011-06-20T15:56:58Z
2011
2011
http://hdl.handle.net/1721.1/64592
727063948
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.
In title on title page, double underscored "l" appears as script. Cataloged from PDF version of thesis.
Includes bibliographical references (p. 75-76).
The central problem of Compressed Sensing is to recover a sparse signal from fewer measurements than its ambient dimension. Recent results by Donoho, and Candes and Tao giving theoretical guarantees that ( 1-minimization succeeds in recovering the signal in a large number of cases have stirred up much interest in this topic. Subsequent results followed, where prior information was imposed on the sparse signal and algorithms were proposed and analyzed to incorporate this prior information. In[13] Xu suggested the use of weighted l₁-minimization in the case where the additional prior information is probabilistic in nature for a relatively simple probabilistic model. In this thesis, we exploit the techniques developed in [13] to extend the analysis to a more general class of probabilistic models, where the probabilities are evaluations of a continuous function at uniformly spaced points in a given interval. For this case, we use weights which have a similar characterization . We demonstrate our techniques through numerical computations for a certain class of weights and compare some of our results with empirical data obtained through simulations.
by Sidhant Misra.
S.M.
76 p.
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Analysis of weighted l̳₁-minimization for model based compressed sensing
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="bffb40a8-b22e-482f-8528-5f93d3bbad8a">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Analysis of weighted l̳₁-minimization for model based compressed sensing</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2011</PublicationDate>
<Authors>
<Author>
<DisplayName>Misra, Sidhant</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>The central problem of Compressed Sensing is to recover a sparse signal from fewer measurements than its ambient dimension. Recent results by Donoho, and Candes and Tao giving theoretical guarantees that ( 1-minimization succeeds in recovering the signal in a large number of cases have stirred up much interest in this topic. Subsequent results followed, where prior information was imposed on the sparse signal and algorithms were proposed and analyzed to incorporate this prior information. In[13] Xu suggested the use of weighted l₁-minimization in the case where the additional prior information is probabilistic in nature for a relatively simple probabilistic model. In this thesis, we exploit the techniques developed in [13] to extend the analysis to a more general class of probabilistic models, where the probabilities are evaluations of a continuous function at uniformly spaced points in a given interval. For this case, we use weights which have a similar characterization . We demonstrate our techniques through numerical computations for a certain class of weights and compare some of our results with empirical data obtained through simulations.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>