# Affine invariant erosion of 3D shapes

```@article{Betel2001AffineIE,
title={Affine invariant erosion of 3D shapes},
author={Santiago Betel{\'u} and Guillermo Sapiro and Allen R. Tannenbaum},
journal={Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001},
year={2001},
volume={2},
pages={174-180 vol.2}
}```
• Published 7 July 2001
• Mathematics
• Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001
A new definition of affine invariant erosion of 3D surfaces is introduced. Instead of being based in terms of Euclidean distances, the volumes enclosed between the surface and its chords are used. The resulting erosion is insensitive to noise, and by construction, it is affine invariant. We prove some key properties about this erosion operation, and we propose a simple method to compute the erosion of implicit surfaces. We also discuss how the affine erosion can be used to define 3D affine…
6 Citations

## Figures from this paper

Area-Based Medial Axis of Planar Curves
• Mathematics
International Journal of Computer Vision
• 2004
A simple method to compute the medial axis of planar closed curves is proposed and it is demonstrated how to use this method to detect affine skew symmetry in real images.
A Fast Marching Method for the Area Based Affine Distance
• Mathematics, Computer Science
Journal of Mathematical Imaging and Vision
• 2007
The proposed algorithm has a lower computational complexity than the direct method and its convergence is proved, which offers a dynamic point of view for the area based affine distance.
Volume distance to hypersurfaces: relation with the Blaschke metric and the shape operator
• Mathematics
• 2010
In this paper we consider the volume distance from a point to a convex hypersurface, which is defined as the minimal distance bounded by a hyperplane through the point and the hypersurface. We
Some properties of the volume distance to hypersurfaces
• Mathematics
• 2010
In this paper we consider the volume distance from a point to a convex hypersurface M ⊂ R, which is defined as the minimum (N + 1)-volume of a region bounded by M and a hyperplane through the point.

## References

SHOWING 1-10 OF 78 REFERENCES
Affine-Invariant Skeleton of 3D Shapes
• Mathematics
Shape Modeling International
• 2002
This paper defines an affine-invariant skeletal representation; starting from global features of a 3D shape, located by curvature properties, a Reeb graph is defined using the topological distance as quotient function.
Noise-Resistant Affine Skeletons of Planar Curves
• Mathematics
ECCV
• 2000
A simple method to compute the skeleton and give examples with real images are proposed, and it is shown that the proposed definition works also for noisy data and how to use this method to detect affine skew symmetry.
Affine plane curve evolution: a fully consistent scheme
• L. Moisan
• Mathematics
IEEE Trans. Image Process.
• 1998
We present an accurate numerical scheme for the affine plane curve evolution and its morphological extension to grey-level images. This scheme is based on the iteration of a nonlocal, fully affine
An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids
• Computer Science
IEEE Trans. Vis. Comput. Graph.
• 1996
An algorithm for determining the medial axis transform (MAT) for general 3D polyhedral solids of arbitrary genus without cavities, with nonconvex vertices and edges, is developed.
Affine invariant medial axis and skew symmetry
• Mathematics
Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271)
• 1998
It is shown how to use the symmetry set to detect affine skew symmetry, proving that the contact based symmetry set is a straight line if and only if the given shape is the affine transformation of a symmetric object.
Topology matching for fully automatic similarity estimation of 3D shapes
• Computer Science
SIGGRAPH
• 2001
A novel technique is proposed, called Topology Matching, in which similarity between polyhedral models is quickly, accurately, and automatically calculated by comparing Multiresolutional Reeb Graphs (MRGs), which operates well as a search key for 3D shape data sets.
Skeleton extraction of 3D objects with radial basis functions
• Computer Science
2003 Shape Modeling International.
• 2003
A practical approach for extracting skeletons from general 3D models using radial basis functions (RBFs) is proposed, and a skeleton generated with this approach conforms more to the human perception.
Level set diagrams of polyhedral objects
• Computer Science
SMA '99
• 1999
This work proposes a new paradigm for constructing one dimensional axial structures associated with a polyhedral object, called the level set diagrams, which are associated with scalar functions defined over the set of vertices of a polyhedron.
Penalized-Distance Volumetric Skeleton Algorithm
• Computer Science
IEEE Trans. Vis. Comput. Graph.
• 2001
A refined general definition of a skeleton is introduced that is based on a penalized distance function and that cannot create any of the degenerate cases of the earlier CEASAR and TEASAR algorithms.
Skeleton Extraction of 3D Objects with Visible Repulsive Force
• Computer Science
• 2003
A novel skeletonization algorithm to extract visually satisfactory skeleton from arbitrary 3D objects is proposed and can deal with arbitrary shape representations, such as polygonal models or parametric surfaces.