19,632 research outputs found
Simulation of hyperelastic materials in real-time using Deep Learning
The finite element method (FEM) is among the most commonly used numerical
methods for solving engineering problems. Due to its computational cost,
various ideas have been introduced to reduce computation times, such as domain
decomposition, parallel computing, adaptive meshing, and model order reduction.
In this paper we present U-Mesh: a data-driven method based on a U-Net
architecture that approximates the non-linear relation between a contact force
and the displacement field computed by a FEM algorithm. We show that deep
learning, one of the latest machine learning methods based on artificial neural
networks, can enhance computational mechanics through its ability to encode
highly non-linear models in a compact form. Our method is applied to two
benchmark examples: a cantilever beam and an L-shape subject to moving punctual
loads. A comparison between our method and proper orthogonal decomposition
(POD) is done through the paper. The results show that U-Mesh can perform very
fast simulations on various geometries, mesh resolutions and number of input
forces with very small errors
Detail-preserving and Content-aware Variational Multi-view Stereo Reconstruction
Accurate recovery of 3D geometrical surfaces from calibrated 2D multi-view
images is a fundamental yet active research area in computer vision. Despite
the steady progress in multi-view stereo reconstruction, most existing methods
are still limited in recovering fine-scale details and sharp features while
suppressing noises, and may fail in reconstructing regions with few textures.
To address these limitations, this paper presents a Detail-preserving and
Content-aware Variational (DCV) multi-view stereo method, which reconstructs
the 3D surface by alternating between reprojection error minimization and mesh
denoising. In reprojection error minimization, we propose a novel inter-image
similarity measure, which is effective to preserve fine-scale details of the
reconstructed surface and builds a connection between guided image filtering
and image registration. In mesh denoising, we propose a content-aware
-minimization algorithm by adaptively estimating the value and
regularization parameters based on the current input. It is much more promising
in suppressing noise while preserving sharp features than conventional
isotropic mesh smoothing. Experimental results on benchmark datasets
demonstrate that our DCV method is capable of recovering more surface details,
and obtains cleaner and more accurate reconstructions than state-of-the-art
methods. In particular, our method achieves the best results among all
published methods on the Middlebury dino ring and dino sparse ring datasets in
terms of both completeness and accuracy.Comment: 14 pages,16 figures. Submitted to IEEE Transaction on image
processin
Dense 3D Face Correspondence
We present an algorithm that automatically establishes dense correspondences
between a large number of 3D faces. Starting from automatically detected sparse
correspondences on the outer boundary of 3D faces, the algorithm triangulates
existing correspondences and expands them iteratively by matching points of
distinctive surface curvature along the triangle edges. After exhausting
keypoint matches, further correspondences are established by generating evenly
distributed points within triangles by evolving level set geodesic curves from
the centroids of large triangles. A deformable model (K3DM) is constructed from
the dense corresponded faces and an algorithm is proposed for morphing the K3DM
to fit unseen faces. This algorithm iterates between rigid alignment of an
unseen face followed by regularized morphing of the deformable model. We have
extensively evaluated the proposed algorithms on synthetic data and real 3D
faces from the FRGCv2, Bosphorus, BU3DFE and UND Ear databases using
quantitative and qualitative benchmarks. Our algorithm achieved dense
correspondences with a mean localisation error of 1.28mm on synthetic faces and
detected anthropometric landmarks on unseen real faces from the FRGCv2
database with 3mm precision. Furthermore, our deformable model fitting
algorithm achieved 98.5% face recognition accuracy on the FRGCv2 and 98.6% on
Bosphorus database. Our dense model is also able to generalize to unseen
datasets.Comment: 24 Pages, 12 Figures, 6 Tables and 3 Algorithm
Probabilistic 3D surface reconstruction from sparse MRI information
Surface reconstruction from magnetic resonance (MR) imaging data is
indispensable in medical image analysis and clinical research. A reliable and
effective reconstruction tool should: be fast in prediction of accurate well
localised and high resolution models, evaluate prediction uncertainty, work
with as little input data as possible. Current deep learning state of the art
(SOTA) 3D reconstruction methods, however, often only produce shapes of limited
variability positioned in a canonical position or lack uncertainty evaluation.
In this paper, we present a novel probabilistic deep learning approach for
concurrent 3D surface reconstruction from sparse 2D MR image data and aleatoric
uncertainty prediction. Our method is capable of reconstructing large surface
meshes from three quasi-orthogonal MR imaging slices from limited training sets
whilst modelling the location of each mesh vertex through a Gaussian
distribution. Prior shape information is encoded using a built-in linear
principal component analysis (PCA) model. Extensive experiments on cardiac MR
data show that our probabilistic approach successfully assesses prediction
uncertainty while at the same time qualitatively and quantitatively outperforms
SOTA methods in shape prediction. Compared to SOTA, we are capable of properly
localising and orientating the prediction via the use of a spatially aware
neural network.Comment: MICCAI 202
- …