Local Morphometry of Closed, Implicit Surfaces

• URL: http://arxiv.org/abs/2108.04354v1
• Date: Thu, 29 Jul 2021 18:10:10 GMT
• Title: Local Morphometry of Closed, Implicit Surfaces
• Authors: Bryce A Besler, Tannis D. Kemp, Andrew S. Michalski, Nils D. Forkert, Steven K. Boyd
• Abstract summary: This paper presents a fast, simple embedding procedure for accurate local morphometry as the zero crossing of the Gaussian blurred binary image. The coefficient of determination for the average mean curvature is improved from 93.8% with the signed distance transform to 100% with the proposed method. The Euler-Poincar'e characteristic is improved from unusable in the signed distance transform to 98% accuracy for the proposed method.
• Score: 1.0499611180329804
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Anatomical structures such as the hippocampus, liver, and bones can be analyzed as orientable, closed surfaces. This permits the computation of volume, surface area, mean curvature, Gaussian curvature, and the Euler-Poincar\'e characteristic as well as comparison of these morphometrics between structures of different topology. The structures are commonly represented implicitly in curve evolution problems as the zero level set of an embedding. Practically, binary images of anatomical structures are embedded using a signed distance transform. However, quantization prevents the accurate computation of curvatures, leading to considerable errors in morphometry. This paper presents a fast, simple embedding procedure for accurate local morphometry as the zero crossing of the Gaussian blurred binary image. The proposed method was validated based on the femur and fourth lumbar vertebrae of 50 clinical computed tomography datasets. The results show that the signed distance transform leads to large quantization errors in the computed local curvature. Global validation of morphometry using regression and Bland-Altman analysis revealed that the coefficient of determination for the average mean curvature is improved from 93.8% with the signed distance transform to 100% with the proposed method. For the surface area, the proportional bias is improved from -5.0% for the signed distance transform to +0.6% for the proposed method. The Euler-Poincar\'e characteristic is improved from unusable in the signed distance transform to 98% accuracy for the proposed method. The proposed method enables an improved local and global evaluation of curvature for purposes of morphometry on closed, implicit surfaces.

Related papers

• An efficient heuristic for geometric analysis of cell deformations [2.424924394614033]
  Sickle cell disease causes erythrocytes to become sickle-shaped, affecting their movement in the bloodstream and reducing oxygen delivery.<n>It has a high global prevalence and places a significant burden on healthcare systems, especially in resource-limited regions.<n>Recent studies have proposed various erythrocyte representation and classification methods.
  arXiv  Detail & Related papers  (2026-01-19T10:30:52Z)
• Local Poisson Deconvolution for Discrete Signals [2.1374208474242815]
  We analyze the problem of recovering an atomic signal from a binned Poisson convolution model.<n>Our main results quantify the local minimax risk of estimating $mu$ for a broad class of smooth convolution kernels.<n>These results paint an optimistic perspective on the Poisson deconvolution problem.
  arXiv  Detail & Related papers  (2025-08-01T17:59:57Z)
• Surgical Gaussian Surfels: Highly Accurate Real-time Surgical Scene Rendering [2.205583950882153]
  We introduce Surgical Gaussian Surfels (SGS), which transforms anisotropic point primitives into surface-aligned elliptical splats. We evaluate our method on two in-vivo surgical datasets, where it outperforms current state-of-the-art methods in surface geometry, normal map quality, and rendering efficiency.
  arXiv  Detail & Related papers  (2025-03-06T04:33:19Z)
• Adaptive $k$-nearest neighbor classifier based on the local estimation of the shape operator [49.87315310656657]
  We introduce a new adaptive $k$-nearest neighbours ($kK$-NN) algorithm that explores the local curvature at a sample to adaptively defining the neighborhood size. Results on many real-world datasets indicate that the new $kK$-NN algorithm yields superior balanced accuracy compared to the established $k$-NN method.
  arXiv  Detail & Related papers  (2024-09-08T13:08:45Z)
