Ronaldo Malheiros Gregório

Ronaldo Malheiros Gregório

Auto-generated profile, based on publicly available information

Ronaldo Malheiros Gregório

PPGMMC, ICE/UFRRJ, Seropédica, Brazil

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
1 April 2010 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
RGRonaldo Gregório
Ronaldo Gregório
POPaulo Roberto Oliveira
Paulo Roberto Oliveira

1 July 2023 in RAIRO - Operations Research
Verified
Journal Article
Open access
PDF file
EQErik Alex Papa Quiroz
Erik Alex Papa Quiroz
RRRogério Azevedo Rocha
Rogério Azevedo Rocha
POPaulo Oliveira
Paulo Oliveira
RGRonaldo Gregório
Ronaldo Gregório
We introduce a proximal algorithm using quasidistances for multiobjective minimization problems with quasiconvex functions defined in arbitrary Riemannian manifolds. The reason of using quasidistances instead of the classical Riemannian distance comes from the applications in economy, computer science and behavioral sciences, where the quasidistances represent a non symmetric measure. Under some appropriate assumptions on the problem and using tools of Riemannian geometry we prove that accumulation points of the sequence generated by the algorithm satisfy the critical condition of Pareto-Clarke. If the functions are convex then these points are Pareto efficient solutions.

1 February 2021 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
CACharlan Dellon da Silva Alves
Charlan Dellon da Silva Alves
POPaulo Roberto Oliveira
Paulo Roberto Oliveira
RGRonaldo Malheiros Gregório
Ronaldo Malheiros Gregório

11 October 2018 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
RGR.M. Gregório
R.M. Gregório
POP.R. Oliveira
P.R. Oliveira
CAC.D.S. Alves
C.D.S. Alves

1 January 2016 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
RRRogério Azevedo Rocha
Rogério Azevedo Rocha
POPaulo Roberto Oliveira
Paulo Roberto Oliveira
RGRonaldo Malheiros Gregório
Ronaldo Malheiros Gregório
MSMichael Souza
Michael Souza

5 August 2022 in Research Square
Verified
Preprint
Open access
PDF file
ACAlan Santos Campos
Alan Santos Campos
RGRonaldo Malheiros Gregorio
Ronaldo Malheiros Gregorio
MCMarcelo Dib Cruz
Marcelo Dib Cruz
CACharlan Dellon da Silva Alves
Charlan Dellon da Silva Alves
The diffusion tensor magnetic resonance imaging (DT-MRI) is a non-invasive and effective technique that ables us to study the micro-structural integrity of white matter of fibers and detecting tumors or anomalies in living tissues. Image segmentation in DT-RMI is used to identify and separate a tissue in different regions which preserve similar properties. \(K\) -means and deep learning algorithms can be applied for this purpose, being the second class the most used currently. Despite actually deep learning algorithms are the most frequently approach in image segmentation, $K$-means algorithm performed an important role in a recent past, carrying implicitly lots of sophisticated mathematical results. Originally, $K$-means algorithm was proposed to cluster a dataset in subsets with similar characteristics. Our interesting consists in empirically analyzing this technique and their variants under both Euclidean and Riemannian setting when applied to image segmentation in DT-MRI. Pixels in the bidimensional case and voxels in the tridimensional one can be respectively represented by 2-by-2 and 3-by-3 symmetric positive definite matrices (SPD) in DT-RMI. Since the set of \(n\) -by-$n$ SPD matrices can be seen as both a non-pointed convex cone in the vector space of $n$-by-$n$ symmetric matrices as well as a Hadamard manifold, centroids are well-posed in both sense, for any positive integer $n$. Thus, we developed a comparative study on the influence of centroids under Euclidean and Riemannian settings on the image segmentation by using the $K$-means algorithm and its variants.