Results 141 to 150 of about 656,770 (269)
Fast Injective Mesh Parameterization via Beltrami Coefficient Prolongation
Abstract We present a highly efficient and robust method for free boundary injective parameterization of disk‐like triangle meshes with low isometric distortion. Harmonic function–based approaches, grounded in a strong mathematical framework, are widely employed.
G. Fargion, O. Weber
wiley +1 more source
Affinification: A Fine Approximation of Deformations
Abstract We introduce affinification, a novel method for accelerating physics‐based animation of elastic solids. During a time‐dependent simulation, our method automatically partitions the space into affine and elastic regions depending on the deformation.
A. Mercier‐Aubin +3 more
wiley +1 more source
Survey on differential estimators for 3d point clouds
Abstract Recent advancements in 3D scanning technologies, including LiDAR and photogrammetry, have enabled the precise digital replication of real‐world objects. These methods are widely used in fields such as GIS, robotics, and cultural heritage. However, the point clouds generated by such scans are often noisy and unstructured, posing challenges for ...
Léo Arnal–Anger +4 more
wiley +1 more source
Graph-Constrained Residual Self-Expressive Subspace Clustering Network for Hyperspectral Images
Hyperspectral images are widely use due to their rich spectral information. Meanwhile, the difficult acquisition of data labels makes unsupervised classification attracts attention.
Kun Huang +4 more
doaj +1 more source
Feature interaction in subspace clustering using the Choquet integral
Subspace clustering has recently emerged as a popular approach to removing irrelevant and redundant features during the clustering process. However, most subspace clustering methods do not consider the interaction between the features.
Ng, Theam Foo, +2 more
core +1 more source
Hierarchical Optimization of the As‐Rigid‐As‐Possible Energy
Abstract The As‐Rigid‐As‐Possible (ARAP) energy [SA07] has become a versatile ingredient in various geometry processing and machine learning methods. The classic method for its minimization is a block coordinate descent, alternating between local rotation estimation and a global linear solve, which converges slowly for large problem instances.
Hendrik Meyer, Bernd Bickel, Marc Alexa
wiley +1 more source
Evaluating subspace clustering algorithms
Clustering techniques often define the similarity between instances using distance measures over the various dimensions of the data [12, 14]. Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces
Lance Parsons
core
We present an interactive visual analysis tool to study how patient‐specific tissue properties influence radiofrequency ablation outcomes. Using a deep‐learning surrogate model, we predict ablation volumes for unseen parameter settings with accuracy superior to interpolation, supporting improved treatment planning. Abstract Radiofrequency (RF) ablation
R. Sabbagh Gol +7 more
wiley +1 more source
Guest Editorial: Computational Intelligence in Dynamic and Uncertain Environments
CAAI Transactions on Intelligence Technology, EarlyView.
Shouyong Jiang
wiley +1 more source
Scalable Computation of Topological Abstractions for Scalar Data
Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will +6 more
wiley +1 more source

