M ? n m<n. m ? n m<n Compressive sensing ? m ? n k k ≤ m<n.

Slides:



Advertisements
Similar presentations
Huseyin Ergin and Eugene Syriani University of Alabama Software Modeling Lab Software Engineering Group Department of Computer Science College of Engineering.
Advertisements

A LLISON S EIBERT & A LEXANDRA W ARLEN Efficient Episode Recall and Consolidation E MILIA V ANDERWERF & R OBERT S TILES.
On the Power of Adaptivity in Sparse Recovery Piotr Indyk MIT Joint work with Eric Price and David Woodruff, 2011.
Elaine Hale, Wotao Yin, Yin Zhang Computational and Applied Mathematics Rice University , McMaster University, ICCOPT II TexPoint fonts used.
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.
Compressive Sensing IT530, Lecture Notes.
Sparse Recovery (Using Sparse Matrices)
Pixel Recovery via Minimization in the Wavelet Domain Ivan W. Selesnick, Richard Van Slyke, and Onur G. Guleryuz *: Polytechnic University, Brooklyn, NY.
The Sparse FFT: From Theory to Practice
Structured Sparse Principal Component Analysis Reading Group Presenter: Peng Zhang Cognitive Radio Institute Friday, October 01, 2010 Authors: Rodolphe.
Wangmeng Zuo, Deyu Meng, Lei Zhang, Xiangchu Feng, David Zhang
An Introduction to Sparse Coding, Sparse Sensing, and Optimization Speaker: Wei-Lun Chao Date: Nov. 23, 2011 DISP Lab, Graduate Institute of Communication.
Compressive Data Gathering for Large- Scale Wireless Sensor Networks Chong Luo Feng Wu Shanghai Jiao Tong University Microsoft Research Asia Jun Sun Chang.
Interactive Visualization of the Stock Market Graph Presented by Camilo Rostoker Department of Computer Science University of British.
Introduction to Compressive Sensing
Rice University dsp.rice.edu/cs Distributed Compressive Sensing A Framework for Integrated Sensing and Processing for Signal Ensembles Marco Duarte Shriram.
6.829 Computer Networks1 Compressed Sensing for Loss-Tolerant Audio Transport Clay, Elena, Hui.
Hybrid Dense/Sparse Matrices in Compressed Sensing Reconstruction
A Nonlinear Loop Filter for Quantization Noise Removal in Hybrid Video Compression Onur G. Guleryuz DoCoMo USA Labs
Compressed Sensing Compressive Sampling
Compressive sensing SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits 1 Mayank Bakshi, Sidharth Jaggi, Sheng Cai.
Model-based Compressive Sensing
An ALPS’ view of Sparse Recovery Volkan Cevher Laboratory for Information and Inference Systems - LIONS
Feng Lu Chuan Heng Foh, Jianfei Cai and Liang- Tien Chia Information Theory, ISIT IEEE International Symposium on LT Codes Decoding: Design.
Compressive Sampling: A Brief Overview
SUPER: Sparse signals with Unknown Phases Efficiently Recovered Sheng Cai, Mayank Bakshi, Sidharth Jaggi and Minghua Chen The Chinese University of Hong.
Sparse Fourier Transform
Sparse Representation, Building Dictionaries, and Church Street Lily Chan fully sampled6X undersampled 6X undersampled with CS reconstruction.
Game Theory Meets Compressed Sensing
Compressive Sensing Based on Local Regional Data in Wireless Sensor Networks Hao Yang, Liusheng Huang, Hongli Xu, Wei Yang 2012 IEEE Wireless Communications.
Introduction to Compressed Sensing and its applications
Learning With Structured Sparsity
Fast and robust sparse recovery New Algorithms and Applications The Chinese University of Hong Kong The Institute of Network Coding Sheng Cai Eric Chan.
Low-rank By: Yanglet Date: 2012/12/2. Included Works. Yin Zhang, Lili Qiu ―Spatio-Temporal Compressive Sensing and Internet Traffic Matrices, SIGCOMM.
Performed by: Ron Amit Supervisor: Tanya Chernyakova In cooperation with: Prof. Yonina Eldar 1 Part A Final Presentation Semester: Spring 2012.
Compressive Sensing for Multimedia Communications in Wireless Sensor Networks By: Wael BarakatRabih Saliba EE381K-14 MDDSP Literary Survey Presentation.
© Cambridge University Press 2013 Thomson_alphaem.
© Cambridge University Press 2013 Thomson_Fig
Andrea Montanari and Ruediger Urbanke TIFR Tuesday, January 6th, 2008 Phase Transitions in Coding, Communications, and Inference.
An Introduction to Compressive Sensing Speaker: Ying-Jou Chen Advisor: Jian-Jiun Ding.
Compressed Sensing Ivan Cheung Illustration: Gabriel Peyre.
IGARSS 2011 Esteban Aguilera Compressed Sensing for Polarimetric SAR Tomography E. Aguilera, M. Nannini and A. Reigber.
Linear Subspace Transforms PCA, Karhunen- Loeve, Hotelling C306, 2000.
Practical Message-passing Framework for Large-scale Combinatorial Optimization Inho Cho, Soya Park, Sejun Park, Dongsu Han, and Jinwoo Shin KAIST 2015.
Zhilin Zhang, Bhaskar D. Rao University of California, San Diego March 28,
Reconstruction-free Inference on Compressive Measurements Suhas Lohit, Kuldeep Kulkarni, Pavan Turaga, Jian Wang, Aswin Sankaranarayanan Arizona State.
An Introduction to Compressive Sensing
© Cambridge University Press 2013 Thomson_Fig
Terahertz Imaging with Compressed Sensing and Phase Retrieval Wai Lam Chan Matthew Moravec Daniel Mittleman Richard Baraniuk Department of Electrical and.
n-pixel Hubble image (cropped)
Compressive Sensing for Attitude Determination Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin May 12, 2011 Draper Laboratory.
Recent Developments in the Sparse Fourier Transform
Compressive Coded Aperture Video Reconstruction
Jeremy Watt and Aggelos Katsaggelos Northwestern University
Reversible Data Hiding in Encrypted Images With Distributed Source Encoding Source: IEEE Transactions on Circuits and Systems for Video Technology Vol.26.
© Cambridge University Press 2011
Lecture 15 Sparse Recovery Using Sparse Matrices
Basic Algorithms Christina Gallner
Compressive Sensing Imaging
Towards Understanding the Invertibility of Convolutional Neural Networks Anna C. Gilbert1, Yi Zhang1, Kibok Lee1, Yuting Zhang1, Honglak Lee1,2 1University.
Thomson_eeWWtgc © Cambridge University Press 2013.
Thomson_atlascmsEventsAlt
Slides prepared on 09 September, 2018
Physical Fluctuomatics 7th~10th Belief propagation
Thomson_CandP © Cambridge University Press 2013.
 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix
