Planar Pixelations and Image Recognition

05/13/2011
by   Brandon Rowekamp, et al.
0

Any subset of the plane can be approximated by a set of square pixels. This transition from a shape to its pixelation is rather brutal since it destroys geometric and topological information about the shape. Using a technique inspired by Morse Theory, we algorithmically produce a PL approximation of the original shape using only information from its pixelation. This approximation converges to the original shape in a very strong sense: as the size of the pixels goes to zero we can recover important geometric and topological invariants of the original shape such as Betti numbers, area, perimeter and curvature measures.

READ FULL TEXT

page 3

page 6

page 8

page 19

research
03/14/2022

Geometry of Data

Topological data analysis asks when balls in a metric space (X,d) inters...
research
01/15/2012

Shape analysis using fractal dimension: a curvature based approach

The present work shows a novel fractal dimension method for shape analys...
research
03/06/2023

Learning Differential Invariants of Planar Curves

We propose a learning paradigm for the numerical approximation of differ...
research
09/08/2019

New Graph-based Features For Shape Recognition

Shape recognition is the main challenging problem in computer vision. Di...
research
06/30/2023

Topologically Attributed Graphs for Shape Discrimination

In this paper we introduce a novel family of attributed graphs for the p...
research
10/19/2022

A Flexible Approach for Normal Approximation of Geometric and Topological Statistics

We derive normal approximation results for a class of stabilizing functi...

Please sign up or login with your details

Forgot password? Click here to reset