Toroidal Coordinates: Decorrelating Circular Coordinates With Lattice Reduction
The circular coordinates algorithm of de Silva, Morozov, and Vejdemo-Johansson takes as input a dataset together with a cohomology class representing a $1$-dimensional hole in the data; the output is a map from the data into the circle that captures this hole, and that is of minimum energy in a suitable sense. However, when applied to several cohomology classes, the output circle-valued maps can be "geometrically correlated" even if the chosen cohomology classes are linearly independent. It is shown in the original work that less correlated maps can be obtained with suitable integer linear combinations of the cohomology classes, with the linear combinations being chosen by inspection. In this paper, we identify a formal notion of geometric correlation between circle-valued maps which, in the Riemannian manifold case, corresponds to the Dirichlet form, a bilinear form derived from the Dirichlet energy. We describe a systematic procedure for constructing low energy torus-valued maps on data, starting from a set of linearly independent cohomology classes. We showcase our procedure with computational examples. Our main algorithm is based on the Lenstra--Lenstra--Lov\'asz algorithm from computational number theory.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Synthetic Data Generation and Automated Multidimensional Data Labeling for AI/ML in General and Circular Coordinates
Insufficient amounts of available training data is a critical challenge for both development and deployment of artificial intelligence and machine learning (AI/ML) models. This paper proposes a unified approach to both s…
Outlier DetectionSynthetic Data GenerationSubsampling, aligning, and averaging to find circular coordinates in recurrent time series
We introduce a new algorithm for finding robust circular coordinates on data that is expected to exhibit recurrence, such as that which appears in neuronal recordings of C. elegans. Techniques exist to create circular co…
Time SeriesGeneralized Penalty for Circular Coordinate Representation
Topological Data Analysis (TDA) provides novel approaches that allow us to analyze the geometrical shapes and topological structures of a dataset. As one important application, TDA can be used for data visualization and …
Data VisualizationDimensionality ReductionTopological Data AnalysisSelecting Interpretable Circular Coordinates from Data
Circular coordinates obtained from persistent cohomology reveal loop structure in data, but they usually remain abstract: A detected circle does not tell us which measured angle, phase, torsion, or decoder explains it. W…
Point CloudsCylindrical coordinates for LiDAR point cloud compression
We present an efficient voxelization method to encode the geometry and attributes of 3D point clouds obtained from autonomous vehicles. Due to the circular scanning trajectory of sensors, the geometry of LiDAR point clou…
AttributeAutonomous Vehicles