2026-09-20T02:48:27Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/848692022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Piotr Indyk.
Grant, Elyot
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2014-02-10T16:56:35Z
2014-02-10T16:56:35Z
2013
http://hdl.handle.net/1721.1/84869
868329734
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 41-42).
In this thesis, we establish theoretical guarantees for several dimension reduction algorithms developed for applications in compressive sensing and signal processing. In each instance, the input is a point or set of points in d-dimensional Euclidean space, and the goal is to find a linear function from Rd into Rk , where k << d, such that the resulting embedding of the input pointset into k-dimensional Euclidean space has various desirable properties. We focus on two classes of theoretical results: -- First, we examine linear embeddings of arbitrary pointsets with the aim of minimizing distortion. We present an exhaustive-search-based algorithm that yields a k-dimensional linear embedding with distortion at most ... is the smallest possible distortion over all orthonormal embeddings into k dimensions. This PTAS-like result transcends lower bounds for well-known embedding teclhniques such as the Johnson-Lindenstrauss transform. -- Next, motivated by compressive sensing of images, we examine linear embeddings of datasets containing points that are sparse in the pixel basis, with the goal of recoving a nearly-optimal sparse approximation to the original data. We present several algorithms that achieve strong recovery guarantees using the near-optimal bound of measurements, while also being highly "local" so that they can be implemented more easily in physical devices. We also present some impossibility results concerning the existence of such embeddings with stronger locality properties.
by Elyot Grant.
S.M.
42 pages
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.
Dimension reduction algorithms for near-optimal low-dimensional embeddings and compressive sensing
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="95fe83be-8639-48c9-a223-8422437a2df3">
<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>Dimension reduction algorithms for near-optimal low-dimensional embeddings and compressive sensing</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2013</PublicationDate>
<Authors>
<Author>
<DisplayName>Grant, Elyot</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>In this thesis, we establish theoretical guarantees for several dimension reduction algorithms developed for applications in compressive sensing and signal processing. In each instance, the input is a point or set of points in d-dimensional Euclidean space, and the goal is to find a linear function from Rd into Rk , where k << d, such that the resulting embedding of the input pointset into k-dimensional Euclidean space has various desirable properties. We focus on two classes of theoretical results: -- First, we examine linear embeddings of arbitrary pointsets with the aim of minimizing distortion. We present an exhaustive-search-based algorithm that yields a k-dimensional linear embedding with distortion at most ... is the smallest possible distortion over all orthonormal embeddings into k dimensions. This PTAS-like result transcends lower bounds for well-known embedding teclhniques such as the Johnson-Lindenstrauss transform. -- Next, motivated by compressive sensing of images, we examine linear embeddings of datasets containing points that are sparse in the pixel basis, with the goal of recoving a nearly-optimal sparse approximation to the original data. We present several algorithms that achieve strong recovery guarantees using the near-optimal bound of measurements, while also being highly "local" so that they can be implemented more easily in physical devices. We also present some impossibility results concerning the existence of such embeddings with stronger locality properties.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>