English
Related papers

Related papers: Computing Stable Demers Cartograms

200 papers

Auto-encoder models that preserve similarities in the data are a popular tool in representation learning. In this paper we introduce several auto-encoder models that preserve local distances when mapping from the data space to the latent…

Machine Learning · Computer Science 2022-10-03 Nutan Chen , Patrick van der Smagt , Botond Cseke

In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$…

Optimization and Control · Mathematics 2019-03-29 Nicolas Gillis , Michael Karow , Punit Sharma

Takens' Embedding Theorem remarkably established that concatenating M previous outputs of a dynamical system into a vector (called a delay coordinate map) can be a one-to-one mapping of a low-dimensional attractor from the system state…

Systems and Control · Computer Science 2015-03-17 Han Lun Yap , Christopher J. Rozell

Persistence diagrams are common objects in the field of Topological Data Analysis. They are topological summaries that capture both topological and geometric structure within data. Recently there has been a surge of interest in developing…

Statistics Theory · Mathematics 2019-02-07 Katharine Turner

Cartograms are maps in which areas of geographic regions (countries, states) appear in proportion to some variable of interest (population, income). Cartograms are popular visualizations for geo-referenced data that have been used for over…

Human-Computer Interaction · Computer Science 2017-01-04 Sabrina Nusrat , Md. Jawaherul Alam , Stephen G. Kobourov

This work incorporates topological features via persistence diagrams to classify point cloud data arising from materials science. Persistence diagrams are multisets summarizing the connectedness and holes of given data. A new distance on…

Machine Learning · Statistics 2019-11-11 Vasileios Maroulas , Cassie Putman Micucci , Adam Spannaus

Recent years have witnessed a tremendous growth using topological summaries, especially the persistence diagrams (encoding the so-called persistent homology) for analyzing complex shapes. Intuitively, persistent homology maps a potentially…

Computational Geometry · Computer Science 2021-04-19 Samantha Chen , Yusu Wang

The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the $\infty$-norm of…

Algebraic Topology · Mathematics 2025-07-11 Primoz Skraba , Katharine Turner

We introduce a novel method for defining geographic districts in road networks using stable matching. In this approach, each geographic district is defined in terms of a center, which identifies a location of interest, such as a post office…

Data Structures and Algorithms · Computer Science 2017-09-21 David Eppstein , Michael Goodrich , Doruk Korkmaz , Nil Mamano

Many dynamic processes involve time delays, thus their dynamics are governed by delay differential equations (DDEs). Studying the stability of dynamic systems is critical, but analyzing the stability of time-delay systems is challenging…

Dynamical Systems · Mathematics 2020-05-22 Surya Samukham , Thomas K. Uchida , C. P. Vyasarayani

We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data. Stability in general plays…

Data Structures and Algorithms · Computer Science 2025-03-10 Wouter Meulemans , Bettina Speckmann , Kevin Verbeek , Jules Wulms

We apply persistent homology, the dominant tool from the field of topological data analysis, to study electoral redistricting. Our method combines the geographic information from a political districting plan with election data to produce a…

Algebraic Topology · Mathematics 2020-07-07 Moon Duchin , Tom Needham , Thomas Weighill

Many datasets can be viewed as a noisy sampling of an underlying space, and tools from topological data analysis can characterize this structure for the purpose of knowledge discovery. One such tool is persistent homology, which provides a…

Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed…

Information Theory · Computer Science 2024-03-01 Deheng Yuan , Tao Guo , Zhongyi Huang , Shi Jin

Many attempts have been made in recent decades to integrate machine learning (ML) and topological data analysis. A prominent problem in applying persistent homology to ML tasks is finding a vector representation of a persistence diagram…

Machine Learning · Computer Science 2022-04-25 Zhetong Dong , Hongwei Lin , Chi Zhou

The Coherence Length Diagram and the related maps have been shown to represent a useful tool for image analysis. Setting threshold parameters is one of the most important issues when dealing with such applications, as they affect both the…

Computer Vision and Pattern Recognition · Computer Science 2014-09-12 Roberto Marazzato , Amelia Carolina Sparavigna

This paper presents a vector HD-mapping algorithm that formulates the mapping as a tracking task and uses a history of memory latents to ensure consistent reconstructions over time. Our method, MapTracker, accumulates a sensor stream into…

Computer Vision and Pattern Recognition · Computer Science 2024-10-15 Jiacheng Chen , Yuefan Wu , Jiaqi Tan , Hang Ma , Yasutaka Furukawa

As one of the fundamental modules in autonomous driving, online high-definition (HD) maps have attracted significant attention due to their cost-effectiveness and real-time capabilities. Since vehicles always cruise in highly dynamic…

Computer Vision and Pattern Recognition · Computer Science 2025-10-14 Hao Shan , Ruikai Li , Han Jiang , Yizhe Fan , Ziyang Yan , Bohan Li , Xiaoshuai Hao , Hao Zhao , Zhiyong Cui , Yilong Ren , Haiyang Yu

We propose a general technique for extracting a larger set of stable information from persistent homology computations than is currently done. The persistent homology algorithm is usually viewed as a procedure which starts with a filtered…

Computational Geometry · Computer Science 2021-01-29 Paul Bendich , Peter Bubenik , Alexander Wagner

Learning a stable Linear Dynamical System (LDS) from data involves creating models that both minimize reconstruction error and enforce stability of the learned representation. We propose a novel algorithm for learning stable LDSs. Using a…

Machine Learning · Computer Science 2020-11-19 Giorgos Mamakoukas , Orest Xherija , T. D. Murphey