YoVDO

An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices

Offered By: IEEE via YouTube

Tags

Signal Processing Courses Linear Algebra Courses Information Theory Courses Mathematical Analysis Courses Compressed Sensing Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 20-minute IEEE conference talk that delves into the mathematical intricacies of sparse reconstruction using subsampled Hadamard matrices. Learn about the latest advancements in lower bound calculations presented by researchers Jaroslaw Blasiok, Patrick Lopatto, Kyle Luh, Jake Marcinek, and Shravas Rao. Gain insights into the theoretical foundations and practical implications of this improved lower bound for sparse reconstruction techniques.

Syllabus

An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Statistical Machine Learning
Eberhard Karls University of Tübingen via YouTube
Linear Algebra
Steve Brunton via YouTube
Koopman Analysis
Steve Brunton via YouTube
Dynamical Systems
Steve Brunton via YouTube
Sparsity and Compression
Steve Brunton via YouTube