News for hackers. Stuff that matters.
Re:Death of the sampling theorem? by jey on Tuesday March 20, 2018 @11:06PM (#16635011)
Close, but not quite: compressed sensing really works in a lot of domains. You "just" have to know of a basis set in which your signal is sparse. This basis set can be (and often is) overcomplete; i.e. you don't need a minimal orthogonal set of basis functions. So if you know that "most pixels of an MRI are black" or "music only has a few non-zero Fourier frequencies", you can apply compressed sensing techniques to recover/reconstruct the underlying signal. This is a fairly mild and merely structural form of a priori side information, as opposed to having to know detailed precise prior distributions or etc.

See https://en.wikipedia.org/wiki/Sparse_dictionary_learning and https://arxiv.org/abs/1012.0621 for the gory details.

Re:Death of the sampling theorem? by highd on Wednesday March 21, 2018 @12:19AM (#16635424)
Most of the research in compressed sensing type applications now is focused on more sophisticated prior distributions than sparse/Laplacian. These more general bayesian approaches provide significant performance improvements over LASSO etc.
Re:Death of the sampling theorem? by jey on Wednesday March 21, 2018 @01:11AM (#16635648)
Sweet, great to hear. Any particular papers you'd recommend checking out?