Verifying an algorithm computing Discrete Vector Fields for digital imaging

07/13/2012
by   Jónathan Heras, et al.
0

In this paper, we present a formalization of an algorithm to construct admissible discrete vector fields in the Coq theorem prover taking advantage of the SSReflect library. Discrete vector fields are a tool which has been welcomed in the homological analysis of digital images since it provides a procedure to reduce the amount of information but preserving the homological properties. In particular, thanks to discrete vector fields, we are able to compute, inside Coq, homological properties of biomedical images which otherwise are out of the reach of this system.

READ FULL TEXT
research
10/06/2014

Effective persistent homology of digital images

In this paper, three Computational Topology methods (namely effective ho...
research
12/21/2017

Discrete Gradient Line Fields on Surfaces

A line field on a manifold is a smooth map which assigns a tangent line ...
research
09/30/2020

A robustness measure for singular point and index estimation in discretized orientation and vector fields

The identification of singular points or topological defects in discreti...
research
07/02/2023

A new approach to integrals of discretizations by polarization

Recently, a family of unconventional integrators for ODEs with polynomia...
research
07/04/2023

Functional equivariance and modified vector fields

This paper examines functional equivariance, recently introduced by McLa...
research
11/22/2019

Unsupervised Features Learning for Sampled Vector Fields

In this paper we introduce a new approach to computing hidden features o...
research
06/22/2015

A Borsuk-Ulam theorem for digital images

The Borsuk-Ulam theorem states that a continuous function f:S^n →^n has ...

Please sign up or login with your details

Forgot password? Click here to reset