51 research outputs found
Mesh-MLP: An all-MLP Architecture for Mesh Classification and Semantic Segmentation
With the rapid development of geometric deep learning techniques, many
mesh-based convolutional operators have been proposed to bridge irregular mesh
structures and popular backbone networks. In this paper, we show that while
convolutions are helpful, a simple architecture based exclusively on
multi-layer perceptrons (MLPs) is competent enough to deal with mesh
classification and semantic segmentation. Our new network architecture, named
Mesh-MLP, takes mesh vertices equipped with the heat kernel signature (HKS) and
dihedral angles as the input, replaces the convolution module of a ResNet with
Multi-layer Perceptron (MLP), and utilizes layer normalization (LN) to perform
the normalization of the layers. The all-MLP architecture operates in an
end-to-end fashion and does not include a pooling module. Extensive
experimental results on the mesh classification/segmentation tasks validate the
effectiveness of the all-MLP architecture.Comment: 8 pages, 6 figure
Neural-IMLS: Self-supervised Implicit Moving Least-Squares Network for Surface Reconstruction
Surface reconstruction is very challenging when the input point clouds,
particularly real scans, are noisy and lack normals. Observing that the
Multilayer Perceptron (MLP) and the implicit moving least-square function
(IMLS) provide a dual representation of the underlying surface, we introduce
Neural-IMLS, a novel approach that directly learns the noise-resistant signed
distance function (SDF) from unoriented raw point clouds in a self-supervised
fashion. We use the IMLS to regularize the distance values reported by the MLP
while using the MLP to regularize the normals of the data points for running
the IMLS. We also prove that at the convergence, our neural network, benefiting
from the mutual learning mechanism between the MLP and the IMLS, produces a
faithful SDF whose zero-level set approximates the underlying surface. We
conducted extensive experiments on various benchmarks, including synthetic
scans and real scans. The experimental results show that {\em Neural-IMLS} can
reconstruct faithful shapes on various benchmarks with noise and missing parts.
The source code can be found at~\url{https://github.com/bearprin/Neural-IMLS}
Neural-Singular-Hessian: Implicit Neural Representation of Unoriented Point Clouds by Enforcing Singular Hessian
Neural implicit representation is a promising approach for reconstructing
surfaces from point clouds. Existing methods combine various regularization
terms, such as the Eikonal and Laplacian energy terms, to enforce the learned
neural function to possess the properties of a Signed Distance Function (SDF).
However, inferring the actual topology and geometry of the underlying surface
from poor-quality unoriented point clouds remains challenging. In accordance
with Differential Geometry, the Hessian of the SDF is singular for points
within the differential thin-shell space surrounding the surface. Our approach
enforces the Hessian of the neural implicit function to have a zero determinant
for points near the surface. This technique aligns the gradients for a
near-surface point and its on-surface projection point, producing a rough but
faithful shape within just a few iterations. By annealing the weight of the
singular-Hessian term, our approach ultimately produces a high-fidelity
reconstruction result. Extensive experimental results demonstrate that our
approach effectively suppresses ghost geometry and recovers details from
unoriented point clouds with better expressiveness than existing fitting-based
methods
Health-Related Quality of Life and Posttraumatic Growth in Low-Grade Gliomas in China: A Prospective Study
Objective: The present study aimed to describe the quality of life (QoL) changes of survivors of low-grade gliomas (LGGs) 1 year after surgery and to identify determinants of QoL with an emphasis on the role of perceived posttraumatic growth (PTG). We also tried to examine the linear and quadratic relationship between QoL and PTG. Methods: Two hundred sixty participants were included in the final data analysis. The Chinese version of posttraumatic growth inventory and the Functional Assessment of Cancer Therapy–Brain scale were used to measure PTG and QoL. Hierarchical linear models were fitted to explore the individual time trajectories in change of QoL and examine the relationship between demographics, clinical features, PTG, and QoL. Results: All dimensions of QoL and PTG increased over time except physical well-being, social well-being in QoL, and new possibilities in PTG. Time, PTG score, insurance, socioeconomic status, and right hemisphere tumor position were positive predictors of QoL. Seizure and depression negatively predicted QoL. The quadratic of PTG predicted QoL; however, the coefficient of quadratic PTG approached zero. Conclusions: In general, PTG and QoL increased over time. Perceived PTG could significantly predict QoL of LGGs survivors 1 year after surgery. A quadratic relation between PTG and QoL was not found. Although our data suggested that the growth of QoL may vary across different patients, there were only 2 time points in this study. Future studies should set more time points to examine this relationship
An optimization-driven approach for computing geodesic paths on triangle meshes
There are many application scenarios where we need to refine an initial path lying on a surface to be as short as possible. A typical way to solve this problem is to iteratively shorten one segment of the path at a time. As local approaches, they are conceptually simple and easy to implement, but they converge slowly and have poor performance on large scale models. In this paper, we develop an optimization driven approach to improve the performance of computing geodesic paths. We formulate the objective function as the total length and adopt the L-BFGS solver to minimize it. Computational results show that our method converges with super-linear rate, which significantly outperforms the existing methods. Moreover, our method is flexible to handle anisotropic
metric, non-uniform density function, as well as additional user-specified constraints, such as coplanar geodesics and equally-spaced geodesic helical curves, which are challenging to the existing local methods.Accepted versio
Fast and robust shape diameter function
The shape diameter function (SDF) is a scalar function defined on a closed manifold surface, measuring the neighborhood diameter of the object at each point. Due to its pose oblivious property, SDF is widely used in shape analysis, segmentation and retrieval. However, computing SDF is computationally expensive since one has to place an inverted cone at each point and then average the penetration distances for a number of rays inside the cone. Furthermore, the shape diameters are highly sensitive to local geometric features as well as the normal vectors, hence diminishing their applications to real-world meshes which often contain rich geometric details and/or various types of defects, such as noise and gaps. In order to increase the robustness of SDF and promote it to a wide range of 3D models, we define SDF by offsetting the input object a little bit. This seemingly minor change brings three significant benefits: First, it allows us to compute SDF in a robust manner since the offset surface is able to give reliable normal vectors. Second, it runs many times faster since at each point we only need to compute the penetration distance along a single direction, rather than tens of directions. Third, our method does not require watertight surfaces as the input—it supports both point clouds and meshes with noise and gaps. Extensive experimental results show that the offset-surface based SDF is robust to noise and insensitive to geometric details, and it also runs about 10 times faster than the existing method. We also exhibit its usefulness using two typical applications including shape retrieval and shape segmentation, and observe a significant improvement over the existing SDF.Published versio
Lightweight preprocessing and fast query of geodesic distance via proximity graph
Computing geodesic distance on a mesh surface efficiently and accurately is a central task in numerous computer graphics applications. In order to deal with high-resolution mesh surfaces, a lightweight preprocessing is a proper choice to make a balance between query accuracy and speed. In the preprocessing stage, we build a proximity graph with regard to a set of sample points and keep the exact geodesic distance between any pair of nearby sample points. In the query stage, given two query points and , we augment the proximity graph by adding and on-the-fly, and then use the shortest path between and on the augmented proximity graph to approximate the exact geodesic path between and . We establish an empirical relationship between the number of samples and expected accuracy (measured in relative error), which facilitates fast and accurate query of geodesic distance with a lightweight processing cost. We exhibit the uses of the new approach in two applications—real-time computation of discrete exponential map for texture mapping and interactive design of spline curves on surfaces
- …