Ivan Gerace

Dr. Ivan Gerace

orcid

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 April 2017 in Journal of Mathematical Imaging and Vision
Verified
Journal Article
Closed access
PDF file
ABAntonio Boccuto
Antonio Boccuto
IGIvan Gerace
Ivan Gerace
FMFrancesca Martinelli
Francesca Martinelli

29 December 2016
Verified
Conference Paper
Closed access
ABAntonio Boccuto
Antonio Boccuto
IGIvan Gerace
Ivan Gerace
We consider the problem of restoration of images corrupted by blur and noise. We find the minimum of the primal energy function, which has two terms. The former is related to faith fulness to the data and the latter is associated with smoothness constraints. In general, we have to estimate the discontinuities of the ideal image. We require that the obtained images are piecewise continuous and with thin edges. We associate with the primal energy function a dual energy function, which treats discontinuities implicitly. In order to have thin edges, we determine a dual energy function, which is convex and takes into account non-parallelism constraints. The proposed dual energy can be used as initial function in a GNC (Graduated Non-Convexity)-type algorithm, to obtain reconstructed images with Boolean discontinuities. In the experimental re­sults, we show that the parallel lines are inhibited.

1 October 1995 in Pattern Recognition Letters
Verified
Journal Article
Closed access
LBL. Bedini
L. Bedini
IGIvan Gerace
Ivan Gerace
Anna TonazziniAnna Tonazzini
Anna Tonazzini

29 January 2019 in The Open Signal Processing Journal
Verified
Journal Article
Open access
PDF file
ABAntonio Boccuto
Antonio Boccuto
IGIvan Gerace
Ivan Gerace
VGValentina Giorgetti
Valentina Giorgetti
MRMatteo Rinaldi
Matteo Rinaldi
Introduction: In this paper, we deal with the demosaicing problem when the Bayer pattern is used. We propose a fast heuristic algorithm, consisting of three parts. Methods: In the first one, we initialize the green channel by means of an edge-directed and weighted average technique. In the second part, the red and blue channels are updated, thanks to an equality constraint on the second derivatives. The third part consists of a constant-hue-based interpolation. Results: We show experimentally how the proposed algorithm gives in mean better reconstructions than more computationally expensive algorithms.

15 July 2022
Verified
Book Chapter
Closed access
PDF file
ABAntonio Boccuto
Antonio Boccuto
IGIvan Gerace
Ivan Gerace
VGValentina Giorgetti
Valentina Giorgetti
GVGabriele Valenti
Gabriele Valenti

9 May 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
ABAntonio Boccuto
Antonio Boccuto
IGIvan Gerace
Ivan Gerace
VGValentina Giorgetti
Valentina Giorgetti
This paper focuses on reducing the computational cost of a GNC Algorithm for deblurring images when dealing with full symmetric Toeplitz block matrices composed of Toeplitz blocks. Such a case is widespread in real cases when the PSF has a vast range. The analysis in this paper centers around the class of gamma matrices, which can perform vector multiplications quickly. The paper presents a theoretical and experimental analysis of how γ-matrices can accurately approximate symmetric Toeplitz matrices. The proposed approach involves adding a minimization step for a new approximation of the energy function to the GNC technique. Specifically, we replace the Toeplitz matrices found in the blocks of the blur operator with γ-matrices in this approximation. The experimental results demonstrate that the new GNC algorithm proposed in this paper reduces computation time by over 20% compared with its previous version. The image reconstruction quality, however, remains unchanged.