Sparse representations in a nutshell in summary: Sparse representations resulting from these processes have been successfully applied in various domains such as image processing, computer vision, and audio signal processing. It has shown promise in tasks such as noise reduction, compression, feature extraction, and pattern recognition. By capturing the essential structure and characteristics of the data in a sparse representation, sparse coding can help reduce redundancy and noise, and extract meaningful features for further analysis or processing.
…let’s delve into a computational theory of sparse coding review_bib = s.content_bib(“LP”, “2015”, ‘“Sparse models” in Biologically Inspired Computer Vision ’)
Sparse representations in a nutshell Generative model of image synthesis:
$I[x, y] = $
$\sum_{i=1}^{K} a[i] \cdot \phi[i, x, y]$
$ + \varepsilon[x, y]$
Where $\phi$ is a dictionary of $K$ atoms, $a$ is a sparse vector of coefficients, and $\varepsilon$ is a noise term.
[LP (2015) ]
Sparse representations in a nutshell Given an observation $I$,
$$
\begin{aligned}
\mathcal{L}(a) & = - \log Pr( a | I ) \\
\end{aligned}
$$
Sparse representations in a nutshell Given an observation $I$,
$$
\begin{aligned}
\mathcal{L}(a) & = - \log Pr( a | I ) \\
& = - \log Pr( I | a ) - \log Pr(a) \\
\end{aligned}
$$
Sparse representations in a nutshell Given an observation $I$,
$$
\begin{aligned}
\mathcal{L}(a) & = - \log Pr( a | I ) \\
& = - \log Pr( I | a ) - \log Pr(a) \\
& = \frac{1}{2\sigma_n^2} \sum_{x, y} ( I[x, y] - \sum_{i=1}^{K} a[i] \cdot \phi[i, x, y])^2 - \sum_{i=1}^{K} \log Pr( a[i] )
\end{aligned}
$$
Sparse representations in a nutshell The problem is formalized as an optimization problem $a^\ast = \arg \min_a \mathcal{L}(a)$ with:
$$
\mathcal{L} = \frac{1}{2} \sum_{x, y} ( I[x, y] - \sum_{i=1}^{K} a[i] \cdot \phi[i, x, y])^2 + \lambda \cdot \sum_i ( a[i] \neq 0)
$$
[LP (2015) ]
spiking prior => l0 pseudo norm
l0 problem is NP-complete Sparse representations in a nutshell The problem is formalized as an optimization problem $a^\ast = \arg \min_a \mathcal{L}(a)$ with:
$$
\mathcal{L}(a) = \frac{1}{2} \sum_{x, y} ( I[x, y] - \sum_{i=1}^{K} a[i] \cdot \phi[i, x, y])^2 + \lambda \cdot \sum_{i=1}^{K} | a[i] |
$$exponential prior => L1 norm
---Sparse representations and learning
Convolutional Sparse Coding [Boutin et al , 2021 ] novel challenges for CNNs 1/ backpropagation is not bioplausible Convolutional Sparse Coding [Boutin et al , 2021 ] novel challenges for CNNs 1/ backpropagation is not bioplausible CNN: Predictive processing [Boutin et al , 2021 ] modifications= adding sparse coding + feedback CNN: Predictive processing [Boutin et al , 2021 ] modifications= adding sparse coding + feedback CNN: Predictive processing
result= interpretable features SNN in neuromorphic engineering The HD-SNN neural network. 2 MINUTE
For instance, we show how precise spike times may be used to detect the direction of motion from such a stream of events in an ultrafast fashion. SNN in neuromorphic engineering
2 MINUTE
For instance, we show how precise spike times may be used to detect the direction of motion from such a stream of events in an ultrafast fashion.
SNN in neuromorphic engineering The HD-SNN neural network. SNN in neuromorphic engineering The HD-SNN neural network. [2026-01-29] Contact me @ laurent.perrinet@univ-amu.fr
to summarize= sparse representations help understand neuroscience biological vision they have practical applications in machine learning let’s sparse!