Postdoc at Stanford Math. in the group TMSCSCS . This is my email: m e m o l i @ m a t h . s t a n f o r d . e d u
In the past, I've worked on applications of p-Harmonic Maps to Brain Warping. During my PhD thesis time I proposed looking at the plausible connection between \infty-Harmonic Maps and Lipschitz Extensions as a way of obtaining interpolating maps between two cortical surfaces. Here's a paper with these ideas.
During my masters I became aware of the fast marching method on triangulated surfaces as proposed by Sethian and Kimmel. I had been working with level set representation of surfaces so it seemed natural to look for a direct solution to the problem of estimating geodesic distances without having to triangulate the surface. This led to my master's thesis which is contained in this paper.
Later, my PhD advisor proposed me to try to extend my approach to deal with surfaces represented merely as point clouds. This was a very good idea and led me to having to generalize some ideas of the paper above. In particular, the conditions that guarantee convergence were probabilistic. You can find the paper right here.
I have also been working on Shape comparison. I am interested in applying ideas borrowed from Metric Geometry to this problem. Gromov's ideas about comparison of metric spaces have proved useful for formalizing several preexisting practical ideas in the field. In my PhD thesis I proposed using the Gromov-Hausdorff distance for approaching this problem, see this paper.
In this paper I introduced certain Lp Gromov-Hausdorff distances as an alternative to the standard notion. By doing this, I obtained a much more computationally tractable framework and at the same time, many other seemingly unrelated approaches to the problem of Shape Matching were proved to be lower or upper bounds to this new distance. In a follow paper up I study the problem of partial shape matching using these Lp distances, see below.
In the TMSCSCS group we deal with high dimensional datasets and we try to apply tools inspired in Algebraic Topology to the understanding of these datasets. Here's a paper with our work on applying these ideas to neuroscience data.
Currently teaching Math115
Shape Matching using Gromov-Hausdorff distances. CIS - UPenn, July 15th-2008.
Gromov-Hausdorff distances in Euclidean spaces. NORDIA-CVPR-2008 (Alaska).
Lp Gromov-Hausdorff distances for Shape Comparison. Hausdorff Center for Mathematics, University of Bonn. Workshop: "Geometry and Statistics of Shapes", June 2008.
Estimation Of Distance Functions And Geodesics And Its Use For Shape Comparison And Alignment: Theoretical And Computational Results
L^p Gromov-Hausdorff
distances for Partial Shape Matching. F. Memoli. [preprint].
Persistent Clustering and a Theorem of J. Kleinberg.
G. Carlsson and F. Memoli
Gromov-Hausdorff
distances in Euclidean spaces. F. Memoli. NORDIA-CVPR-2008. [BibTex]
Topological Analysis of Population Activity in Primary Visual
Cortex. G. Singh, F. Memoli, T. Ishkhanov, G. Carlsson,
G. Sapiro and D. Ringach. Jounal of Vision, Volume 8, Number 8, Article 11, Pages 1-18. [preprint
version is linked here, see the publisher's site for the journal version] [BibTex]
On
the Use of Gromov-Hausdorff Distances for Shape Comparison.
F. Memoli. Point Based Graphics 2007, Prague, September 2007. [BibTex]
A
theoretical and computational framework for isometry invariant
recognition of point cloud data. Facundo Memoli and Guillermo
Sapiro. Found. Comput. Math. 5 (2005), no. 3, 313--347. . [BibTex]
Comparing Point Clouds. Facundo Memoli and Guillermo
Sapiro. SGP 2004. . [BibTex]