• Correlations Are Ruining Your Gradient Descent [1.2432046687586285]
  Natural gradient descent illuminates how gradient vectors, pointing at directions of steepest descent, can be improved by considering the local curvature of loss landscapes. We show that correlations in the data at any linear transformation, including node responses at every layer of a neural network, cause a non-orthonormal relationship between the model's parameters. We describe a range of methods which have been proposed for decorrelation and whitening of node output, and expand on these to provide a novel method specifically useful for distributed computing and computational neuroscience.
  arXiv  Detail & Related papers  (2024-07-15T14:59:43Z)
• Inferring Change Points in High-Dimensional Regression via Approximate Message Passing [9.660892239615366]
  We propose an Approximate Message Passing (AMP) algorithm for estimating both the signals and the change point locations. We rigorously characterize its performance in the high-dimensional limit where the number of parameters $p$ is proportional to the number of samples $n$. We show how our AMP iterates can be used to efficiently compute a Bayesian posterior distribution over the change point locations in the high-dimensional limit.
  arXiv  Detail & Related papers  (2024-04-11T15:57:12Z)
• Linear Anchored Gaussian Mixture Model for Location and Width Computations of Objects in Thick Line Shape [1.7205106391379021]
  3D image gray level representation is considered as a finite mixture model of a statistical distribution. Expectation-Maximization algorithm (Algo1) using the original image as input data is used to estimate the model parameters. modified EM algorithm (Algo2) is detailed.
  arXiv  Detail & Related papers  (2024-04-03T20:05:00Z)
• Neural Gradient Learning and Optimization for Oriented Point Normal Estimation [53.611206368815125]
  We propose a deep learning approach to learn gradient vectors with consistent orientation from 3D point clouds for normal estimation. We learn an angular distance field based on local plane geometry to refine the coarse gradient vectors. Our method efficiently conducts global gradient approximation while achieving better accuracy and ability generalization of local feature description.
  arXiv  Detail & Related papers  (2023-09-17T08:35:11Z)
• Stochastic Marginal Likelihood Gradients using Neural Tangent Kernels [78.6096486885658]
  We introduce lower bounds to the linearized Laplace approximation of the marginal likelihood. These bounds are amenable togradient-based optimization and allow to trade off estimation accuracy against computational complexity.
  arXiv  Detail & Related papers  (2023-06-06T19:02:57Z)
• Corneal endothelium assessment in specular microscopy images with Fuchs' dystrophy via deep regression of signed distance maps [48.498376125522114]
  This paper proposes a UNet-based segmentation approach that requires minimal post-processing. It achieves reliable CE morphometric assessment and guttae identification across all degrees of Fuchs' dystrophy.
  arXiv  Detail & Related papers  (2022-10-13T15:34:20Z)
• Posterior and Computational Uncertainty in Gaussian Processes [52.26904059556759]
  Gaussian processes scale prohibitively with the size of the dataset. Many approximation methods have been developed, which inevitably introduce approximation error. This additional source of uncertainty, due to limited computation, is entirely ignored when using the approximate posterior. We develop a new class of methods that provides consistent estimation of the combined uncertainty arising from both the finite number of data observed and the finite amount of computation expended.
  arXiv  Detail & Related papers  (2022-05-30T22:16:25Z)
• Error-Correcting Neural Networks for Two-Dimensional Curvature Computation in the Level-Set Method [0.0]
  We present an error-neural-modeling-based strategy for approximating two-dimensional curvature in the level-set method. Our main contribution is a redesigned hybrid solver that relies on numerical schemes to enable machine-learning operations on demand.
  arXiv  Detail & Related papers  (2022-01-22T05:14:40Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Mean-squared-error-based adaptive estimation of pure quantum states and unitary transformations [0.0]
  We propose a method to estimate with high accuracy pure quantum states of a single qudit. Our method is based on the minimization of the squared error between the complex probability amplitudes of the unknown state and its estimate. We show that our estimation procedure can be easily extended to estimate unknown unitary transformations acting on a single qudit.
  arXiv  Detail & Related papers  (2020-08-23T00:32:10Z)

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.