Computing Minimum Area Homologies

Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles. The minimum area homology exists for broader classes of cycles than previous measures which are based on homotopy. It is also much easier to compute than previously defined measures, yielding an efficient implementation that is based on linear algebra tools. We demonstrate our algorithm on a range of inputs, showing examples which highlight the feasibility of this similarity measure.

[1]  John J. Cannon,et al.  The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[2]  M. Ahmed,et al.  A Comparison and Evaluation of Map Construction Algorithms , 2014, ArXiv.

[3]  A. Björner.  Topological methods , 1996 .

[4]  Alexander Wolff,et al.  Computing large matchings fast , 2008, SODA '08.

[5]  Tamal K. Dey,et al.  Optimal homologous cycles, total unimodularity, and linear programming , 2010, STOC '10.

[6]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[7]  Eric Jones,et al.  SciPy: Open Source Scientific Tools for Python , 2001 .

[8]  Erin W. Chambers,et al.  Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time , 2010, Comput. Geom..

[9]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[10]  Atlas F. Cook,et al.  Geodesic Fréchet distance inside a simple polygon , 2008, TALG.

[11]  R. Ho.  Algebraic Topology , 2022 .

[12]  David Joyner,et al.  SAGE: system for algebra and geometry experimentation , 2005, SIGS.

[13]  坂上 貴之.  書評 Computational Homology , 2005 .

[14]  GAP persistence–a computational topology package for GAP , 2012, SoCG 2012.

[15]  Helmut Alt,et al.  Computing the Fréchet distance between two polygonal curves , 1995, Int. J. Comput. Geom. Appl..

[16]  Francis Sergeraert,et al.  Constructive algebraic topology , 1999, SIGS.

[17]  Atlas F. Cook,et al.  Geodesic Fréchet distance inside a simple polygon , 2010, TALG.

[18]  Michael Atiyah,et al.  The index of elliptic operators on compact manifolds , 1963 .

[19]  Remco C. Veltkamp,et al.  A survey of content based 3D shape retrieval methods , 2004, Proceedings Shape Modeling Applications, 2004..

[20]  Erin W. Chambers,et al.  Measuring similarity between curves on 2-manifolds via homotopy area , 2013, SoCG '13.

[21]  Mikael Vejdemo-Johansson,et al.  javaPlex: a research platform for persistent homology , 2012 .

[22]  Helmut Alt,et al.  The Computational Geometry of Comparing Shapes , 2009, Efficient Algorithms.

[23]  Gaël Varoquaux,et al.  Scikit-learn: Machine Learning in Python , 2011, J. Mach. Learn. Res..

[24]  D. Donoho.  For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .

[25]  H. Lawson.  Lectures On Minimal Submanifolds , 1980 .

[26]  Ulrich Bauer,et al.  Clear and Compress: Computing Persistent Homology in Chunks , 2013, Topological Methods in Data Analysis and Visualization.

[27]  Dieter Pfoser,et al.  A comparison and evaluation of map construction algorithms using vehicle tracking data , 2014, GeoInformatica.

[28]  Martial Hebert,et al.  On 3D shape similarity , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[29]  B. White.  Mappings that minimize area in their homotopy classes , 1984 .

[30]  F. Catanese.  Topological methods in algebraic geometry , 2015 .

[31]  Michael Elad,et al.  Efficient Implementation of the K-SVD Algorithm using Batch Orthogonal Matching Pursuit , 2008 .