Rocio Diaz Martin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Rocio Diaz Martin has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Ivan Medri
Dept. of Biomedical Engineering, University of Virginia, Charlottesville, VA 22904 USA
4 shared publications - Akram Aldroubi
Vanderbilt University
2 shared publications - Fernando Levstein
Universidad Nacional de Córdoba
2 shared publications A. Aldroubi
1 shared publication- Akram Aldroubi
Department of Mathematics, Vanderbilt University, Nashville, USA
1 shared publication - Alexander M. Powell1 shared publication
Latest Publications
- Open Access
- 13 November 2026
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 32 (6)
On Gabor Duals with Minimal L1-Norm
- 13 November 2026
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 32 (6)
Open AccessOn Gabor Duals with Minimal L1-Norm
- 17 August 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematics of Data Science
- Vol. 8 (3) , 887-919
Gromov–Wasserstein Barycenters: The Analysis Problem
This paper considers the problem of estimating a matrix that encodes pairwise distances in a finite metric space—or, more generally, the edge weight matrix of a network—under the barycentric coding model with respect to the Gromov–Wasserstein (GW) distance function. We frame this task as estimating the unknown barycentric coordinates with respect to the GW distance, assuming that the target matrix (or kernel) belongs to the set of GW barycenters of a finite collection of known templates. In the language of harmonic analysis, if computing GW barycenters can be viewed as a synthesis problem, this paper aims to solve the corresponding analysis problem. We propose two methods: one utilizing fixed-point iteration for computing GW barycenters, and another employing a differentiation-based approach to the GW structure using a blow-up technique. Finally, we demonstrate the application of the proposed GW analysis approach in a series of numerical experiments and applications to machine learning.
- 17 August 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematics of Data Science
- Vol. 8 (3) , 887-919
Gromov–Wasserstein Barycenters: The Analysis Problem
This paper considers the problem of estimating a matrix that encodes pairwise distances in a finite metric space—or, more generally, the edge weight matrix of a network—under the barycentric coding model with respect to the Gromov–Wasserstein (GW) distance function. We frame this task as estimating the unknown barycentric coordinates with respect to the GW distance, assuming that the target matrix (or kernel) belongs to the set of GW barycenters of a finite collection of known templates. In the language of harmonic analysis, if computing GW barycenters can be viewed as a synthesis problem, this paper aims to solve the corresponding analysis problem. We propose two methods: one utilizing fixed-point iteration for computing GW barycenters, and another employing a differentiation-based approach to the GW structure using a blow-up technique. Finally, we demonstrate the application of the proposed GW analysis approach in a series of numerical experiments and applications to machine learning.
- Open Access
Linear Optimal Partial Transport Embedding
Optimal transport (OT) has gained popularity due to its various applications in fields such as machine learning, statistics, and signal processing. However, the balanced mass requirement limits its performance in practical problems. To address these limitations, variants of the OT problem, including unbalanced OT, Optimal partial transport (OPT), and Hellinger Kantorovich (HK), have been proposed. In this paper, we propose the Linear optimal partial transport (LOPT) embedding, which extends the (local) linearization technique on OT and HK to the OPT problem. The proposed embedding allows for faster computation of OPT distance between pairs of positive measures. Besides our theoretical contributions, we demonstrate the LOPT embedding technique in point-cloud interpolation and PCA analysis.
Open AccessLinear Optimal Partial Transport Embedding
Optimal transport (OT) has gained popularity due to its various applications in fields such as machine learning, statistics, and signal processing. However, the balanced mass requirement limits its performance in practical problems. To address these limitations, variants of the OT problem, including unbalanced OT, Optimal partial transport (OPT), and Hellinger Kantorovich (HK), have been proposed. In this paper, we propose the Linear optimal partial transport (LOPT) embedding, which extends the (local) linearization technique on OT and HK to the OPT problem. The proposed embedding allows for faster computation of OPT distance between pairs of positive measures. Besides our theoretical contributions, we demonstrate the LOPT embedding technique in point-cloud interpolation and PCA analysis.
- Open Access
- 19 April 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 694, 148-185
Dynamical sampling for the recovery of spatially constant source terms in dynamical systems
- 19 April 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 694, 148-185
Open AccessDynamical sampling for the recovery of spatially constant source terms in dynamical systems
- Open Access
Characterization of frames for source recovery from dynamical samples
In this paper, we address the problem of recovering constant source terms in a discrete dynamical system represented by $x_{n+1} = Ax_n + w$, where $x_n$ is the $n$-th state in a Hilbert space $\mathcal{H}$, $A$ is a bounded linear operator in $\mathcal{B}(\mathcal{H})$, and $w$ is a source term within a closed subspace $W$ of $\HH$. Our focus is on the stable recovery of $w$ using time-space sample measurements formed by inner products with vectors from a Bessel system $\mathcal{G} \subset \mathcal{H}$. We establish the necessary and sufficient conditions for the recovery of $w$ from these measurements, independent of the unknown initial state $x_0$ and for any $w \in W$. This research is particularly relevant to applications such as environmental monitoring, where precise source identification is critical.Open AccessCharacterization of frames for source recovery from dynamical samples
In this paper, we address the problem of recovering constant source terms in a discrete dynamical system represented by $x_{n+1} = Ax_n + w$, where $x_n$ is the $n$-th state in a Hilbert space $\mathcal{H}$, $A$ is a bounded linear operator in $\mathcal{B}(\mathcal{H})$, and $w$ is a source term within a closed subspace $W$ of $\HH$. Our focus is on the stable recovery of $w$ using time-space sample measurements formed by inner products with vectors from a Bessel system $\mathcal{G} \subset \mathcal{H}$. We establish the necessary and sufficient conditions for the recovery of $w$ from these measurements, independent of the unknown initial state $x_0$ and for any $w \in W$. This research is particularly relevant to applications such as environmental monitoring, where precise source identification is critical. - Open Access
Dynamical Sampling for the Recovery of Spatially Constant Source Terms in Dynamical Systems
In this paper, we investigate the problem of source recovery in a dynamical system utilizing space-time samples. This is a specific issue within the broader field of dynamical sampling, which involves collecting samples from solutions to a differential equation across both space and time with the aim of recovering critical data, such as initial values, the sources, the driving operator, or other relevant details. Our focus in this study is the recovery of unknown, stationary sources across both space and time, leveraging space-time samples. This research may have significant applications; for instance, it could provide a model for strategically placing devices to measure the quantity of pollutants emanating from factory smokestacks and dispersing across a specific area. Space-time samples could be collected using measuring devices placed at various spatial locations and activated at different times. We present necessary and sufficient conditions for the positioning of these measuring devices to successfully resolve this dynamical sampling problem. This paper provides both a theoretical foundation for the recovery of sources in dynamical systems and potential practical applications.
Open AccessDynamical Sampling for the Recovery of Spatially Constant Source Terms in Dynamical Systems
In this paper, we investigate the problem of source recovery in a dynamical system utilizing space-time samples. This is a specific issue within the broader field of dynamical sampling, which involves collecting samples from solutions to a differential equation across both space and time with the aim of recovering critical data, such as initial values, the sources, the driving operator, or other relevant details. Our focus in this study is the recovery of unknown, stationary sources across both space and time, leveraging space-time samples. This research may have significant applications; for instance, it could provide a model for strategically placing devices to measure the quantity of pollutants emanating from factory smokestacks and dispersing across a specific area. Space-time samples could be collected using measuring devices placed at various spatial locations and activated at different times. We present necessary and sufficient conditions for the positioning of these measuring devices to successfully resolve this dynamical sampling problem. This paper provides both a theoretical foundation for the recovery of sources in dynamical systems and potential practical applications.
- Open Access
Mean Value Inequalities and Characterizations of Sobolev spaces on graded groups
We develop characterizations for Sobolev spaces of potential type on graded Lie groups, by means of Littlewood-Paley square functions, and Strichartz functionals involving second-order differences. A key role is played by some mean value inequalities that may be of independent interest. Indeed, the point-wise first-order inequality is generalized in two directions: on $L^p$-spaces and by considering second-order differences.
Open AccessMean Value Inequalities and Characterizations of Sobolev spaces on graded groups
We develop characterizations for Sobolev spaces of potential type on graded Lie groups, by means of Littlewood-Paley square functions, and Strichartz functionals involving second-order differences. A key role is played by some mean value inequalities that may be of independent interest. Indeed, the point-wise first-order inequality is generalized in two directions: on $L^p$-spaces and by considering second-order differences.
- 17 May 2023
- Published by Springer Nature in Sampling Theory, Signal Processing, and Data Analysis
- Vol. 21 (1) , 1-20
Error analysis on the initial state reconstruction problem
- 17 May 2023
- Published by Springer Nature in Sampling Theory, Signal Processing, and Data Analysis
- Vol. 21 (1) , 1-20
Error analysis on the initial state reconstruction problem
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Foundations of Data Science
- Vol. 4 (1) , 137-163
The Signed Cumulative Distribution Transform for 1-D signal analysis and classification
This paper presents a new mathematical signal transform that is especially suitable for decoding information related to non-rigid signal displacements. We provide a measure theoretic framework to extend the existing Cumulative Distribution Transform [29] to arbitrary (signed) signals on \begin{document}$ \overline {\mathbb{R}} $\end{document}. We present both forward (analysis) and inverse (synthesis) formulas for the transform, and describe several of its properties including translation, scaling, convexity, linear separability and others. Finally, we describe a metric in transform space, and demonstrate the application of the transform in classifying (detecting) signals under random displacements.- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Foundations of Data Science
- Vol. 4 (1) , 137-163
The Signed Cumulative Distribution Transform for 1-D signal analysis and classification
This paper presents a new mathematical signal transform that is especially suitable for decoding information related to non-rigid signal displacements. We provide a measure theoretic framework to extend the existing Cumulative Distribution Transform [29] to arbitrary (signed) signals on \begin{document}$ \overline {\mathbb{R}} $\end{document}. We present both forward (analysis) and inverse (synthesis) formulas for the transform, and describe several of its properties including translation, scaling, convexity, linear separability and others. Finally, we describe a metric in transform space, and demonstrate the application of the transform in classifying (detecting) signals under random displacements.- 4 November 2017
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 185 (4) , 621-649
Spherical analysis on homogeneous vector bundles of the 3-dimensional euclidean motion group
- 4 November 2017
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 185 (4) , 621-649
Spherical analysis on homogeneous vector bundles of the 3-dimensional euclidean motion group