A compressive sensing algorithm for attitude determination
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011. === Cataloged from PDF version of thesis. === Includes bibliographical references (p. 29-30). === We propose a framework for compressive sensing of images with local distinguishable o...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/66422 |
id |
ndltd-MIT-oai-dspace.mit.edu-1721.1-66422 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-MIT-oai-dspace.mit.edu-1721.1-664222019-05-02T15:43:39Z A compressive sensing algorithm for attitude determination Gupta, Rishi Vijay Piotr Indyk and Yaron Rachlin. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011. Cataloged from PDF version of thesis. Includes bibliographical references (p. 29-30). We propose a framework for compressive sensing of images with local distinguishable objects, such as stars, and apply it to solve a problem in celestial navigation. Specifically, let x [epsilon] RN be an N-pixel image, consisting of a small number of local distinguishable objects plus noise. Our goal is to design an m x N measurement matrix A with m << N, such that we can recover an approximation to x from the measurements Ax. We construct a matrix A and recovery algorithm with the following properties: (i) if there are k objects, the number of measurements m is O((klog N)/(log k)), undercutting the best known bound of O(klog(N/k)) (ii) the matrix A is ultra-sparse, which is important when the signal is weak relative to the noise, and (iii) the recovery algorithm is empirically fast and runs in time sub-linear in N. We also present a comprehensive study of the application of our algorithm to attitude determination, or finding one's orientation in space. Spacecraft typically use cameras to acquire an image of the sky, and then identify stars in the image to compute their orientation. Taking pictures is very expensive for small spacecraft, since camera sensors use a lot of power. Our algorithm optically compresses the image before it reaches the camera's array of pixels, reducing the number of sensors that are required. by Rishi Vijay Gupta. M.Eng. 2011-10-17T21:24:15Z 2011-10-17T21:24:15Z 2011 2011 Thesis http://hdl.handle.net/1721.1/66422 755282015 eng 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 30 p. application/pdf Massachusetts Institute of Technology |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
Electrical Engineering and Computer Science. |
spellingShingle |
Electrical Engineering and Computer Science. Gupta, Rishi Vijay A compressive sensing algorithm for attitude determination |
description |
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011. === Cataloged from PDF version of thesis. === Includes bibliographical references (p. 29-30). === We propose a framework for compressive sensing of images with local distinguishable objects, such as stars, and apply it to solve a problem in celestial navigation. Specifically, let x [epsilon] RN be an N-pixel image, consisting of a small number of local distinguishable objects plus noise. Our goal is to design an m x N measurement matrix A with m << N, such that we can recover an approximation to x from the measurements Ax. We construct a matrix A and recovery algorithm with the following properties: (i) if there are k objects, the number of measurements m is O((klog N)/(log k)), undercutting the best known bound of O(klog(N/k)) (ii) the matrix A is ultra-sparse, which is important when the signal is weak relative to the noise, and (iii) the recovery algorithm is empirically fast and runs in time sub-linear in N. We also present a comprehensive study of the application of our algorithm to attitude determination, or finding one's orientation in space. Spacecraft typically use cameras to acquire an image of the sky, and then identify stars in the image to compute their orientation. Taking pictures is very expensive for small spacecraft, since camera sensors use a lot of power. Our algorithm optically compresses the image before it reaches the camera's array of pixels, reducing the number of sensors that are required. === by Rishi Vijay Gupta. === M.Eng. |
author2 |
Piotr Indyk and Yaron Rachlin. |
author_facet |
Piotr Indyk and Yaron Rachlin. Gupta, Rishi Vijay |
author |
Gupta, Rishi Vijay |
author_sort |
Gupta, Rishi Vijay |
title |
A compressive sensing algorithm for attitude determination |
title_short |
A compressive sensing algorithm for attitude determination |
title_full |
A compressive sensing algorithm for attitude determination |
title_fullStr |
A compressive sensing algorithm for attitude determination |
title_full_unstemmed |
A compressive sensing algorithm for attitude determination |
title_sort |
compressive sensing algorithm for attitude determination |
publisher |
Massachusetts Institute of Technology |
publishDate |
2011 |
url |
http://hdl.handle.net/1721.1/66422 |
work_keys_str_mv |
AT guptarishivijay acompressivesensingalgorithmforattitudedetermination AT guptarishivijay compressivesensingalgorithmforattitudedetermination |
_version_ |
1719027389866967040 |