Valentina De Simone

Prof. Valentina De Simone

University of Campania "Luigi Vanvitelli"

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
8 June 2019 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
SSStefania stefaniacorsaro
Stefania stefaniacorsaro
VSValentina De Simone
Valentina De Simone
ZMZelda Marino
Zelda Marino

20 September 2022 in ANNALI DELL'UNIVERSITA' DI FERRARA
Verified
Journal Article
Open access
PDF file
Laura AntonelliLaura Antonelli
Laura Antonelli
VSValentina De Simone
Valentina De Simone
DSDaniela di Serafino
Daniela di Serafino
Image segmentation is a central topic in image processing and computer vision and a key issue in many applications, e.g., in medical imaging, microscopy, document analysis and remote sensing. According to the human perception, image segmentation is the process of dividing an image into non-overlapping regions. These regions, which may correspond, e.g., to different objects, are fundamental for the correct interpretation and classification of the scene represented by the image. The division into regions is not unique, but it depends on the application, i.e., it must be driven by the final goal of the segmentation and hence by the most significant features with respect to that goal. Thus, image segmentation can be regarded as a strongly ill-posed problem. A classical approach to deal with ill posedness consists in incorporating in the model a-priori information about the solution, e.g., in the form of penalty terms. In this work we provide a brief overview of basic computational models for image segmentation, focusing on edge-based and region-based variational models, as well as on statistical and machine-learning approaches. We also sketch numerical methods that are applied in computing solutions to these models. In our opinion, our view can help the readers identify suitable classes of methods for solving their specific problems.

16 July 2019 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
SSStefania stefaniacorsaro
Stefania stefaniacorsaro
VSValentina De Simone
Valentina De Simone
ZMZelda Marino
Zelda Marino
Francesca PerlaFrancesca Perla
Francesca Perla

8 September 2020 in Algorithms
Verified
Journal Article
Open access
PDF file
Laura AntonelliLaura Antonelli
Laura Antonelli
VSValentina De Simone
Valentina De Simone
DSDaniela di Serafino
Daniela di Serafino
We present a total-variation-regularized image segmentation model that uses local regularization parameters to take into account spatial image information. We propose some techniques for defining those parameters, based on the cartoon-texture decomposition of the given image, on the mean and median filters, and on a thresholding technique, with the aim of preventing excessive regularization in piecewise-constant or smooth regions and preserving spatial features in nonsmooth regions. Our model is obtained by modifying a well-known image segmentation model that was developed by T. Chan, S. Esedoḡlu, and M. Nikolova. We solve the modified model by an alternating minimization method using split Bregman iterations. Numerical experiments show the effectiveness of our approach.

9 February 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
SSStefania stefaniacorsaro
Stefania stefaniacorsaro
VSValentina De Simone
Valentina De Simone
ZMZelda Marino
Zelda Marino
Salvatore ScognamiglioSalvatore Scognamiglio
Salvatore Scognamiglio
In this work, we investigate the application of Deep Learning in Portfolio selection in a Markowitz mean-variance framework. We refer to a l1 regularized multi-period model; the choice of the l1 norm aims at producing sparse solutions. A crucial issue is the choice of the regularization parameter, which must realize a trade-off between fidelity to data and regularization. We propose an algorithm based on neural networks for the automatic selection of the regularization parameter. Once the neural network training is completed, an estimate of the regularization parameter can be computed via forward propagation. Numerical experiments and comparisons performed on real data validate the approach.

25 May 2023 in Algorithms
Verified
Journal Article
Open access
PDF file
SCSerena Crisci
Serena Crisci
VSValentina De Simone
Valentina De Simone
MVMarco Viola
Marco Viola
Many data analysis problems can be modeled as a constrained optimization problem characterized by nonsmooth functionals, often because of the presence of ℓ1-regularization terms. One of the most effective ways to solve such problems is through the Alternate Direction Method of Multipliers (ADMM), which has been proved to have good theoretical convergence properties even if the arising subproblems are solved inexactly. Nevertheless, experience shows that the choice of the parameter τ penalizing the constraint violation in the Augmented Lagrangian underlying ADMM affects the method’s performance. To this end, strategies for the adaptive selection of such parameter have been analyzed in the literature and are still of great interest. In this paper, starting from an adaptive spectral strategy recently proposed in the literature, we investigate the use of different strategies based on Barzilai–Borwein-like stepsize rules. We test the effectiveness of the proposed strategies in the solution of real-life consensus logistic regression and portfolio optimization problems.