Compressive Sensing for Attitude Determination Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin May 12, 2011 Draper Laboratory.

Slides:

Advertisements

Similar presentations

Junzhou Huang, Shaoting Zhang, Dimitris Metaxas CBIM, Dept. Computer Science, Rutgers University Efficient MR Image Reconstruction for Compressed MR Imaging.

Advertisements

Sparse Recovery Using Sparse (Random) Matrices Piotr Indyk MIT Joint work with: Radu Berinde, Anna Gilbert, Howard Karloff, Martin Strauss and Milan Ruzic.

Sparse Recovery Using Sparse (Random) Matrices Piotr Indyk MIT Joint work with: Radu Berinde, Anna Gilbert, Howard Karloff, Martin Strauss and Milan Ruzic.

Image acquisition using sparse (pseudo)-random matrices Piotr Indyk MIT.

Multi-Label Prediction via Compressed Sensing By Daniel Hsu, Sham M. Kakade, John Langford, Tong Zhang (NIPS 2009) Presented by: Lingbo Li ECE, Duke University.

Internet Vision - Lecture 3 Tamara Berg Sept 10. New Lecture Time Mondays 10:00am-12:30pm in 2311 Monday (9/15) we will have a general Computer Vision.

Texture Synthesis Tiantian Liu. Definition Texture – Texture refers to the properties held and sensations caused by the external surface of objects received.

Fractal Image Compression

Exploitation of Corot images Leonardo Pinheiro 3/Nov/05, Ubatuba.

Object Recognition Using Distinctive Image Feature From Scale-Invariant Key point D. Lowe, IJCV 2004 Presenting – Anat Kaspi.

Original image: 512 pixels by 512 pixels. Probe is the size of 1 pixel. Picture is sampled at every pixel ( samples taken)

1 CIS607, Fall 2004 Semantic Information Integration Presentation by Xiaofang Zhang Week 7 (Nov. 10)

Sparse Fourier Transform

Digital Photography Multimedia Communication Department.

Recovery of Clustered Sparse Signals from Compressive Measurements

The “Go-To” Company for Real-Time Video Enhancement  Image processors do what the camera and lens can’t do:  Remove noise  Compensate for camera motion.

Computer Example of Schiele and Pentland’s Probabilistic Object Recognition and Localization Marshall Tappen

Centroids part 2 Getting rid of outliers and sorting.

Image Comparison Tool Product Proposal Tim La Fond and Peter Beckfield.

Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality Piotr Indyk, Rajeev Motwani The 30 th annual ACM symposium on theory of computing.

CDVS on mobile GPUs MPEG 112 Warsaw, July Our Challenge CDVS on mobile GPUs  Compute CDVS descriptor from a stream video continuously  Make.

Real Time Transcoding Soam Acharya July 30, 1997 Cornell University.

Quiz Week 8 Topical. Topical Quiz (Section 2) What is the difference between Computer Vision and Computer Graphics What is the difference between Computer.

Texture Synthesis by Image Quilting CS766 Class Project Fall 2004 Eric Robinson.

An Improved Approach For Image Matching Using Principle Component Analysis(PCA An Improved Approach For Image Matching Using Principle Component Analysis(PCA.

Sparse RecoveryAlgorithmResults  Original signal x = x k + u, where x k has k large coefficients and u is noise.  Acquire measurements Ax = y. If |x|=n,

Grouping and Segmentation. Sometimes edge detectors find the boundary pretty well.

Two Tantalizing Concepts Randomness –“Any one who considers arithmetical methods of producing random digits is, of course, in a state of sin” – Von Neumann.

Unit 3: Impression Evidence tool marks

Data Structures and Design in Java © Rick Mercer

WAVELET VIDEO PROCESSING TECHNOLOGY

Data Compression.

Basics of Website Development

Basic Rendering Techniques

2D Motion is just the Beginning

Sponge: Draw the four types of reflectors.

Image Segmentation Classify pixels into groups having similar characteristics.

Data Compression.

Basic Logical Operations (Fascinating)

Hourglass Processing Approach (AIG)

Estimating Link Signatures with Machine Learning Algorithms

Parallel Architectures

Deep Belief Networks Psychology 209 February 22, 2013.

A special case of calibration

An Introduction to Scanning and Storing Photographs and Graphics

Outline Perceptual organization, grouping, and segmentation

Gravity Review Name________________ Period___________

Iterative Optimization

We understand classification algorithms in terms of the expressiveness or representational power of their decision boundaries. However, just because your.

Sum of Absolute Differences Hardware Accelerator

Fingerprints Forensic Science T. Trimpe

Multiple Instance Learning: applications to computer vision

Fingerprints Forensic Science T. Trimpe

5 Themes of Geography Geographers work to organize space and information about the space around them. To do this they ask questions that fall under 5 main.

Star Light Star Bright Desktop Constellations

Computer Communication & Networks

Finite Element Surface-Based Stereo 3D Reconstruction

Designing Algorithms for Multiplication of Fractions

Bootstrapped Optimistic Algorithm for Tree Construction

Fingerprints Forensic Science T. Trimpe

Project 1 Guidelines.

Depth Analysis With Stereo Camera

Depth Analysis With Stereo Camera

The Image The pixels in the image The mask The resulting image 255 X

A Parallel Algorithm for Hardware Implementation of Inverse Halftoning

LSH-based Motion Estimation

Your project is due NO LATER THAN January 2, 2019

Evaluate the integral {image}

1.1 Meeting customer needs

Presentation transcript:

Compressive Sensing for Attitude Determination Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin May 12, 2011 Draper Laboratory

Attitude Determination

Attitude Determination

Star Trackers 1. Acquire Image 2. Find a few big stars 3. Match constellations to database

Compressive Star Trackers 1. Acquire Compressed Image 2. Find a few big stars 3. Match constellations to database 2.5 Decompress

1. Compression (folding)

2. Find a few big stars ● This is just like the regular algorithm ● Except faster, because we have smaller images Fold 1 Fold 2

2.5a Match stars ● Label the stars in Fold 1 ● Find stars that look similar in Fold 2 Fold 1 Fold

2.5b Decompress Decompress the labels one at a time. x x

Compressive Star Trackers 1. Acquire Compressed Image 2. Find a few big stars 3. Match constellations to database 2.5 Label and Decompress 2x

Hardware ● Why now? ● Falling cost of computation relative to sensing ● Potential implementations ● Mirrors ● Lenses ● Integrated circuit (CMOS)

Generalizations ● Two folds --> Many folds ● Random --> Adversarial star placement ● Stars --> Local, distinguishable objects ● Full paper (with pictures)

Empirical Results Std of noise added to each folded pixel Fraction of correct recoveries Tiling is robust to compression