Dey et al., 2020 - Google Patents
Filtration simplification for persistent homology via edge contractionDey et al., 2020
View PDF- Document ID
- 16763855870747763704
- Author
- Dey T
- Slechta R
- Publication year
- Publication venue
- Journal of Mathematical Imaging and Vision
External Links
Snippet
Persistent homology is a popular data analysis technique that is used to capture the changing homology of an indexed sequence of simplicial complexes. These changes are summarized in persistence diagrams. A natural problem is to contract edges in complexes in …
- 238000001914 filtration 0 title abstract description 39
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30961—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30958—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30994—Browsing or visualization
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30861—Retrieval from the Internet, e.g. browsers
- G06F17/30873—Retrieval from the Internet, e.g. browsers by navigation, e.g. using categorized browsing, portals, synchronized browsing, visual networks of documents, virtual worlds or tours
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30312—Storage and indexing structures; Management thereof
- G06F17/30321—Indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30067—File systems; File servers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/206—Drawing of charts or graphs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hong et al. | A linear-time algorithm for testing outer-1-planarity | |
| Schleicher | Internal addresses of the Mandelbrot set and Galois groups of polynomials | |
| Bychkov et al. | Generalised ordinary vs fully simple duality for n-point functions and a proof of the Borot–Garcia-Failde conjecture | |
| Przyjalkowski et al. | Hodge level for weighted complete intersections | |
| Johnston et al. | Scaling limits for non-intersecting polymers and Whittaker measures | |
| Edelsbrunner et al. | Tri-partitions and bases of an ordered complex | |
| Black et al. | The polyhedral geometry of pivot rules and monotone paths | |
| Krajewski et al. | Constructive matrix theory for higher-order interaction | |
| Suzuki | Supersymmetry for chiral symmetric quantum walks | |
| Fidkowski et al. | Disentangling the generalized double semion model | |
| Javaloyes et al. | Wind Riemannian spaceforms and Randers–Kropina metrics of constant flag curvature | |
| Fomin et al. | Subtraction-free complexity, cluster transformations, and spanning trees | |
| Dey et al. | Filtration simplification for persistent homology via edge contraction | |
| Choudhary et al. | Improved approximate rips filtrations with shifted integer lattices and cubical complexes | |
| Harker et al. | A comparison framework for interleaved persistence modules | |
| Binucci et al. | On the complexity of the storyplan problem | |
| Joswig et al. | Forbidden patterns in tropical plane curves | |
| Graeber et al. | Shadows in Coxeter groups | |
| Tu et al. | Propagate and pair: A single-pass approach to critical point pairing in Reeb graphs | |
| Lauret | Spectra of orbifolds with cyclic fundamental groups | |
| Münch et al. | Partial and simultaneous transitive orientations via modular decompositions | |
| Scholz | Representing distance-hereditary graphs with multi-rooted trees | |
| McDonald et al. | On the Potts model partition function in an external field | |
| Chen | Rigidity and stability of submanifolds with entropy close to one | |
| Botirov et al. | On the set of Gibbs measures for model with a countable set of spin values on Cayley trees |