STOC: Annual ACM Symposium on the Theory of Computing
Thomson_AFBCartoon © Cambridge University Press 2013.
Source: Circuits and Systems for Video Technology,
Presentation transcript:

m ? n m<n

Compressive sensing ? m ? n k k ≤ m<n

Robust compressive sensing ? e z y=A(x+z)+e Approximate sparsity Measurement noise

Apps: 1. Compression W(x+z) x+z BW(x+z) = A(x+z) M.A. Davenport, M.F. Duarte, Y.C. Eldar, and G. Kutyniok, "Introduction to Compressed Sensing,"in Compressed Sensing: Theory and Applications, Cambridge University Press, 2012. 

Apps: 2. Network tomography Weiyu Xu; Mallada, E.; Ao Tang; , "Compressive sensing over graphs," INFOCOM, 2011 M. Cheraghchi, A. Karbasi, S. Mohajer, V.Saligrama: Graph-Constrained Group Testing. IEEE Transactions on Information Theory 58(1): 248-262 (2012)

Apps: 3. Fast(er) Fourier Transform H. Hassanieh, P. Indyk, D. Katabi, and E. Price. Nearly optimal sparse fourier transform. In Proceedings of the 44th symposium on Theory of Computing (STOC '12). ACM, New York, NY, USA, 563-578.

Apps: 4. One-pixel camera http://dsp.rice.edu/sites/dsp.rice.edu/files/cs/cscam.gif

y=A(x+z)+e

y=A(x+z)+e

y=A(x+z)+e

y=A(x+z)+e

y=A(x+z)+e (Information-theoretically) order-optimal

(Information-theoretically) order-optimal Support Recovery

SHO(rt)-FA(st) O(k) meas., O(k) steps

SHO(rt)-FA(st) O(k) meas., O(k) steps

SHO(rt)-FA(st) O(k) meas., O(k) steps

1. Graph-Matrix A d=3 n ck

1. Graph-Matrix A d=3 n ck

1. Graph-Matrix

2. (Most) x-expansion |S| ≥2|S|

3. “Many” leafs L+L’≥2|S| |S| ≥2|S| 3|S|≥L+2L’ L≥|S| L+L’≤3|S|

4. Matrix

Encoding – Recap. 1

Decoding – Initialization

Decoding – Leaf Check(2-Failed-ID)

Decoding – Leaf Check (4-Failed-VER)

Decoding – Leaf Check(1-Passed)

Decoding – Step 4 (4-Passed/STOP)

Decoding – Recap. 1 ? ? ?

Decoding – Recap. 1

Noise/approx. sparsity

Meas/phase error

Correlated phase meas.

Correlated phase meas.

Correlated phase meas.