Image priors are of great importance in image restoration tasks. These problems can be addressed by decomposing the degraded image into overlapping patches, treating the patches individually and averaging them back together. Recently, the Expected Patch Log Likelihood (EPLL) method has been introduced, arguing that the chosen model should be enforced on the… (More)
Contribution We present a patch-based denoising algorithm relying on a sparsity-inspired model (K-SVD) within multi-scale analysis framework, that overcomes some of the disadvantages of the popular algorithms. Our method is competitive with state of the art methods in terms of PSNR while giving superior results with respect to visual quality.
—The celebrated sparse representation model has led to remarkable results in various signal processing tasks in the last decade. However, despite its initial purpose of serving as a global prior for entire signals, it has been commonly used for modeling low dimensional patches due to the computational constraints it entails when deployed with learned… (More)
—The convolutional sparse model has recently gained increasing attention in the signal and image processing communities , and several methods have been proposed for solving the pursuit problem emerging from it – in particular its convex relaxation, Basis Pursuit. In the first of this two-part work, we have provided a theoretical backbone for this model,… (More)
In ultrasound, second harmonic imaging is usually preferred due to the higher clutter artifacts and speckle noise common in the first harmonic image. Typical ultrasound use either one or the other image, applying corresponding filters for each case. In this work we propose a method based on a joint sparsity model that fuses the first and second harmonic… (More)
—Sparse representations has shown to be a very powerful model for real world signals, and has enabled the development of applications with notable performance. Combined with the ability to learn a dictionary from signal examples, sparsity-inspired algorithms are often achieving state-of-the-art results in a wide variety of tasks. Yet, these methods have… (More)