Combinatorial Gradient Fields for 2D Images with Empirically Convergent Separatrices

08/31/2012
by   Jan Reininghaus, et al.
0

This paper proposes an efficient probabilistic method that computes combinatorial gradient fields for two dimensional image data. In contrast to existing algorithms, this approach yields a geometric Morse-Smale complex that converges almost surely to its continuous counterpart when the image resolution is increased. This approach is motivated using basic ideas from probability theory and builds upon an algorithm from discrete Morse theory with a strong mathematical foundation. While a formal proof is only hinted at, we do provide a thorough numerical evaluation of our method and compare it to established algorithms.

READ FULL TEXT

page 9

page 10

page 13

page 14

research
02/18/2020

Discrete Line Fields on Surfaces

Vector fields and line fields, their counterparts without orientations o...
research
08/16/2023

A topological counterpart of well-founded trees in dependent type theory

Within dependent type theory, we provide a topological counterpart of we...
research
02/08/2022

2D discrete Hodge-Dirac operator on the torus

We discuss a discretisation of the de Rham-Hodge theory in the two-dimen...
research
12/16/2019

Computational enhancement of discrete gradient method

The paper proposes new numerical method being the derivative of discrete...
research
03/22/2022

Gradient Vector Fields of Discrete Morse Functions are Minimum Spanning Forests

In this paper, we prove that discrete Morse functions are equivalent to ...
research
04/20/2003

Whitehead method and Genetic Algorithms

In this paper we discuss a genetic version (GWA) of the Whitehead's algo...
research
08/12/2021

An Operator Splitting View of Federated Learning

Over the past few years, the federated learning () community has witness...

Please sign up or login with your details

Forgot password? Click here to reset