no code implementations • 22 Mar 2024 • Yuxin Zhang, Clément Huneau, Jérôme Idier, Diana Mateus
Despite today's prevalence of ultrasound imaging in medicine, ultrasound signal-to-noise ratio is still affected by several sources of noise and artefacts.
no code implementations • 31 Oct 2023 • Yuxin Zhang, Clément Huneau, Jérôme Idier, Diana Mateus
Bringing the best from both worlds, we propose a hybrid approach leveraging advances in diffusion models.
1 code implementation • 29 Jul 2023 • Yuxin Zhang, Clément Huneau, Jérôme Idier, Diana Mateus
Ultrasound image reconstruction can be approximately cast as a linear inverse problem that has traditionally been solved with penalized optimization using the $l_1$ or $l_2$ norm, or wavelet-based terms.
no code implementations • 11 Feb 2021 • Mehdi Chahine Amrouche, Hervé Carfantan, Jérôme Idier
In this paper the problem of restoration of non-negative sparse signals is addressed in the Bayesian framework.
no code implementations • 11 Feb 2021 • Ramzi Ben Mhenni, Sébastien Bourguignon, Jérôme Idier
In this paper, we propose a new greedy algorithm for sparse approximation, called SLS for Single L_1 Selection.
no code implementations • 11 Dec 2020 • Maël Millardet, Saïd Moussaoui, Diana Mateus, Jérôme Idier, Thomas Carlier
Our idea is to transfer the negative intensities to neighboring voxels, so that the mean of the image is preserved.
no code implementations • 30 Oct 2020 • Valentin Leplat, Nicolas Gillis, Jérôme Idier
In this paper, we introduce a general framework to design multiplicative updates (MU) for NMF based on $\beta$-divergences ($\beta$-NMF) with disjoint equality constraints, and with penalty terms in the objective function.
no code implementations • 31 Jan 2014 • Charles Soussen, Jérôme Idier, Junbo Duan, David Brie
Among the many efficient $\ell_1$ solvers, the homotopy algorithm minimizes $\|y-Ax\|_2^2+\lambda\|x\|_1$ with respect to x for a continuum of $\lambda$'s.
1 code implementation • 8 Oct 2010 • Cédric Févotte, Jérôme Idier
The paper also describes how the proposed algorithms can be adapted to two common variants of NMF : penalized NMF (i. e., when a penalty function of the factors is added to the criterion function) and convex-NMF (when the dictionary is assumed to belong to a known subspace).