A Certified Reduction Strategy for Homological Image Processing

The analysis of digital images using homological procedures is an outstanding topic in the area of Computational Algebraic Topology. In this article, we describe a certified reduction strategy to deal with digital images, but one preserving their homological properties. We stress both the advantages of our approach (mainly, the formalization of the mathematics allowing us to verify the correctness of algorithms) and some limitations (related to the performance of the running systems inside proof assistants). The drawbacks are overcome using techniques that provide an integration of computation and deduction. Our driving application is a problem in bioinformatics, where the accuracy and reliability of computations are specially requested.

[1]  Bas Spitters,et al.  Computer Certified Efficient Exact Reals in Coq , 2011, Calculemus/MKM.

[2]  Thierry Coquand,et al.  Computing persistent homology within Coq/SSReflect , 2013, TOCL.

[3]  Vincent Siles,et al.  A Refinement-Based Approach to Computational Algebra in Coq , 2012, ITP.

[4]  Koen Claessen,et al.  QuickCheck: a lightweight tool for random testing of Haskell programs , 2000, ICFP.

[5]  Josef Urban,et al.  Intelligent Computer Mathematics - 18th Symposium, Calculemus 2011, and 10th International Conference, MKM 2011, Bertinoro, Italy, July 18-23, 2011. Proceedings , 2011, Calculemus/MKM.

[6]  Gregor Jerse,et al.  Tracking features in image sequences using discrete Morse functions , 2010 .

[7]  I. K. Wood,et al.  Neuroscience: Exploring the brain , 1996 .

[8]  Herbert Edelsbrunner,et al.  Computational Topology - an Introduction , 2009 .

[9]  Jónathan Heras Vicente,et al.  On automation and certification of a homological method to process biomedical digital images , 2011 .

[10]  Frédéric Chazal,et al.  Molecular shape analysis based upon the morse-smale complex and the connolly function , 2002, SCG '03.

[11]  Ioana Pasca,et al.  Canonical Big Operators , 2008, TPHOLs.

[12]  N. Jacobson,et al.  Basic Algebra I , 1976 .

[13]  Assia Mahboubi,et al.  An introduction to small scale reflection in Coq , 2010, J. Formaliz. Reason..

[14]  Thomas Lewiner,et al.  Applications of Forman's discrete Morse theory to topology visualization and mesh compression , 2004, IEEE Transactions on Visualization and Computer Graphics.

[15]  Georges Gonthier,et al.  Formal Proof—The Four- Color Theorem , 2008 .

[16]  D. Selkoe.  Alzheimer's Disease Is a Synaptic Failure , 2002, Science.

[17]  Jónathan Heras,et al.  Verifying an Algorithm Computing Discrete Vector Fields for Digital Imaging , 2012, AISC/MKM/Calculemus.

[18]  HerasJónathan,et al.  Computing persistent homology within Coq/SSReflect , 2013 .

[19]  Yves Bertot,et al.  Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .

[20]  Larry A. Lambe,et al.  A fixed point approach to homological perturbation theory , 1991 .

[21]  Benjamin Grégoire,et al.  Extending Coq with Imperative Features and Its Application to SAT Verification , 2010, ITP.

[22]  Benjamin Grégoire,et al.  Full Reduction at Full Throttle , 2011, CPP.

[23]  Benjamin Grégoire,et al.  A compiled implementation of strong reduction , 2002, ICFP '02.

[24]  Anders Mörtberg,et al.  Constructive Algebra in Functional Programming and Type Theory , 2010 .

[25]  R. Forman.  Morse Theory for Cell Complexes , 1998 .

[26]  Dmitry N. Kozlov,et al.  Combinatorial Algebraic Topology , 2007, Algorithms and computation in mathematics.

[27]  Jónathan Heras,et al.  Towards a Certified Computation of Homology Groups for Digital Images , 2012, CTIC.

[28]  Germán Cuesto,et al.  Phosphoinositide-3-Kinase Activation Controls Synaptogenesis and Spinogenesis in Hippocampal Neurons , 2011, The Journal of Neuroscience.

[29]  Jesús Aransay,et al.  A Mechanized Proof of the Basic Perturbation Lemma , 2008, Journal of Automated Reasoning.

[30]  Djemel Ziou,et al.  Generating cubical complexes from image data and computation of the Euler number , 2002, Pattern Recognit..

[31]  Pierre Letouzey.  Extraction in Coq: An Overview , 2008, CiE.

[32]  Jesús Aransay,et al.  Generating certified code from formal proofs: a case study in homological algebra , 2010, Formal Aspects of Computing.

[33]  Ana Romero,et al.  Discrete Vector Fields and Fundamental Algebraic Topology , 2010, ArXiv.

[34]  N. Jacobson,et al.  Basic Algebra II , 1989 .

[35]  César Domínguez,et al.  Effective homology of bicomplexes, formalized in Coq , 2011, Theor. Comput. Sci..

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

[37]  Bernd Hamann,et al.  A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality , 2008, IEEE Transactions on Visualization and Computer Graphics.

[38]  Pierre Castéran,et al.  Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[39]  Rafael Ayala,et al.  Homotopy in Digital Spaces , 2000, DGCI.

[40]  Pierre Courtieu,et al.  Efficient Reasoning about Executable Specifications in Coq , 2002, TPHOLs.

[41]  Graham Hutton,et al.  Programming in Haskell , 2007 .