L1 magic recovery of sparse signals via convex programming by emmanuel cand s and justin romberg l.jpg
This presentation is the property of its rightful owner.
Sponsored Links
1 / 5

L1-magic : Recovery of Sparse Signals via Convex programming by Emmanuel Cand è s and Justin Romberg PowerPoint PPT Presentation


  • 648 Views
  • Uploaded on
  • Presentation posted in: General

L1-magic : Recovery of Sparse Signals via Convex programming by Emmanuel Cand è s and Justin Romberg. CaltechOctober 2005 Compressive Sensing Tutorial PART 2 Svetlana Avramov-Zamurovic January 22, 2009. Definitions. X desired vector (N elements), K sparse Y measurements (M elements), K<M<N

Download Presentation

L1-magic : Recovery of Sparse Signals via Convex programming by Emmanuel Cand è s and Justin Romberg

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


L1 magic recovery of sparse signals via convex programming by emmanuel cand s and justin romberg l.jpg

L1-magic : Recovery of Sparse Signals via Convex programmingby Emmanuel Candès and Justin Romberg

CaltechOctober 2005

Compressive Sensing Tutorial PART 2

Svetlana Avramov-Zamurovic

January 22, 2009.


Definitions l.jpg

Definitions

  • X desired vector (N elements), K sparse

  • Y measurements (M elements), K<M<N

  • Ψ orthonormal basis (NxN), X= Ψs

  • Φ measurement matrix (MxN)

  • L1 norm= sum(abs(all vector X elements))

  • Linear programming

    • Find sparse solution that satisfies measurements, Y= ΦX and minimizes the L1 norm of X


Matlab programs http sparselab stanford edu l.jpg

MATLAB programs http://sparselab.stanford.edu/

Gabriel PeyréCNRS, CEREMADE, Université Paris Dauphine.

http://www.ceremade.dauphine.fr/~peyre/

Justin RombergSchool of Electrical and Computer EngineeringGeorgia Tech

http://users.ece.gatech.edu/~justin/Justin_Romberg.html


Min l1 with equality constraints l.jpg

Min-L1 with equality constraints

When x, A, b have real-valued entries, (P1) can be recast as an LP.

% load random states for repeatable experiments

rand_state=1;randn_state=1;rand('state', rand_state);randn('state', randn_state);

N = 512;% signal length

T = 20;% number of spikes in the signal

K = 120;% number of observations to make

x = zeros(N,1);q = randperm(N);x(q(1:T)) = sign(randn(T,1));

% random +/- 1 signal% %SAZ original signal to be recovered

disp('Creating measurment matrix...');A = randn(K,N);A = orth(A')';disp('Done.');

y = A*x;% observations SAZ measurements

x0 = A'*y;% initial guess = min energy

xp = l1eq_pd(x0, A, [], y, 1e-3); % solve the LP

http://www.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf


Slide5 l.jpg

N=512

K=20

M=120

N=512

K=20

M=80


  • Login