arXiv subjects

Luca Calatroni

Publications and source records attributed to Luca Calatroni.

At least 55 records · Page 3Linked to original sources

arXiv2020

Non-convex Super-resolution of OCT images via sparse representation

We propose a non-convex variational model for the super-resolution of Optical Coherence Tomography (OCT) images of the murine eye, by enforcing sparsity with respect to suitable dictionaries learnt from high-resolution OCT data. The statistical characteristics of OCT images motivate the use of α-stable distributions for learning dictionaries, by considering the non-Gaussian case, α=1. The sparsity-promoting cost function relies on a non-convex penalty - Cauchy-based or Minimax Concave Penalty (MCP) - which makes the problem particularly challenging. We propose an efficient algorithm for minimizing the function based on the forward-backward splitting strategy which guarantees at each iteration the existence and uniqueness of the proximal point. Comparisons with standard convex L1-based reconstructions show the better performance of non-convex models, especially in view of further OCT image analysis

eess.IV↗

arXiv2020

Cortical-inspired Wilson-Cowan-type equations for orientation-dependent contrast perception modelling

We consider the evolution model proposed in [9, 6] to describe illusory contrast perception phenomena induced by surrounding orientations. Firstly, we highlight its analogies and differences with the widely used Wilson-Cowan equations [48], mainly in terms of efficient representation properties. Then, in order to explicitly encode local directional information, we exploit the model of the primary visual cortex (V1) proposed in [20] and largely used over the last years for several image processing problems [24,38,28]. The resulting model is thus defined in the space of positions and orientation and it is capable to describe assimilation and contrast visual bias at the same time. We report several numerical tests showing the ability of the model to reproduce, in particular, orientation-dependent phenomena such as grating induction and a modified version of the Poggendorff illusion. For this latter example, we empirically show the existence of a set of threshold parameters differentiating from inpainting to perception-type reconstructions and describing long-range connectivity between different hypercolumns in V1.

cs.CV↗

arXiv2020

Variational Osmosis for Non-linear Image Fusion

We propose a new variational model for non-linear image fusion. Our approach is based on the use of an osmosis energy term related to the one studied in Vogel et al. (2013) and Weickert et al. (2013) The minimization of the proposed non-convex energy realizes visually plausible image data fusion, invariant to multiplicative brightness changes. On the practical side, it requires minimal supervision and parameter tuning and can encode prior information on the structure of the images to be fused. For the numerical solution of the proposed model, we develop a primal-dual algorithm and we apply the resulting minimization scheme to solve multi-modal face fusion, color transfer and cultural heritage conservation problems. Visual and quantitative comparisons to state-of-the-art approaches prove the out-performance and the flexibility of our method.

cs.CV↗

arXiv2019

Visual illusions via neural dynamics: Wilson-Cowan-type models and the efficient representation principle

In this work we have aimed to reproduce supra-threshold perception phenomena, specifically visual illusions, with Wilson-Cowan-type models of neuronal dynamics. We have found that it is indeed possible to do so, but that the ability to replicate visual illusions is related to how well the neural activity equations comply with the efficient representation principle. Our first contribution is to show that the Wilson-Cowan equations can reproduce a number of brightness and orientation-dependent illusions, and that the latter type of illusions require that the neuronal dynamics equations consider explicitly the orientation, as expected. Then, we formally prove that there can't be an energy functional that the Wilson-Cowan equations are minimizing, but that a slight modification makes them variational and yields a model that is consistent with the efficient representation principle. Finally, we show that this new model provides a better reproduction of visual illusions than the original Wilson-Cowan formulation.

q-bio.NC↗

arXiv2019

Accelerated iterative regularization via dual diagonal descent

We propose and analyze an accelerated iterative dual diagonal descent algorithm for the solution of linear inverse problems with general regularization and data-fit functions. In particular, we develop an inertial approach of which we analyze both convergence and stability. Using tools from inexact proximal calculus, we prove early stopping results with optimal convergence rates for additive data-fit terms as well as more general cases, such as the Kullback-Leibler divergence, for which different type of proximal point approximations hold.

math.OC↗

arXiv2019

Space-adaptive anisotropic bivariate Laplacian regularization for image restoration

In this paper we present a new regularization term for variational image restoration which can be regarded as a space-variant anisotropic extension of the classical isotropic Total Variation (TV) regularizer. The proposed regularizer comes from the statistical assumption that the gradients of the target image distribute locally according to space-variant bivariate Laplacian distributions. The highly flexible variational structure of the corresponding regularizer encodes several free parameters which hold the potential for faithfully modelling the local geometry in the image and describing local orientation preferences. For an automatic estimation of such parameters, we design a robust maximum likelihood approach and report results on its reliability on synthetic data and natural images. A minimization algorithm based on the Alternating Direction Method of Multipliers (ADMM) is presented for the efficient numerical solution of the proposed variational model. Some experimental results are reported which demonstrate the high-quality of restorations achievable by the proposed model, in particular with respect to classical Total Variation regularization.

