paper-with-me

홈 › Papers

Constructing High-Order Signed Distance Maps from Computed Tomography Data with Application to Bone Morphometry

2021-11-02 · Bryce A. Besler, Tannis D. Kemp, Nils D. Forkert, Steven K. Boyd

An algorithm is presented for constructing high-order signed distance fields for two phase materials imaged with computed tomography. The signed distance field is high-order in that it is free of the quantization artifact associated with the distance transform of sampled signals. The narrowband is solved using a closest point algorithm extended for implicit embeddings that are not a signed distance field. The high-order fast sweeping algorithm is used to extend the narrowband to the remainder of the domain. The order of accuracy of the narrowband and extension methods are verified on ideal implicit surfaces. The method is applied to ten excised cubes of bovine trabecular bone. Localization of the surface, estimation of phase densities, and local morphometry is validated with these subjects. Since the embedding is high-order, gradients and thus curvatures can be accurately estimated locally in the image data.

📄 PDF Abstract BibTeX arXiv:2111.01350

Code (0)

등록된 구현이 없습니다.

Tasks

Quantization

Similar Papers 제목 키워드 기반

Automated Domain Question Mapping (DQM) with Educational Learning Materials

2026-01-11 · Jiho Noh, Mukhesh Raghava Katragadda, Dabae Lee arxiv

Concept maps have been widely utilized in education to depict knowledge structures and the interconnections between disciplinary concepts. Nonetheless, devising a computational method for automatically constructing a con…

Approximating the Minimum Breakpoint Linearization Problem for Genetic Maps without Gene Strandedness

2015-02-25

The study of genetic map linearization leads to a combinatorial hard problem, called the {\em minimum breakpoint linearization} (MBL) problem. It is aimed at finding a linearization of a partial order which attains the m…

Predicting Signed Distance Functions for Visual Instance Segmentation

2026-08-13 · Emil Brissman, Joakim Johnander, Michael Felsberg arxiv

Visual instance segmentation is a challenging problem and becomes even more difficult if objects of interest varies unconstrained in shape. Some objects are well described by a rectangle, however, this is hardly always t…

Instance Segmentation

DISN: Deep Implicit Surface Network for High-quality Single-view 3D Reconstruction

2019-05-26 · NeurIPS 2019 12 · Qiangeng Xu, Weiyue Wang, Duygu Ceylan, Radomir Mech 외

Reconstructing 3D shapes from single-view images has been a long-standing research problem. In this paper, we present DISN, a Deep Implicit Surface Network which can generate a high-quality detail-rich 3D mesh from an 2D…

3D ReconstructionSingle-View 3D Reconstruction

Point Cloud Classification via Deep Set Linearized Optimal Transport

2024-01-02 · Scott Mahan, Caroline Moosmüller, Alexander Cloninger

We introduce Deep Set Linearized Optimal Transport, an algorithm designed for the efficient simultaneous embedding of point clouds into an $L^2-$space. This embedding preserves specific low-dimensional structures within …

ClassificationPoint Cloud Classification