ShaRP: Shape-Regularized Multidimensional Projections
- URL: http://arxiv.org/abs/2306.00554v1
- Date: Thu, 1 Jun 2023 11:16:58 GMT
- Title: ShaRP: Shape-Regularized Multidimensional Projections
- Authors: Alister Machado and Alexandru Telea and Michael Behrisch
- Abstract summary: We present a novel projection technique - ShaRP - that provides users explicit control over the visual signature of the created scatterplot.
ShaRP scales well with dimensionality and dataset size, and generically handles any quantitative dataset.
- Score: 71.30697308446064
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Projections, or dimensionality reduction methods, are techniques of choice
for the visual exploration of high-dimensional data. Many such techniques
exist, each one of them having a distinct visual signature - i.e., a
recognizable way to arrange points in the resulting scatterplot. Such
signatures are implicit consequences of algorithm design, such as whether the
method focuses on local vs global data pattern preservation; optimization
techniques; and hyperparameter settings. We present a novel projection
technique - ShaRP - that provides users explicit control over the visual
signature of the created scatterplot, which can cater better to interactive
visualization scenarios. ShaRP scales well with dimensionality and dataset
size, generically handles any quantitative dataset, and provides this extended
functionality of controlling projection shapes at a small, user-controllable
cost in terms of quality metrics.
Related papers
- PAS-SLAM: A Visual SLAM System for Planar Ambiguous Scenes [41.47703182059505]
We propose a visual SLAM system based on planar features designed for planar ambiguous scenes.
We present an integrated data association strategy that combines plane parameters, semantic information, projection IoU, and non-parametric tests.
Finally, we design a set of multi-constraint factor graphs for camera pose optimization.
arXiv Detail & Related papers (2024-02-09T01:34:26Z) - Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wasserstein [56.62376364594194]
Unsupervised learning aims to capture the underlying structure of potentially large and high-dimensional datasets.
In this work, we revisit these approaches under the lens of optimal transport and exhibit relationships with the Gromov-Wasserstein problem.
This unveils a new general framework, called distributional reduction, that recovers DR and clustering as special cases and allows addressing them jointly within a single optimization problem.
arXiv Detail & Related papers (2024-02-03T19:00:19Z) - 360 Layout Estimation via Orthogonal Planes Disentanglement and
Multi-view Geometric Consistency Perception [60.23832277827669]
Existing panoramic layout estimation solutions tend to recover room boundaries from a vertically compressed sequence.
We present an unsupervised adaptation technique tailored for horizon-depth and ratio representations.
We also introduce an optimization strategy for decision-level layout analysis and a 1D cost volume construction method for feature-level multi-view aggregation.
arXiv Detail & Related papers (2023-12-26T12:16:03Z) - Scalable semi-supervised dimensionality reduction with GPU-accelerated
EmbedSOM [0.0]
BlosSOM is a high-performance semi-supervised dimensionality reduction software for interactive user-steerable visualization of high-dimensional datasets.
We show the application of BlosSOM on realistic datasets, where it helps to produce high-quality visualizations that incorporate user-specified layout and focus on certain features.
arXiv Detail & Related papers (2022-01-03T15:06:22Z) - UnProjection: Leveraging Inverse-Projections for Visual Analytics of
High-Dimensional Data [63.74032987144699]
We present NNInv, a deep learning technique with the ability to approximate the inverse of any projection or mapping.
NNInv learns to reconstruct high-dimensional data from any arbitrary point on a 2D projection space, giving users the ability to interact with the learned high-dimensional representation in a visual analytics system.
arXiv Detail & Related papers (2021-11-02T17:11:57Z) - Revisiting Point Cloud Simplification: A Learnable Feature Preserving
Approach [57.67932970472768]
Mesh and Point Cloud simplification methods aim to reduce the complexity of 3D models while retaining visual quality and relevant salient features.
We propose a fast point cloud simplification method by learning to sample salient points.
The proposed method relies on a graph neural network architecture trained to select an arbitrary, user-defined, number of points from the input space and to re-arrange their positions so as to minimize the visual perception error.
arXiv Detail & Related papers (2021-09-30T10:23:55Z) - Polygonal Point Set Tracking [50.445151155209246]
We propose a novel learning-based polygonal point set tracking method.
Our goal is to track corresponding points on the target contour.
We present visual-effects applications of our method on part distortion and text mapping.
arXiv Detail & Related papers (2021-05-30T17:12:36Z) - DEF: Deep Estimation of Sharp Geometric Features in 3D Shapes [43.853000396885626]
We propose a learning-based framework for predicting sharp geometric features in sampled 3D shapes.
By fusing the result of individual patches, we can process large 3D models, which are impossible to process for existing data-driven methods.
arXiv Detail & Related papers (2020-11-30T18:21:00Z) - Supervised Visualization for Data Exploration [9.742277703732187]
We describe a novel supervised visualization technique based on random forest proximities and diffusion-based dimensionality reduction.
Our approach is robust to noise and parameter tuning, thus making it simple to use while producing reliable visualizations for data exploration.
arXiv Detail & Related papers (2020-06-15T19:10:17Z) - A Grid-based Method for Removing Overlaps of Dimensionality Reduction
Scatterplot Layouts [40.11095094521714]
Distance Grid (DGrid) is a novel post-processing strategy to remove overlaps from Dimensionality Reduction (DR) scatterplot layouts.
It faithfully preserves the original layout's characteristics and bounds the minimum glyph sizes.
arXiv Detail & Related papers (2019-03-08T18:20:36Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.