eess.IV↗

arXiv2019

Adaptive parameter selection for weighted-TV image reconstruction problems

We propose an efficient estimation technique for the automatic selection of locally-adaptive Total Variation regularisation parameters based on an hybrid strategy which combines a local maximum-likelihood approach estimating space-variant image scales with a global discrepancy principle related to noise statistics. We verify the effectiveness of the proposed approach solving some exemplar image reconstruction problems and show its outperformance in comparison to state-of-the-art parameter estimation strategies, the former weighting locally the fit with the data (Dong et al. '11), the latter relying on a bilevel learning paradigm (Hintermüller et al., '17)

math.OC↗

arXiv2019

A flexible space-variant anisotropic regularisation for image restoration with automated parameter selection

We propose a new space-variant anisotropic regularisation term for variational image restoration, based on the statistical assumption that the gradients of the target image distribute locally according to a bivariate generalised Gaussian distribution. The highly flexible variational structure of the corresponding regulariser encodes several free parameters which hold the potential for faithfully modelling the local geometry in the image and describing local orientation preferences. For an automatic estimation of such parameters, we design a robust maximum likelihood approach and report results on its reliability on synthetic data and natural images. For the numerical solution of the corresponding image restoration model, we use an iterative algorithm based on the Alternating Direction Method of Multipliers (ADMM). A suitable preliminary variable splitting together with a novel result in multivariate non-convex proximal calculus yield a very efficient minimisation algorithm. Several numerical results showing significant quality-improvement of the proposed model with respect to some related state-of-the-art competitors are reported, in particular in terms of texture and detail preservation.

math.NA↗

arXiv2019

Backtracking strategies for accelerated descent methods with smooth composite objectives

We present and analyse a backtracking strategy for a general Fast Iterative Shrinkage/Thresholding Algorithm which has been recently proposed in (Chambolle, Pock, 2016) for strongly convex objective functions. Differently from classical Armijo-type line searching, our backtracking rule allows for local increasing and decreasing of the descent step size (i.e. proximal parameter) along the iterations. For such strategy accelerated convergence rates are proved and numerical results are shown for some exemplar imaging problems.

math.OC↗

arXiv2018

A cortical-inspired model for orientation-dependent contrast perception: a link with Wilson-Cowan equations

We consider a differential model describing neuro-physiological contrast perception phenomena induced by surrounding orientations. The mathematical formulation relies on a cortical-inspired modelling [10] largely used over the last years to describe neuron interactions in the primary visual cortex (V1) and applied to several image processing problems [12,19,13]. Our model connects to Wilson-Cowan-type equations [23] and it is analogous to the one used in [3,2,14] to describe assimilation and contrast phenomena, the main novelty being its explicit dependence on local image orientation. To confirm the validity of the model, we report some numerical tests showing its ability to explain orientation-dependent phenomena (such as grating induction) and geometric-optical illusions [21,16] classically explained only by filtering-based techniques [6,18].

cs.CV↗

arXiv2018

Analysis and optimisation of a variational model for mixed Gaussian and Salt & Pepper noise removal

We analyse a variational regularisation problem for mixed noise removal that was recently proposed in [14]. The data discrepancy term of the model combines $L^1$ and $L^2$ terms in an infimal convolution fashion and it is appropriate for the joint removal of Gaussian and Salt & Pepper noise. In this work we perform a finer analysis of the model which emphasises on the balancing effect of the two parameters appearing in the discrepancy term. Namely, we study the asymptotic behaviour of the model for large and small values of these parameters and we compare it to the corresponding variational models with $L^1$ and $L^2$ data fidelity. Furthermore, we compute exact solutions for simple data functions taking the total variation as regulariser. Using these theoretical results, we then analytically study a bilevel optimisation strategy for automatically selecting the parameters of the model by means of a training set. Finally, we report some numerical results on the selection of the optimal noise model via such strategy which confirm the validity of our analysis and the use of popular data models in the case of "blind" model selection.

math.OC↗

arXiv2018

Anisotropic osmosis filtering for shadow removal in images

We present an anisotropic extension of the isotropic osmosis model that has been introduced by Weickert et al.~(Weickert, 2013) for visual computing applications, and we adapt it specifically to shadow removal applications. We show that in the integrable setting, linear anisotropic osmosis minimises an energy that involves a suitable quadratic form which models local directional structures. In our shadow removal applications we estimate the local structure via a modified tensor voting approach (Moreno, 2012) and use this information within an anisotropic diffusion inpainting that resembles edge-enhancing anisotropic diffusion inpainting (Weickert, 2006, Galić, 2008). Our numerical scheme combines the nonnegativity preserving stencil of Fehrenbach and Mirebeau (Fehrenbach, 2014) with an exact time stepping based on highly accurate polynomial approximations of the matrix exponential. The resulting anisotropic model is tested on several synthetic and natural images corrupted by constant shadows. We show that it outperforms isotropic osmosis, since it does not suffer from blurring artefacts at the shadow boundaries.

