[ Search | Site Map | Contact ]

Center for Scientific Computation and Mathematical Modeling

Research Activities > Programs > Sparse Data Representation > Sparse Representation in Redundant Systems

Sparse Representation in Redundant Systems

May 9 - May 13 2005

CSIC Building (#406), Seminar Room 4122.
Directions: home.cscamm.umd.edu/directions

 

Monday, May 9th

9:00 - 9:25

COFFEE


MORNING SESSION


Chair:   Eitan Tadmor (University of Maryland)

9:25 - 9:30

Eitan Tadmor (CSCAMM)
Welcoming Remarks

9:30 - 10:10


David Donoho (Stanford University)
"The Sparsity Phase Transition"

10:15 - 10:55


Anna Gilbert (University of Michigan)
"Simultaneous Sparse Approximation"

11:00 - 11:30

COFFEE BREAK

11:30 - 12:10


Emmanuel Candes (California Institute of Technology)
"Decoding by Linear Programming and Other Perhaps Surprising Phenomena"

12:15 - 2:00

LUNCH  (hosted by CSCAMM)


AFTERNOON SESSION


Chair:   Ingrid Daubechies (Princeton University)

2:00 - 2:40


Roman Vershynin (University of California, Davis)
"Reconstruction of Signals: An Aapproach through Geometric Functional Analysis"

2:45 - 3:15

COFFEE BREAK

3:15 - 3:55


Alexander Petukhov (University of Georgia)
"Sparse Representations: Equivalent Settings and Algorithms"

Back to Top

 

 

 

 

Tuesday, May 10th

9:00 - 9:30

COFFEE


MORNING SESSION


Chair:  David Donoho (Stanford University)

9:30 - 10:10


Richard Baraniuk (Rice University)
"Fast Reconstruction from Incoherent Projections via Tree-Structured Greedy Algorithms"

10:15 - 10:55


Dominique Picard (Paris VII)
"Functional Estimation for Inverse Problems"
 

11:00 - 11:30

COFFEE BREAK

11:30 - 12:10


Patrick Wolfe (Harvard University)
"Redundancy, Sparsity, and Nonlinear Approximation via Time-Frequency Representations"
 

12:15 - 2:00

LUNCH BREAK


AFTERNOON SESSION


Chair:  Anna Gilbert (University of Michigan)

2:00 - 2:40


Vladimir Temlyakov (University of South Carolina)
"On Greedy Algorithms with Restricted Depth Search"

2:45 - 3:25


Joel Tropp (University of Michigan)
"Signal Recovery from Partial Information via Orthogonal Matching Pursuit"

3:30 - 3:45 COFFEE BREAK
3:45 - 4:25


Jing Zou (Princeton University)
"Sublinear Algorithms to Track Functions with Sparse Fourier Representation"

Back to Top

 

 

 

 

Wednesday, May 11th

9:00 - 9:30

COFFEE


MORNING SESSION


Chair:   John Benedetto (University of Maryland)

9:30 - 10:10


Ingrid Daubechies (Princeton University) and Vahid Tarokh (Harvard University)
"Randomness and Determinism in Sparse Algorithms"

10:15 - 10:55


Naoki Saito (University of California at Davis)
"Data Analysis and Representation on General Domains with Eigenfunctions of Laplacian"

11:00 - 11:30

COFFEE BREAK

11:30 - 12:10


Ron DeVore (University of Maryland)
"Anisotropic Classes via Level Sets"

12:15 - 2:00

LUNCH  (hosted by CSCAMM)

2:00 - 3:00


CSCAMM Seminar

Professor M. Gregory Forest (Institute for Advanced Materials, NanoScience and Technology, University of North Carolina at Chapel Hill)
"
Nematic Nano-composites: Flowing Toward Performance Properties"

Back to Top

 

Thursday, May 12th

9:00 - 9:30

COFFEE


MORNING SESSION


Chair:   Ron DeVore (University of Maryland)

9:30 - 10:10


Amos Ron (University of Wisconsin at Madison)
"CAMP: Extremely Local MR Representations"

10:15 - 10:55


Zuowei Shen (National University of Singapore)
"Unitary Extension Principle and Applications"

11:00 - 11:30

COFFEE BREAK

11:30 - 12:10


Glenn Easley (System Planning Corporation)
"Improving Image Deconvolution via Geometric Redundancies"

12:15 - 2:00

LUNCH BREAK


AFTERNOON SESSION


Chair:   Patrick Wolfe (Harvard University)

2:00 - 2:40


Christopher Heil (Georgia Institute of Technology)
"Density, Overcompleteness, and Localization of Frames"

2:45 - 3:25


Gitta Kutyniok (Justus-Liebig-University Giessen)
"Shearlets: A New Wavelet-based Approach Towards Sparse Representations of Singularities in the Plane"

3:30 - 3:45 COFFEE BREAK
3:45 - 4:25


Shai Dekel (RealTimeImage)
"On Adaptive Representations & Smoothness Spaces in Rd"

Back to Top