Visualization of high-dimensional point clouds using their density distribution's topology

We present a novel method to visualize multidimensional point clouds. While conventional visualization techniques, like scatterplot matrices or parallel coordinates, have issues with either overplotting of entities or handling many dimensions, we abstract the data using topological methods before pr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Oesterling, Patrick (VerfasserIn) , Heine, Christian (VerfasserIn) , Leitte, Heike (VerfasserIn) , Scheuermann, Gerik (VerfasserIn) , Heyer, Gerhard (VerfasserIn)
Dokumenttyp: Article (Journal)
Sprache:Englisch
Veröffentlicht: 04 February 2011
In: IEEE transactions on visualization and computer graphics
Year: 2011, Jahrgang: 17, Heft: 11, Pages: 1547-1559
ISSN:1941-0506
DOI:10.1109/TVCG.2011.27
Online-Zugang:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1109/TVCG.2011.27
Volltext
Verfasserangaben:Patrick Oesterling, Christian Heine, Heike Janicke, Gerik Scheuermann, Gerhard Heyer
Beschreibung
Zusammenfassung:We present a novel method to visualize multidimensional point clouds. While conventional visualization techniques, like scatterplot matrices or parallel coordinates, have issues with either overplotting of entities or handling many dimensions, we abstract the data using topological methods before presenting it. We assume the input points to be samples of a random variable with a high-dimensional probability distribution which we approximate using kernel density estimates on a suitably reconstructed mesh. From the resulting scalar field we extract the join tree and present it as a topological landscape, a visualization metaphor that utilizes the human capability of understanding natural terrains. In this landscape, dense clusters of points show up as hills. The nesting of hills indicates the nesting of clusters. We augment the landscape with the data points to allow selection and inspection of single points and point sets. We also present optimizations to make our algorithm applicable to large data sets and to allow interactive adaption of our visualization to the kernel window width used in the density estimation.
Beschreibung:Gesehen am 29.09.2022
Beschreibung:Online Resource
ISSN:1941-0506
DOI:10.1109/TVCG.2011.27