math.AP↗

arXiv2018

Digital Cultural Heritage imaging via osmosis filtering

In Cultural Heritage (CH) imaging, data acquired within different spectral regions are often used to inspect surface and sub-surface features. Due to the experimental setup, these images may suffer from intensity inhomogeneities, which may prevent conservators from distinguishing the physical properties of the object under restoration. Furthermore, in multi-modal imaging, the transfer of information between one modality to another is often used to integrate image contents. In this paper, we apply the image osmosis model proposed in (Weickert et al. 2013) to solve similar problems arising when using diagnostic CH imaging techniques based on reflectance, emission and fluorescence mode in the optical and thermal range. For an efficient computation, we use stable operator splitting techniques. We test our methods on real artwork datasets: the thermal measurements of the mural painting "Monocromo" by Leonardo Da Vinci, the UV-VIS-IR imaging of an ancient Russian icon and the Archimedes Palimpsest dataset.

math.NA↗

arXiv2018

Unveiling the invisible - mathematical methods for restoring and interpreting illuminated manuscripts

The last fifty years have seen an impressive development of mathematical methods for the analysis and processing of digital images, mostly in the context of photography, biomedical imaging and various forms of engineering. The arts have been mostly overlooked in this process, apart from a few exceptional works in the last ten years. With the rapid emergence of digitisation in the arts, however, the arts domain is becoming increasingly receptive to digital image processing methods and the importance of paying attention to this therefore increases. In this paper we discuss a range of mathematical methods for digital image restoration and digital visualisation for illuminated manuscripts. The latter provide an interesting opportunity for digital manipulation because they traditionally remain physically untouched. At the same time they also serve as an example for the possibilities mathematics and digital restoration offer as a generic and objective toolkit for the arts.

cs.CV↗

arXiv2017

Alternating Direction Implicit (ADI) schemes for a PDE-based image osmosis model

We consider \emph{Alternating Direction Implicit} (ADI) splitting schemes to compute efficiently the numerical solution of the PDE osmosis model considered by Weickert et al. for several imaging applications. The discretised scheme is shown to preserve analogous properties to the continuous model. The dimensional splitting strategy traduces numerically into the solution of simple tridiagonal systems for which standard matrix factorisation techniques can be used to improve upon the performance of classical implicit methods, even for large time steps. Applications to the shadow removal problem are presented.

math.NA↗

arXiv2017

Efficient Osmosis Filtering of Thermal-Quasi Reflectography Images for Cultural Heritage

In Cultural Heritage, non-invasive infrared imaging techniques are used to analyse portions of deep structures behind wall paintings. When mosaicked, these images usually suffer from light inhomogeneities due to the experimental setup, which may prevent restorers from distinguishing the physical properties of the object under restoration. A light-balanced image is therefore essential for inter-frame comparisons, while preserving intra-frames details. In this paper we apply the image osmosis model proposed in (Weickert, 2013) to solve the light balance problem in Thermal-Quasi Reflectography (TQR) imaging. Due to the large amount of image data, the computation of the numerical solution of the model may be prohibitively costly. To overcome this issue, we make use of efficient operator splitting techniques. We test the proposed numerical schemes on the TQR measurement dataset of the mural painting "Monocromo" by Leonardo Da Vinci at Castello Sforzesco (Milan, Italy). The light corrected result is registered to a visible orthophoto, which makes it re-usable for further restorations.

math.NA↗

arXiv2016

Infimal convolution of data discrepancies for mixed noise removal

We consider the problem of image denoising in the presence of noise whose statistical properties are a combination of two different distributions. We focus on noise distributions that are frequently considered in applications, in particular mixtures of salt & pepper and Gaussian noise, and Gaussian and Poisson noise. We derive a variational image denoising model that features a total variation regularisation term and a data discrepancy that features the mixed noise as an infimal convolution of discrepancy terms of the single-noise distributions. We give a statistical derivation of this model by joint Maximum A-Posteriori (MAP) estimation, and discuss in particular its interpretation as the MAP of a so-called infinity convolution of two noise distributions. Moreover, classical single-noise models are recovered asymptotically as the weighting parameters go to infinity. The numerical solution of the model is computed using second order Newton-type methods. Numerical results show the decomposition of the noise into its constituting components. The paper is furnished with several numerical experiments and comparisons with other existing methods dealing with the mixed noise case are shown.

math.OC↗

arXiv2016

Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images

We consider the problem of scale detection in images where a region of interest is present together with a measurement tool (e.g. a ruler). For the segmentation part, we focus on the graph based method by Flenner and Bertozzi which reinterprets classical continuous Ginzburg-Landau minimisation models in a totally discrete framework. To overcome the numerical difficulties due to the large size of the images considered we use matrix completion and splitting techniques. The scale on the measurement tool is detected via a Hough transform based algorithm. The method is then applied to some measurement tasks arising in real-world applications such as zoology, medicine and archaeology.

math.AP↗