Following are the slides shown during the SMALL workshop of a week ago. We are going to get the videos this coming week, but in the meantime, here are some of the "morceauz choisis" (selected pieces) I glanced from the slides. Let us note the very interesting conclusions of Pierre Vandergheynst: a rare occurence. Should this type of results be submitted to Rejecta Mathematica ?
Opening Remarks - Mark Plumbley
Francis Bach - Structured sparsity-inducing norms through submodular functions
Mike Davies - Rank aware algorithms for joint sparse recovery
Holger Rauhut - Copressive sensing and structured random matrices
Pierre Vandergheynst - Transductive learning with spectral graph wavelets
Karin Schnass - Dictionary idenfication - Sparse matrix-factorization via L1-minimization
John Wright - Dictionary learning via L1-minimization: well-posedness and correct recovery
Michael Elad - Exploiting statistical dependencies in sparse representations
Kjersti Engan - Dictionary learning by RLA-DLA with applications
LightOn || Google Scholar || LinkedIn ||@IgorCarron ||Homepage||ArXiv
+
Page Views on Nuit Blanche since July 2010
LightOn's Newsletter ||@LightOnIO (1162)||
LinkedIn (727)|| on CrunchBase || our Blog
Nuit Blanche community
@NuitBlog || Facebook (462) || Reddit (2452)
Compressive Sensing on LinkedIn (3967)
Advanced Matrix Factorization on Linkedin (1333)||
Nuit Blanche community
@NuitBlog || Facebook (462) || Reddit (2452)
Compressive Sensing on LinkedIn (3967)
Advanced Matrix Factorization on Linkedin (1333)||
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment