![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/3/38/Offset_%2528union-of-balls%2529_filtration.png/640px-Offset_%2528union-of-balls%2529_filtration.png&w=640&q=50)
Offset filtration
From Wikipedia, the free encyclopedia
The offset filtration (also called the "union-of-balls"[1] or "union-of-disks"[2] filtration) is a growing sequence of metric balls used to detect the size and scale of topological features of a data set. The offset filtration commonly arises in persistent homology and the field of topological data analysis. Utilizing a union of balls to approximate the shape of geometric objects was first suggested by Frosini in 1992 in the context of submanifolds of Euclidean space.[3] The construction was independently explored by Robins in 1998, and expanded to considering the collection of offsets indexed over a series of increasing scale parameters (i.e., a growing sequence of balls), in order to observe the stability of topological features with respect to attractors.[4] Homological persistence as introduced in these papers by Frosini and Robins was subsequently formalized by Edelsbrunner et al. in their seminal 2002 paper Topological Persistence and Simplification.[5] Since then, the offset filtration has become a primary example in the study of computational topology and data analysis.
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/3/38/Offset_%28union-of-balls%29_filtration.png/640px-Offset_%28union-of-balls%29_filtration.png)