Paper tackles shape graph registration using neural networks.
problem Constrained registration of shape graphs with varying nodes and edges.
method Shape-Graph Matching Network (SGM-net) with an elastic shape metric loss function.
result State-of-the-art matching performance and reduced computational cost.
New shape representation for airfoils improves design and manufacturing.
problem Designing and manufacturing airfoils efficiently and accurately.
method Combining physics-based and data-driven techniques on a Grassmannian manifold.
result Rich set of novel 2D airfoil deformations not previously captured.
Wide and deep neural network predicts Alzheimer's progression from shape and clinical data.
problem Predicting Alzheimer's disease progression from shape and clinical data.
method Fused anatomical shape and tabular clinical data in a neural network, employing survival analysis loss.
result The model outperforms shape and clinical models individually.
Shape information is of great importance in many applications. For example, the oil-bearing capacity of sand bodies, the subterranean remnants of ancient rivers, is related to their cross-sectional shapes. The analysis of these shapes is therefore of some interest, but current classifications are simplistic and ad hoc.…
We use tools from geometric statistics to analyze the usual estimation procedure of a template shape. This applies to shapes from landmarks, curves, surfaces, images etc. We demonstrate the asymptotic bias of the template shape estimation using the stratified geometry of the shape space. We give a Taylor expansion of t…
Unsupervised clustering of curves according to their shapes is an important problem with broad scientific applications. The existing model-based clustering techniques either rely on simple probability models (e.g., Gaussian) that are not generally valid for shape analysis or assume the number of clusters. We develop an…
A new algorithm for parallel transport on shape spaces is presented and compared to existing methods.
problem Statistical analysis of shape data, especially in time series and optimization.
method Pole ladder algorithm for parallel transport on Kendall shape spaces, compared to integration methods.
result The pole ladder algorithm is a more efficient method for parallel transport.
New framework classifies high-dimensional shapes using ray intersections, establishing data requirements.
problem Classifying high-dimensional shapes in real-world data.
method Ray-based classification (RBC) framework using intersections of one-dimensional representations (rays) with shape boundaries.
result Established bounds on the number of rays necessary for shape classification, defined by key angular metrics.
In this paper, we describe a novel shape classification method which is embedded in the Bayesian paradigm. We discuss the modelling and the resulting shape classification algorithm for two and three dimensional data shapes. We conclude by evaluating the efficiency and efficacy of the proposed algorithm on the Kimia sha…
Geomstats introduces shape module for analyzing shapes of objects.
problem Analyzing shapes of objects represented as landmarks, curves, and surfaces.
method Implementing shape spaces, group actions, fiber bundles, quotient spaces, and Riemannian metrics.
result Users can compare, average, and interpolate shapes inside shape spaces.
Develops new shape metrics for high-dimensional objects.
problem Lack of single metrics to describe shape in high dimensions.
method Introduces hyper-Sphericity and hyper-Shape Proportion metrics.
result Discriminates between different shapes in high dimensions.
Study finds cherry-picking load shaping strategies outperforms others in reducing grid CO2 emissions.
problem Lack of detailed counterfactual data makes it hard to assess load shaping strategies' effectiveness.
method Calibrated granular ERCOT simulations for counterfactual analysis of load shaping strategies.
result LMP-based load shaping outperforms other strategies in reducing grid CO2 emissions.
New method learns shape correspondences robustly from raw geometry.
problem Inaccurate and poor generalization of shape correspondences.
method Learning-based approach with feature-extraction network and functional map representation.
result Robust and accurate shape correspondence learning with less training data.
This work characterizes how data augmentation shapes neural representations.
problem Understanding the impact of data augmentation on neural network representations.
method Embedding neural network hidden representations into a metric space invariant to transformations, analyzing shape-space trajectories.
result Increasing data augmentation strength leads to well-behaved trajectories in the embedded space, and different augmentation types steer representations in distinct directions.
New method for partial matching of shapes with Varifolds.
problem Matching structures with topological or shape differences.
method Varifold shape representation and LDDMM framework.
result Effective partial matching despite topological differences.
New benchmark for non-rigid 3D human shape retrieval.
problem Distinguishing between body shapes of 3D human models.
method Extended benchmark with 145 new models and FAUST dataset.
result Improved comparison of 25 shape retrieval methods.
A novel method predicts shape development using Riemannian shape spaces.
problem Predicting future shape development from a single observation.
method Proposes a novel prediction method that encodes shapes in a Riemannian shape space and learns hierarchical statistical models.
result Outperforms deep learning-supported variants and state-of-the-art methods in predicting shape development.
The classification of shapes is of great interest in diverse areas ranging from medical imaging to computer vision and beyond. While many statistical frameworks have been developed for the classification problem, most are strongly tied to early formulations of the problem - with an object to be classified described as …
SVarM uses varifold representations for shape classification and regression.
problem Challenges in analyzing geometric data due to non-Euclidean shape spaces.
method Develops a neural network-based framework for varifold representations of shapes.
result Demonstrates strong performance and robustness in shape classification and regression.
A new method for analyzing shapes using FDA techniques.
problem Statistical shape analysis of deformed contours.
method Functional Data Analysis (FDA) with basis expansion and principal component analysis.
result Successfully identifies deformation parameters and captures contour distributions.
The paper improves GP regression for sparse sensor data in structural mode shape reconstruction.
problem Reconstructing full-field structural mode shapes from sparse sensor data.
method Physics-Constrained Single-Output Gaussian Process (CONS-SOGP) framework.
result The proposed method provides more accurate and reliable mode shapes.
New method reconstructs 3D shapes from 2D images using Kendall's shape space.
problem Reconstruct 3D shapes from 2D images, especially for rare specimens.
method Kendall's shape space approach with prior information.
result More robust and plausible shapes compared to previous methods.
A neural network learns efficient parametrizations of product shape spaces.
problem Efficiently parametrize complex shape spaces with high computational costs.
method Developed a neural network architecture that separately learns approximations for low-dimensional factors and combines them.
result Demonstrated the effectiveness of the approach on synthetic and real data.
Machine learning methods struggle with geometric data, but shape space analysis provides a framework for studying and analyzing geometric variability.
problem Machine learning methods struggle with geometric data
method Shape space analysis provides a mathematical and computational framework
result Characterizes shape variability, compares geometric objects, and analyzes structural trajectories
Improves functional linear regression with shape transfer learning.
problem Data scarcity in functional linear models.
method Shape-based transfer learning from auxiliary to target domains.
result Enhances robustness and generalizability of functional linear models.
New kernel method for shape classification on Kendall shape space.
problem Classification of shapes on non-Euclidean Kendall shape space.
method Extrinsic Veronese Whitney Gaussian kernel for KRRC on Σ2k. result KRRC classifier performs well on real Kendall shape data.
This paper introduces the concept of functional current as a mathematical framework to represent and treat functional shapes, i.e. sub-manifold supported signals. It is motivated by the growing occurrence, in medical imaging and computational anatomy, of what can be described as geometrico-functional data, that is a da…
Efficient method for shape modeling invariant to rigid motion.
problem Statistical shape modeling for rigidly moving shapes.
method Non-Euclidean Lie group analysis of metric distortion and curvature.
result Outperforms state-of-the-art classifiers in sparse data.
Hierarchical geodesic model for analyzing shapes on manifolds.
problem Analyzing temporal observations on manifold-valued data.
method Adapted functional-based metric for efficiency; variational time discretization of geodesics.
result Performed hypothesis tests and estimated mean trends in longitudinal analysis.
This work increases shape bias in CNNs trained on ImageNet, improving robustness without accuracy gain.
problem Shape bias in CNNs trained on ImageNet.
method Uses domain-adversarial training to remove texture clues and increase shape bias.
result The method increases robustness of CNNs without improving accuracy.
3D point cloud attacks examine how neural networks can be fooled.
problem Understanding how 3D neural networks can be exploited by attackers.
method Examined two categories of attacks: distributional and shape attacks.
result Some shape attacks can fool 3D point cloud classification models even after preprocessing.
Deep neural network predicts cardiac shape from MRI images and patient data.
problem Automatic 3D cardiac shape analysis for large-scale studies.
method Uses deep neural networks combining MRI images and patient metadata.
result Significant agreement with reference shapes in cardiac parameters.
Paper introduces a method to generate stable shapes using Grassmann manifolds.
problem Generating stable shapes with minimal extraneous transformations.
method Continuous normalization flows on Grassmann manifolds to eliminate extraneous transformations.
result The method significantly outperforms state-of-the-art methods in generating high-quality samples.
Left atrium shape has been shown to be an independent predictor of recurrence after atrial fibrillation (AF) ablation. Shape-based representation is imperative to such an estimation process, where correspondence-based representation offers the most flexibility and ease-of-computation for population-level shape statisti…
Bayesian nonparametric method partitions shapes using curves.
problem Capturing complex shapes in multi-dimensional data.
method Proposes a novel spline partitioning approach using curves.
result Demonstrates improved shape modeling compared to existing methods.
This paper proposes the adaptation of Support Vector Data Description (SVDD) to the multiple kernel case (MK-SVDD), based on SimpleMKL. It also introduces a variant called Slim-MK-SVDD that is able to produce a tighter frontier around the data. For the sake of comparison, the equivalent methods are also developed for O…
Modeling functional data, this study uncovers the size-and-shape of functions under noisy observations.
problem Uncertainty in recovering a fixed effect function from noisy observations.
method Bayesian functional mixed model with priors on unitary transformations.
result It is possible to recover the size-and-shape of a square-integrable function μ. Introduces Star-Shaped DDPMs for non-Gaussian distributions.
problem Difficulties in defining DDPMs for non-Gaussian distributions.
method Star-shaped diffusion process, duality with specific Markovian diffusions, efficient algorithms.
result SS-DDPMs can model distributions like Beta, von Mises-Fisher, Dirichlet, Wishart.
Framework detects shape shifts in functional profiles using Fréchet mean and shape invariant model.
problem Detecting shape shifts in functional profiles.
method Combining Fréchet mean and shape invariant model for interpretable parameterization of profile deviations.
result Potential shifts in shape deformation process distinguished by significant shifts in amplitude and/or phase.
FineHand learns hand shapes for better ASL recognition.
problem Difficult ASL recognition due to fast, articulate gestures.
method Combines manual and deep learning for hand shape embeddings, uses RNN for sequential gestures.
result Improved video gesture recognition accuracy on GMU-ASL51 benchmark.
Researchers use shape analysis to recover protein structures from Cryo-EM data.
problem Recovering the three-dimensional backbone structure of single polypeptide proteins from noisy tomographic projections.
method Shape analysis and matrix Lie group actions to deform point clouds to match 2D tomography data.
result Optimal deformations are computed to recover the three-dimensional backbone structure of proteins.
New method for high-fidelity shape representations from raw data.
problem Creating accurate shape representations from raw data.
method A simple loss function encouraging neural network to vanish on input point cloud and have unit norm gradient.
result Our method produces high-fidelity, smooth, and natural zero level set surfaces.
A novel 3D shape registration method using spectral graph embedding and probabilistic matching.
problem Challenges in 3D shape analysis and registration, especially with large variability.
method Combining spectral graph matching with Laplacian embedding for large graphs, using commute-time embedding and PCA.
result A method to register shapes with different samplings and isometric deformations.
DISPR uses diffusion models to predict 3D cell shapes from 2D images.
problem Predicting 3D cell shapes from 2D microscopy images.
method Diffusion model trained to predict 3D shapes from 2D microscopy images as a prior.
result Adding DISPR predictions to minority cell classes improves classification accuracy.
Shape manifold and elastic energy regularization help reconstruct complex obstacles from scattering data.
problem Reconstructing non-star-shaped obstacles from scattered waves.
method Shape manifold, Tikhonov regularization, Möbius energy penalization.
result The approach yields stable and accurate reconstructions of complex obstacles.
Data driven segmentation is an important initial step of shape prior-based segmentation methods since it is assumed that the data term brings a curve to a plausible level so that shape and data terms can then work together to produce better segmentations. When purely data driven segmentation produces poor results, the …
The paper presents a method for analyzing shape graphs using specific features.
problem Analyzing geometric and topological variations in shape graphs.
method Curated set of topological, geometric, and directional features for shape graph analysis.
result The feature representation is effective for tasks like group comparison and classification.
New method estimates shape distance in neural representations with limited data.
problem Measuring geometric similarity between high-dimensional network representations.
method Method-of-moments estimator with tunable bias-variance tradeoff.
result New estimator achieves lower bias than standard methods in high-dimensional settings.