Amit Patel
Institute of Science and Technology Austria
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Amit Patel.
symposium on computational geometry | 2008
Herbert Edelsbrunner; John Harer; Amit Patel
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of a point in the range. We study the local and global structure of this space for generic, piecewise linear mappings on a combinatorial manifold.
Foundations of Computational Mathematics | 2011
Herbert Edelsbrunner; Dmitriy Morozov; Amit Patel
By definition, transverse intersections are stable under infinitesimal perturbations. Using persistent homology, we extend this notion to a measure. Given a space of perturbations, we assign to each homology class of the intersection its robustness, the magnitude of a perturbation in this space necessary to kill it, and then we prove that the robustness is stable. Among the applications of this result is a stable notion of robustness for fixed points of continuous mappings and a statement of stability for contours of smooth mappings.
Discrete and Computational Geometry | 2016
Vin de Silva; Elizabeth Munch; Amit Patel
The Reeb graph is a construction which originated in Morse theory to study a real-valued function defined on a topological space. More recently, it has been used in various applications to study noisy data which creates a desire to define a measure of similarity between these structures. Here, we exploit the fact that the category of Reeb graphs is equivalent to the category of a particular class of cosheaf. Using this equivalency, we can define an ‘interleaving’ distance between Reeb graphs which is stable under the perturbation of a function. Along the way, we obtain a natural construction for smoothing a Reeb graph to reduce its topological complexity. The smoothed Reeb graph can be constructed in polynomial time.
Archive | 2011
Herbert Edelsbrunner; Dmitriy Morozov; Amit Patel
The (apparent) contour of a smooth mapping from a 2-manifold to the plane, f :𝕄→ℝ2, is the set of critical values, that is, the image of the points at which the gradients of the two component functions are linearly dependent. Assuming 𝕄 is compact and orientable and measuring difference with the erosion distance, we prove that the contour is stable.
european symposium on algorithms | 2010
Paul Bendich; Herbert Edelsbrunner; Dmitriy Morozov; Amit Patel
We define the robustness of a level set homology class of a function f : X → R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theoretic framework, we compute the robustness for each class, using a connection to extended persistent homology. The special case X = R3 has ramifications in medical imaging and scientific visualization.
arXiv: Algebraic Topology | 2018
Amit Patel
We generalize the persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer to the setting of constructible persistence modules valued in a symmetric monoidal category. We call this the type
mathematical foundations of computer science | 2010
Paul Bendich; Herbert Edelsbrunner; Michael Kerber; Amit Patel
Clinical Breast Cancer | 2018
Hope S. Rugo; Henri Roché; Eva Thomas; Hyun Cheol Chung; Guillermo Lerzo; Igor Vasyutin; Amit Patel; Linda T. Vahdat
{mathcal {A}}
Homology, Homotopy and Applications | 2013
Paul Bendich; Herbert Edelsbrunner; Dmitriy Morozov; Amit Patel
Archive | 2010
Amit Patel
A persistence diagram of a persistence module. If the category is also abelian, then we define a second type