This paper investigates experimental means of measuring the transmission matrix (TM) of a highly scattering medium, with the simplest optical setup. Spatial light modulation is performed by a digital micromirror device (DMD), allowing high rates and high pixel counts but only binary amplitude modulation. On the sensor side, without a reference beam, the CCD camera provides only intensity measurements. Within this framework, this paper shows that the TM can still be retrieved, through signal processing techniques of phase retrieval. This is experimentally validated on three criteria : quality of prediction, distribution of singular values, and quality of focusing.

Random projections have proven extremely useful in many signal processing and machine learning applications. However, they often require either to store a very large random matrix, or to use a different, structured matrix to reduce the computational and memory costs. Here, we overcome this difficulty by proposing an analog, optical device, that performs the random projections literally at the speed of light without having to store any matrix in memory. This is achieved using the physical properties of multiple coherent scattering of coherent light in random media. We use this device on a simple task of classification with a kernel machine, and we show that, on the MNIST database, the experimental results closely match the theoretical performance of the corresponding kernel. This framework can help make kernel methods practical for applications that have large training sets and/or require real-time prediction. We discuss possible extensions of the method in terms of a class of kernels, speed, memory consumption and different problems.

To cite this version:Angélique Drémeau, Cédric Herzet, Laurent Daudet. Boltzmann machine and mean-field approximation for structured sparse decompositions. Accepté à IEEE Trans. On Signal Processing. 2012. AbstractTaking advantage of the structures inherent in many sparse decompositions constitutes a promising research axis. In this paper, we address this problem from a Bayesian point of view. We exploit a Boltzmann machine, allowing to take a large variety of structures into account, and focus on the resolution of a marginalized maximum a posteriori problem. To solve this problem, we resort to a mean-field approximation and the "variational Bayes Expectation-Maximization" algorithm. This approach results in a soft procedure making no hard decision on the support or the values of the sparse representation. We show that this characteristic leads to an improvement of the performance over state-of-the-art algorithms. Index TermsStructured sparse representation, Bernoulli-Gaussian model, Boltzmann machine, mean-field approximation.

In this paper, we consider the phase recovery problem, where a complex signal vector has to be estimated from the knowledge of the modulus of its linear projections, from a naive variational Bayesian point of view. In particular, we derive an iterative algorithm following the minimization of the Kullback-Leibler divergence under the mean-field assumption, and show on synthetic data with random projections that this approach leads to an efficient and robust procedure, with a reasonable computational cost.

Approximate Message Passing (AMP) has been shown to be an excellent statistical approach to signal inference and compressed sensing problem. The AMP framework provides modularity in the choice of signal prior; here we propose a hierarchical form of the Gauss-Bernouilli prior which utilizes a Restricted Boltzmann Machine (RBM) trained on the signal support to push reconstruction performance beyond that of simple i.i.d. priors for signals whose support can be well represented by a trained binary RBM. We present and analyze two methods of RBM factorization and demonstrate how these affect signal reconstruction performance within our proposed algorithm. Finally, using the MNIST handwritten digit dataset, we show experimentally that using an RBM allows AMP to approach oracle-support performance.

We propose extended coherence-based conditions for exact sparse support recovery using orthogonal matching pursuit (OMP) and orthogonal least squares (OLS). Unlike standard uniform guarantees, we embed some information about the decay of the sparse vector coefficients in our conditions. As a result, the standard condition µ < 1/(2k − 1) (where µ denotes the mutual coherence and k the sparsity level) can be weakened as soon as the nonzero coefficients obey some decay, both in the noiseless and the bounded-noise scenarios. Furthermore, the resulting condition is approaching µ < 1/k for strongly decaying sparse signals. Finally, in the noiseless setting, we prove that the proposed conditions, in particular the bound µ < 1/k, are the tightest achievable guarantees based on mutual coherence.

No abstract

International audienceIn underwater acoustics, shallow-water environments act as modal dispersive waveguides when considering low-frequency sources, and propagation can be described by modal theory. In this context, propagated signals are composed of few modal components, each of them propagating according to its own wavenumber. Frequency-wavenumber (f−k) representations are classical methods allowing modal separation. However, they require large horizontal line sensor arrays aligned with the source. In this paper, to reduce the number of sensors, a sparse model is proposed and combined with prior knowledge on the wavenumber physics. The method resorts to a state-of-the-art Bayesian algorithm exploiting a Bernoulli–Gaussian model. The latter, well suited to the sparse representations, makes possible a natural integration of prior information through a wise choice of the Bernoulli parameters. The performance of the method is quantified on simulated data and finally assessed through a successful application on real data