Sparse Signal Processing Parcimonie en Traitement du Signal Rémi Gribonval INRIA Rennes - Bretagne Atlantique, France
remi.gribonval@inria.fr
lundi 12 novembre 12
Sparse Signal Processing Parcimonie en Traitement du Signal Rmi - - PowerPoint PPT Presentation
Sparse Signal Processing Parcimonie en Traitement du Signal Rmi Gribonval INRIA Rennes - Bretagne Atlantique, France remi.gribonval@inria.fr lundi 12 novembre 12 Two inverse problems in audio processing small-project.eu Source
Sparse Signal Processing Parcimonie en Traitement du Signal Rémi Gribonval INRIA Rennes - Bretagne Atlantique, France
remi.gribonval@inria.fr
lundi 12 novembre 12Two inverse problems in audio processing
✓ S. Nam
✓ A. Adler, N. Bertin, V. Emiya,
2
echange.inria.fr small-project.eu
lundi 12 novembre 12Source localization
with S. Nam
lundi 12 novembre 12Localization with few microphones
✓ localize emitting sources ✓ reconstruct emitted signals ✓ extrapolate acoustic field
4
y = Mx
time-series recorded at sensors (discretized) spatio-temporal acoustic field
∈ Rm ∈ RN
lundi 12 novembre 12Localization with few microphones
✓ localize emitting sources ✓ reconstruct emitted signals ✓ extrapolate acoustic field
4
y = Mx
time-series recorded at sensors (discretized) spatio-temporal acoustic field
∈ Rm ∈ RN
lundi 12 novembre 12Physics-driven design of model
5
(∆p − 1
c2 ∂2 ∂t2 p)(
r, t) = s( r, t), r ∈ ˙ D p n(⇥ r, t) = 0, ⇥ r ∈ D p( r, t)
lundi 12 novembre 12Physics-driven design of model
5
(∆p − 1
c2 ∂2 ∂t2 p)(
r, t) = s( r, t), r ∈ ˙ D p n(⇥ r, t) = 0, ⇥ r ∈ D p( r, t)
Ωx = z x
Discretization sources & boundaries
lundi 12 novembre 12Group sparse source model
6
space time t
z
r,t
lundi 12 novembre 12Group sparse regularization
✦
Convex optimization: efficient & provably convergent algorithms
✦
Promotes group sparsity, cf Kowalski & Torresani 2009, Eldar & Mishali 2009, Baraniuk & al 2010, Jenatton & al 2011
7
y = Mx ˆ x = arg min
x
1 2ky Mxk2
2 + λkΩxk1,2
lundi 12 novembre 12✓ 2D+t vibrating plate 77x77 ✓ 2 sources, random location ✓ 6 microphones, random location ✓ known complex boundaries ✓ ground truth generated with naive
discretization
Sparse Field Reconstruction
8
Ground truth Sparse reconstruction
✓ 2D+t vibrating plate 77x77 ✓ 2 sources, random location ✓ 6 microphones, random location ✓ known complex boundaries ✓ ground truth generated with naive
discretization
Sparse Field Reconstruction
8
Ground truth Sparse reconstruction
Localizing the source next door
Microphones
9
lundi 12 novembre 12Localizing the source next door
Microphones
9
lundi 12 novembre 12Localizing the source next door
Microphones
9
Reasons of success
Localizing the source next door
Microphones
9
Reasons of success
What if shape is unknown ?
lundi 12 novembre 12Audio inpainting
with A. Adler, V. Emiya, M. Elad, M. Jafari, M. Plumbley
lundi 12 novembre 12Declipping as a linear inverse problem
11
M x y yreliable yreliable = x
lundi 12 novembre 12Sparse audio models
(Black = zero)
12
Analysis Synthesis
✓ sparsity in time-frequency dictionary
✓ find sparse coefficients such that
✦
(Orthonormal) Matching Pursuit (Mallat & Zhang 93) ✓ + ensure compatibility with clipping constraint
✦
Convex optimization ✓ estimate
Audio Speech and Language Proc., 2012
Audio Declipping
13 0.01 0.02 0.03 0.04 0.05 −0.5 0.5 time (s) Amplitude
x = Dz
y = MDˆ z
ˆ z
ˆ x = Dˆ z
lundi 12 novembre 12✓ sparsity in time-frequency dictionary
✓ find sparse coefficients such that
✦
(Orthonormal) Matching Pursuit (Mallat & Zhang 93) ✓ + ensure compatibility with clipping constraint
✦
Convex optimization ✓ estimate
Audio Speech and Language Proc., 2012
Audio Declipping
13 0.01 0.02 0.03 0.04 0.05 −0.5 0.5 time (s) Amplitude
x = Dz
y = MDˆ z
ˆ z
ˆ x = Dˆ z
lundi 12 novembre 12✓ sparsity in time-frequency dictionary
✓ find sparse coefficients such that
✦
(Orthonormal) Matching Pursuit (Mallat & Zhang 93) ✓ + ensure compatibility with clipping constraint
✦
Convex optimization ✓ estimate
Audio Speech and Language Proc., 2012
Audio Declipping
13 0.01 0.02 0.03 0.04 0.05 −0.5 0.5 time (s) Amplitude
x = Dz
y = MDˆ z
ˆ z
ˆ x = Dˆ z
Clipped
lundi 12 novembre 12✓ sparsity in time-frequency dictionary
✓ find sparse coefficients such that
✦
(Orthonormal) Matching Pursuit (Mallat & Zhang 93) ✓ + ensure compatibility with clipping constraint
✦
Convex optimization ✓ estimate
Audio Speech and Language Proc., 2012
Audio Declipping
13 0.01 0.02 0.03 0.04 0.05 −0.5 0.5 time (s) Amplitude
Declipped
x = Dz
y = MDˆ z
ˆ z
ˆ x = Dˆ z
Clipped
lundi 12 novembre 12✓ sparsity in time-frequency dictionary
✓ find sparse coefficients such that
✦
(Orthonormal) Matching Pursuit (Mallat & Zhang 93) ✓ + ensure compatibility with clipping constraint
✦
Convex optimization ✓ estimate
Audio Speech and Language Proc., 2012
Audio Declipping
13 0.01 0.02 0.03 0.04 0.05 −0.5 0.5 time (s) Amplitude
Declipped
x = Dz
y = MDˆ z
ˆ z
ˆ x = Dˆ z
Clipped Original
lundi 12 novembre 12Summary & next challenges
lundi 12 novembre 12Inverse problems ... and sparse models
15
Observation Domain
lundi 12 novembre 12Inverse problems ... and sparse models
16
Observation Domain
lundi 12 novembre 12Choosing a model
17
✓ Harmonic analysis / physics ✓ Evolution of species
✓ Dictionary learning ✓ Individual experience
✓ Blind Calibration & Deconvolution ✓ Adaptation to new environment
lundi 12 novembre 12Data Jungle
18
✓Hyperspectral
Satellite imaging
✓Spherical geometry
Cosmology, HRTF (3D audio)
✓Graphs
Social networks Brain connectivity
✓Vector valued
Diffusion tensor Key problem
Versatile low-dimensional models
lundi 12 novembre 12What’s next, please ?
✦
Signal processing
✦
Machine Learning
✦
Compressive acquisition and compressive learning
✦
Sparse models beyond dictionaries
✦
Inpainting / super-resolution (image/video/audio)
✦
Distributed video coding
✦
Astronomical imaging (interferometry)
✦
Low-dose biomedical imaging (CT & IRM)
✦
Audio recording @ high spatial resolution
✦
Low-power compressive-sensors
✦
Dynamic high-resolution brain imaging
✦
...
19
lundi 12 novembre 12✓ Alexis Benichoux, Anthony Bourrier, Srdjan Kitic,
Lei Yu, Cagdas Bilen, ...
22
23
lundi 12 novembre 12