Offset Filtration
   HOME





Offset Filtration
The offset filtration (also called the "union-of-balls" or "union-of-disks" 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. 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. 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.'' Since then, the offset filtration ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Offset (union-of-balls) Filtration
Offset or Off-Set may refer to: Arts, entertainment, and media * "Off-Set", a song by T.I. and Young Thug from the '' Furious 7: Original Motion Picture Soundtrack'' * ''Offset'' (EP), a 2018 EP by singer Kim Chung-ha * ''Offset'' (film), a 2006 film featuring Răzvan Vasilescu and Alexandra Maria Lara * Offset Software, a video game development company ** '' Project Offset'', working title of a first-person shooter video game by Offset Software People * Offset (rapper), a rapper and member of the American hip-hop trio Migos Science and engineering * Offset (botany), a separable part of a plant that can develop into a new, independent plant * Offset (computer science), the distance to (displacement of) an element within a data object * Offset (gears), the perpendicular distance between the axes of hypoid or offset-facing gears * Offset (geometry), see parallel curve * Offset (geophysics), the distance between a source and receiver of seismic or other geophysical readings * D ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Convex Set
In geometry, a set of points is convex if it contains every line segment between two points in the set. For example, a solid cube (geometry), cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex. The boundary (topology), boundary of a convex set in the plane is always a convex curve. The intersection of all the convex sets that contain a given subset of Euclidean space is called the convex hull of . It is the smallest convex set containing . A convex function is a real-valued function defined on an interval (mathematics), interval with the property that its epigraph (mathematics), epigraph (the set of points on or above the graph of a function, graph of the function) is a convex set. Convex minimization is a subfield of mathematical optimization, optimization that studies the problem of minimizing convex functions over convex sets. The branch of mathematics devoted to the study of properties of convex sets and convex f ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Computational Topology
Algorithmic topology, or computational topology, is a subfield of topology with an overlap with areas of computer science, in particular, computational geometry and computational complexity theory. A primary concern of algorithmic topology, as its name suggests, is to develop efficient algorithms for solving problems that arise naturally in fields such as computational geometry, graphics, robotics, social science, structural biology, and chemistry, using methods from computable topology. Major algorithms by subject area Algorithmic 3-manifold theory A large family of algorithms concerning 3-manifolds revolve around normal surface theory, which is a phrase that encompasses several techniques to turn problems in 3-manifold theory into integer linear programming problems. * ''Rubinstein and Thompson's 3-sphere recognition algorithm''. This is an algorithm that takes as input a triangulated 3-manifold and determines whether or not the manifold is homeomorphic to the 3-sphere. I ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Applied Mathematics
Applied mathematics is the application of mathematics, mathematical methods by different fields such as physics, engineering, medicine, biology, finance, business, computer science, and Industrial sector, industry. Thus, applied mathematics is a combination of mathematical science and specialized knowledge. The term "applied mathematics" also describes the profession, professional specialty in which mathematicians work on practical problems by formulating and studying mathematical models. In the past, practical applications have motivated the development of mathematical theories, which then became the subject of study in pure mathematics where abstract concepts are studied for their own sake. The activity of applied mathematics is thus intimately connected with research in pure mathematics. History Historically, applied mathematics consisted principally of Mathematical analysis, applied analysis, most notably differential equations; approximation theory (broadly construed, ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Multicover Bifiltration
The multicover bifiltration is a two-parameter sequence of nested Topological space, topological spaces derived from the covering of a finite set in a metric space by growing Ball (mathematics), metric balls. It is a multidimensional extension of the Offset Filtration, offset filtration that captures density information about the underlying data set by filtering the points of the offsets at each index according to how many balls cover each point. The multicover bifiltration has been an object of study within multidimensional persistent homology and topological data analysis. Definition Following the notation of Corbet et al. (2022), given a finite set A\subset \mathbb R^d, the multicover bifiltration on A is a two-parameter filtration indexed by \mathbb R \times \mathbb N^ defined index-wise as \operatorname_ := \, where \mathbb N denotes the non-negative integers.{{Cite journal , last1=Corbet , first1=René , last2=Kerber , first2=Michael , last3=Lesnick , first3=Michael , last4= ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Isomorphism
In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word is derived . The interest in isomorphisms lies in the fact that two isomorphic objects have the same properties (excluding further information such as additional structure or names of objects). Thus isomorphic structures cannot be distinguished from the point of view of structure only, and may often be identified. In mathematical jargon, one says that two objects are the same up to an isomorphism. A common example where isomorphic structures cannot be identified is when the structures are substructures of a larger one. For example, all subspaces of dimension one of a vector space are isomorphic and cannot be identified. An automorphism is an isomorphism from a structure to itself. An isomorphism between two structures is a ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Homology (mathematics)
In mathematics, the term homology, originally introduced in algebraic topology, has three primary, closely-related usages. The most direct usage of the term is to take the ''homology of a chain complex'', resulting in a sequence of Abelian group, abelian groups called ''homology groups.'' This operation, in turn, allows one to associate various named ''homologies'' or ''homology theories'' to various other types of mathematical objects. Lastly, since there are many homology theories for Topological space, topological spaces that produce the same answer, one also often speaks of the ''homology of a topological space''. (This latter notion of homology admits more intuitive descriptions for 1- or 2-dimensional topological spaces, and is sometimes referenced in popular mathematics.) There is also a related notion of the cohomology of a Cochain complexes, cochain complex, giving rise to various cohomology theories, in addition to the notion of the cohomology of a topological space. Ho ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Weak Equivalence (homotopy Theory)
In mathematics, a weak equivalence is a notion from homotopy theory that in some sense identifies objects that have the same "shape". This notion is formalized in the axiomatic definition of a model category. A model category is a category with classes of morphisms called weak equivalences, fibrations, and cofibrations, satisfying several axioms. The associated homotopy category of a model category has the same objects, but the morphisms are changed in order to make the weak equivalences into isomorphisms. It is a useful observation that the associated homotopy category depends only on the weak equivalences, not on the fibrations and cofibrations. Topological spaces Model categories were defined by Quillen as an axiomatization of homotopy theory that applies to topological spaces, but also to many other categories in algebra and geometry. The example that started the subject is the category of topological spaces with Serre fibrations as fibrations and weak homotopy equival ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Vietoris–Rips Complex
In topology, the Vietoris–Rips complex, also called the Vietoris complex or Rips complex, is a way of forming a topological space from distances in a set of points. It is an abstract simplicial complex that can be defined from any metric space ''M'' and distance δ by forming a simplex for every finite set of points that has diameter at most δ. That is, it is a family of finite subsets of ''M'', in which we think of a subset of ''k'' points as forming a (''k'' − 1)-dimensional simplex (an edge for two points, a triangle for three points, a tetrahedron for four points, etc.); if a finite set ''S'' has the property that the distance between every pair of points in ''S'' is at most δ, then we include ''S'' as a simplex in the complex. History The Vietoris–Rips complex was originally called the Vietoris complex, for Leopold Vietoris, who introduced it as a means of extending homology theory from simplicial complexes to metric spaces. After Eliyahu Rips applied ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

ÄŒech Complex
In algebraic topology and topological data analysis, the ÄŒech complex is an abstract simplicial complex constructed from a point cloud in any metric space which is meant to capture topological information about the point cloud or the distribution it is drawn from. Given a finite point cloud ''X'' and an ''ε'' > 0, we construct the ÄŒech complex \check C_\varepsilon(X) as follows: Take the elements of ''X'' as the vertex set of \check C_\varepsilon(X) . Then, for each \sigma\subset X , let \sigma\in \check C_\varepsilon(X) if the set of ''ε''-balls centered at points of σ has a nonempty intersection. In other words, the ÄŒech complex is the nerve of the set of ''ε''-balls centered at points of ''X''. By the nerve lemma, the ÄŒech complex is homotopy equivalent to the union of the balls, also known as the offset filtration. Relation to Vietoris–Rips complex The ÄŒech complex is a subcomplex of the Vietoris–Rips complex. While the ÄŒech complex is more com ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Homotopy Type
In topology, two continuous functions from one topological space to another are called homotopic (from and ) if one can be "continuously deformed" into the other, such a deformation being called a homotopy ( ; ) between the two functions. A notable use of homotopy is the definition of homotopy groups and cohomotopy groups, important invariants in algebraic topology. In practice, there are technical difficulties in using homotopies with certain spaces. Algebraic topologists work with compactly generated spaces, CW complexes, or spectra. Formal definition Formally, a homotopy between two continuous functions ''f'' and ''g'' from a topological space ''X'' to a topological space ''Y'' is defined to be a continuous function H: X \times ,1\to Y from the product of the space ''X'' with the unit interval , 1to ''Y'' such that H(x,0) = f(x) and H(x,1) = g(x) for all x \in X. If we think of the second parameter of ''H'' as time then ''H'' describes a ''continuous def ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]