Optimization Videos
From Wikimization
(Difference between revisions)
Line 53: | Line 53: | ||
: Equality Constrained Minimization (<math>\approx</math> 43 min in). | : Equality Constrained Minimization (<math>\approx</math> 43 min in). | ||
: Barrier function (<math>\approx</math> 47 min in). | : Barrier function (<math>\approx</math> 47 min in). | ||
+ | : Central path (<math>\approx</math> 53 min in). | ||
[http://www.ima.umn.edu/recordings/New_Directions_Short_Course/ND6.4-15.07/candes6-15-07.ram June 15 2007] | [http://www.ima.umn.edu/recordings/New_Directions_Short_Course/ND6.4-15.07/candes6-15-07.ram June 15 2007] |
Revision as of 17:47, 26 August 2008
Contents |
Compressive Sampling, Compressed Sensing, University Minnesota
Emmanuel Candes
(requires RealPlayer to watch)
June 4 2007 Sparsity.
June 5 2007 (Audio begins 4 minutes into film.)
- Norms.
- Early work by pioneers ( 16 minutes into film).
- Deconvolution ( 30 minutes into film).
- Lasso, Basis Pursuit ( 38 minutes in).
- Wavelets, Curvelets, Ridgelets, sinusoids ( 55 minutes in).
- Overcomplete Dictionary ( 57 minutes in).
- Basis Pursuit ( 1:03 hours in).
- Feature separation ( 1:12 hours in).
- Barbara, Jean-Luc Stark ( 1:15 hours in).
- Magnetic Resonance Imaging (MRI) ( 1:16 hours in).
- Sample rate ( 1:36 hours in).
June 6 2007 (If you only watch one Candes video, this is it.)
- Recovery of Dirac comb, derivation of minimum sampling rate ( 11 minutes into film).
- 4:1 sample to sparsity rule ( 21 minutes into film).
- Candes' Matlab code ( 25 minutes in).
- Fundamental premises of Compressed Sensing: sparsity and incoherence ( 29 minutes in).
June 11 2007 (Audio back at 17 minutes into film.)
- Matlab ( 1:15).
- MRI phantom with noise using Dantzig ( 1:28).
- Imaging fuel cells ( 1:31).
- Subsampling ( 1:36).
June 13 2007 Connections with Information and Coding Theory
- error correction (since the beginning).
- Matlab decode ( 20 min in).
- second error corruption model: gross error + quantization error ( 29 min in).
- Connection with the Sparse Recovery Problem ( 57 min in).
- Reed-Solomon code ( 1:08 min in).
- Matlab for Reed-Solomon code ( 1:26 min in).
June 14 2007 Modern Convex Optimization
- Unconstrained Minimization ( 11 min in).
- Matlab example for Gradient Descent with exact Line Search ( 19 min in).
- Exact line search vs. Backtracking line search ( 22 min in).
- Newton Step ( 26 min in).
- Self Concordance ( 35 min in).
- Equality Constrained Minimization ( 43 min in).
- Barrier function ( 47 min in).
- Central path ( 53 min in).
Chromosome structure, University of California, San Diego
Ronan Fleming
Auto-correlation coefficients (6MB video) from Chromosome structure via Euclidean Distance Matrices.
International Society for Magnetic Resonance in Medicine (ISMRM Toronto 2008)
Randy Duensing & Feng Huang
(requires Adobe Flash Player)
Objective Comparison of Alternate Reconstruction Strategies: An Unmet Need
- Username: 44141
- Password: Law