pith. sign in

arxiv: 2402.12797 · v4 · submitted 2024-02-20 · 💻 cs.CV · cs.CG

A Geometric Algorithm for Blood Vessel Reconstruction from Skeletal Representation

Guoqing Zhang , Yang Li This is my paper

Pith reviewed 2026-05-24 03:45 UTC · model grok-4.3

classification 💻 cs.CV cs.CG
keywords blood vessel reconstructionskeletal representationTSDFvoxel hashingtubular shapegeometric algorithm3D reconstructioncomputer vision
0
0 comments X

The pith

A geometric algorithm reconstructs tubular shapes from skeletal data by computing the full TSDF in voxel hashing without segmenting the input or solving matrix equations.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper claims that treating every skeletal point together allows direct computation of a truncated signed distance function for blood vessels and similar tubes. The signed distance from each voxel center to the surface is found with a simple geometric rule inside a voxel hashing structure. This replaces the common practice of dividing the skeleton into separate segments, sampling the surface, or optimizing large systems of equations. The authors report that the approach runs faster and produces usable reconstructions on vessel data. Readers would care if the method scales to real medical volumes because it removes several standard sources of slowdown and complexity.

Core claim

The central claim is that a geometric algorithm can compute the signed distance from every voxel center to the object surface for the entire skeletal structure at once, yielding a complete TSDF representation of the tubular shape inside a voxel hashing grid without any surface sampling or large matrix solves.

What carries the argument

The geometric algorithm that determines the signed distance between a voxel center and the nearest surface point implied by the skeletal representation.

If this is right

  • The input skeleton can be processed as one object rather than split into segments.
  • No surface sampling step or solution of large linear systems is required.
  • The output is a TSDF stored in voxel hashing that can be used directly for further operations.
  • Experiments on blood-vessel data show the method is both faster and effective.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same geometric distance rule might apply to other implicitly defined tubular structures outside medicine.
  • Lower per-voxel cost could allow larger volumes or higher resolution in time-critical settings.
  • If the rule generalizes, it may reduce the need for topology-specific fixes in related implicit-surface tasks.

Load-bearing premise

The geometric signed-distance calculation stays accurate and complete for arbitrary branching topologies and skeletal configurations without extra handling or post-processing steps.

What would settle it

Run the method on a skeleton containing a dense, high-curvature branching region and check whether the resulting TSDF produces surface distances or zero-level sets that match independent ground-truth measurements within voxel tolerance.

Figures

Figures reproduced from arXiv: 2402.12797 by Guoqing Zhang, Yang Li.

Figure 1
Figure 1. Figure 1: Overview of our shape reconstruction algorithm. Left: original shape and sampled skeletal points. Middle: [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Illustration of different skeletal representations. Left: original shape. Middle: the input skeletal points are [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The geometric view of SDF computing. Given two adjacent slices Sa = (ca, na, ra), Sb = (cb, nb, rb) and a voxel center point v, we use fSDF(Sa, Sb, v) to denote the SDF value of voxel v for the shape between slices Sa and Sb, where |a − b| = 1. The plane P that is uniquely determined by ca, cb and v intersects with Sa and Sb at four points, denoted as i1, i2, i3 and i4, respectively. The absolute value of … view at source ↗
Figure 4
Figure 4. Figure 4: A failure case when faced with poor sam [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Surface extraction using different SDF val [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Qualitative experimental results. From top to bottom each row shows reconstruction results for datasets CAT08, [PITH_FULL_IMAGE:figures/full_fig_p008_6.png] view at source ↗
read the original abstract

We introduce a novel approach for the reconstruction of tubular shapes from skeletal representations. Our method processes all skeletal points as a whole, eliminating the need for splitting input structure into multiple segments. We represent the tubular shape as a truncated signed distance function (TSDF) in a voxel hashing manner, in which the signed distance between a voxel center and the object is computed through a simple geometric algorithm. Our method does not involve any surface sampling scheme or solving large matrix equations, and therefore is a faster and more elegant solution for tubular shape reconstruction compared to other approaches. Experiments demonstrate the efficiency and effectiveness of the proposed method. Code is avaliable at https://github.com/wlsdzyzl/Dragon.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper claims a geometric algorithm for reconstructing tubular shapes such as blood vessels from skeletal representations. It processes the entire skeleton at once in a voxel-hashing TSDF representation, computing signed distances via direct geometric operations without segmenting the input, sampling surfaces, or solving large matrix equations, and reports faster performance than prior methods along with experimental validation.

Significance. If the geometric TSDF computation is shown to be accurate and complete, the method supplies a parameter-free, direct-computation alternative for vessel reconstruction that avoids common preprocessing and optimization steps; the public code release provides an independent verification path for the distance algorithm and runtime claims.

major comments (2)
  1. [Method] Method section (geometric distance computation): the description of how the signed distance from a voxel center to the tubular surface is obtained from skeletal points does not specify the exact rule for combining influences at branch points or when multiple skeletal elements affect the same voxel; this is load-bearing for the central claim that the whole skeleton can be processed without segmentation or hidden post-processing.
  2. [Experiments] Experiments: the reported efficiency gains are presented without quantitative comparison tables against the specific baselines that also avoid segmentation, making it impossible to isolate whether the improvement stems from the geometric formulation or from implementation details.
minor comments (2)
  1. [Abstract] Abstract: 'avaliable' should be 'available'.
  2. [Method] The voxel-hashing implementation details (hash function, truncation distance choice) are referenced but not given explicitly enough for direct re-implementation from the text alone.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments on our manuscript. We address each major point below and will revise the paper to improve clarity and experimental rigor.

read point-by-point responses

  1. Referee: [Method] Method section (geometric distance computation): the description of how the signed distance from a voxel center to the tubular surface is obtained from skeletal points does not specify the exact rule for combining influences at branch points or when multiple skeletal elements affect the same voxel; this is load-bearing for the central claim that the whole skeleton can be processed without segmentation or hidden post-processing.

    Authors: We agree the combination rule merits explicit statement. The algorithm computes the geometric (Euclidean) distance from each voxel center to every skeletal element and retains the minimum value; this minimum-distance selection automatically resolves branch-point overlaps and multi-element influences without segmentation or post-processing. We will add a concise paragraph in the revised Method section detailing this rule and confirming it operates on the full skeleton. revision: yes

  2. Referee: [Experiments] Experiments: the reported efficiency gains are presented without quantitative comparison tables against the specific baselines that also avoid segmentation, making it impossible to isolate whether the improvement stems from the geometric formulation or from implementation details.

    Authors: The referee is correct that isolating the contribution of the geometric formulation requires direct comparisons to other segmentation-free methods. We will augment the Experiments section with a new table reporting runtime and reconstruction accuracy on identical vessel datasets against the segmentation-free baselines cited in the related-work section, using the same hardware and metrics. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The provided abstract and description present the method as a direct geometric computation of TSDF from the full skeletal input in voxel hashing, with no equations, fitted parameters, self-citations, or ansatzes shown that reduce any claimed prediction or result to its own inputs by construction. The approach is positioned as avoiding surface sampling and matrix solving, and the code release offers an independent verification path. No load-bearing derivation chain is visible that matches any of the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The abstract supplies no explicit free parameters, axioms, or invented entities; the method is presented as a direct geometric procedure on existing skeletal input and standard voxel hashing.

pith-pipeline@v0.9.0 · 5634 in / 1152 out tokens · 18377 ms · 2026-05-24T03:45:52.262214+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

49 extracted references · 49 canonical work pages · 1 internal anchor

  1. [1]

    Smooth surface reconstruction from noisy range data

    Jonathan C Carr, Richard K Beatson, Bruce C McCallum, W Richard Fright, Tim J McLennan, and Tim J Mitchell. Smooth surface reconstruction from noisy range data. In Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia, pages 119--ff, 2003

    work page 2003

  2. [2]

    Poisson surface reconstruction

    Michael Kazhdan, Matthew Bolitho, and Hugues Hoppe. Poisson surface reconstruction. In Proceedings of the fourth Eurographics symposium on Geometry processing, volume 7, page 0, 2006

    work page 2006

  3. [3]

    Iterative poisson surface reconstruction (ipsr) for unoriented points

    Fei Hou, Chiyu Wang, Wencheng Wang, Hong Qin, Chen Qian, and Ying He. Iterative poisson surface reconstruction (ipsr) for unoriented points. arXiv preprint arXiv:2209.09510, 2022

    work page arXiv 2022

  4. [4]

    Real-time 3d reconstruction at scale using voxel hashing

    Matthias Nie ner, Michael Zollh \"o fer, Shahram Izadi, and Marc Stamminger. Real-time 3d reconstruction at scale using voxel hashing. ACM Transactions on Graphics (ToG), 32 0 (6): 0 1--11, 2013

    work page 2013

  5. [5]

    Flashfusion: Real-time globally consistent dense 3d reconstruction using cpu computing

    Lei Han and Lu Fang. Flashfusion: Real-time globally consistent dense 3d reconstruction using cpu computing. In Robotics: Science and Systems, volume 1, page 7, 2018

    work page 2018

  6. [6]

    Nerf: Representing scenes as neural radiance fields for view synthesis

    Ben Mildenhall, Pratul P Srinivasan, Matthew Tancik, Jonathan T Barron, Ravi Ramamoorthi, and Ren Ng. Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM, 65 0 (1): 0 99--106, 2021

    work page 2021

  7. [7]

    Psdf fusion: Probabilistic signed distance function for on-the-fly 3d data fusion and scene reconstruction

    Wei Dong, Qiuyuan Wang, Xin Wang, and Hongbin Zha. Psdf fusion: Probabilistic signed distance function for on-the-fly 3d data fusion and scene reconstruction. In Proceedings of the European conference on computer vision (ECCV), pages 701--717, 2018

    work page 2018

  8. [8]

    Pf-net: Point fractal network for 3d point cloud completion

    Zitian Huang, Yikuan Yu, Jiawen Xu, Feng Ni, and Xinyi Le. Pf-net: Point fractal network for 3d point cloud completion. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 7662--7670, 2020

    work page 2020

  9. [9]

    Point cloud completion by skip-attention network with hierarchical folding

    Xin Wen, Tianyang Li, Zhizhong Han, and Yu-Shen Liu. Point cloud completion by skip-attention network with hierarchical folding. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 1939--1948, 2020

    work page 1939

  10. [10]

    Template-based mesh completion

    Vladislav Kraevoy and Alla Sheffer. Template-based mesh completion. In Symposium on Geometry Processing, volume 385, pages 13--22, 2005

    work page 2005

  11. [11]

    Shape completion using 3d-encoder-predictor cnns and shape synthesis

    Angela Dai, Charles Ruizhongtai Qi, and Matthias Nie ner. Shape completion using 3d-encoder-predictor cnns and shape synthesis. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 5868--5877, 2017

    work page 2017

  12. [12]

    Mathematical theory of medial axis transform

    Hyeong In Choi, Sung Woo Choi, and Hwan Pyo Moon. Mathematical theory of medial axis transform. pacific journal of mathematics, 181 0 (1): 0 57--88, 1997

    work page 1997

  13. [13]

    Accelerated skeletonization algorithm for tubular structures in large datasets by randomized erosion

    Gerald Zwettler, Franz Pfeifer, Roland Swoboda, and Werner Backfrieder. Accelerated skeletonization algorithm for tubular structures in large datasets by randomized erosion. In International Conference on Computer Vision Theory and Applications, volume 2, pages 74--81. SCITEPRESS, 2008

    work page 2008

  14. [14]

    Deep distance transform for tubular structure segmentation in ct scans

    Yan Wang, Xu Wei, Fengze Liu, Jieneng Chen, Yuyin Zhou, Wei Shen, Elliot K Fishman, and Alan L Yuille. Deep distance transform for tubular structure segmentation in ct scans. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 3833--3842, 2020

    work page 2020

  15. [15]

    cldice-a novel topology-preserving loss function for tubular structure segmentation

    Suprosanna Shit, Johannes C Paetzold, Anjany Sekuboyina, Ivan Ezhov, Alexander Unger, Andrey Zhylka, Josien PW Pluim, Ulrich Bauer, and Bjoern H Menze. cldice-a novel topology-preserving loss function for tubular structure segmentation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 16560--16569, 2021

    work page 2021

  16. [16]

    3d segmentation in the clinic: A grand challenge ii-coronary artery tracking

    Coert Metz, Michiel Schaap, Theo van Walsum, Alina van der Giessen, Annick Weustink, Nico Mollet, Gabriel Krestin, and Wiro Niessen. 3d segmentation in the clinic: A grand challenge ii-coronary artery tracking. Insight Journal, 1 0 (5): 0 6, 2008

    work page 2008

  17. [17]

    Standardized evaluation methodology and reference database for evaluating coronary artery centerline extraction algorithms

    Michiel Schaap, Coert T Metz, Theo van Walsum, Alina G van der Giessen, Annick C Weustink, Nico R Mollet, Christian Bauer, Hrvoje Bogunovi \'c , Carlos Castro, Xiang Deng, et al. Standardized evaluation methodology and reference database for evaluating coronary artery centerline extraction algorithms. Medical image analysis, 13 0 (5): 0 701--714, 2009

    work page 2009

  18. [18]

    Numerical analysis and design for tubular hydroforming

    HL Xing and A Makinouchi. Numerical analysis and design for tubular hydroforming. International Journal of Mechanical Sciences, 43 0 (4): 0 1009--1026, 2001

    work page 2001

  19. [19]

    Topology-preserving deep image segmentation

    Xiaoling Hu, Fuxin Li, Dimitris Samaras, and Chao Chen. Topology-preserving deep image segmentation. Advances in neural information processing systems, 32, 2019

    work page 2019

  20. [20]

    Design, manufacturing and applications of auxetic tubular structures: A review

    Chen Luo, Chuan Zhen Han, Xiang Yu Zhang, Xue Gang Zhang, Xin Ren, and Yi Min Xie. Design, manufacturing and applications of auxetic tubular structures: A review. Thin-Walled Structures, 163: 0 107682, 2021

    work page 2021

  21. [21]

    Towards automated coronary artery segmentation: A systematic review

    Ramtin Gharleghi, Nanway Chen, Arcot Sowmya, and Susann Beier. Towards automated coronary artery segmentation: A systematic review. Computer Methods and Programs in Biomedicine, page 107015, 2022

    work page 2022

  22. [22]

    L1-medial skeleton of point cloud

    Hui Huang, Shihao Wu, Daniel Cohen-Or, Minglun Gong, Hao Zhang, Guiqing Li, and Baoquan Chen. L1-medial skeleton of point cloud. ACM Trans. Graph., 32 0 (4): 0 65--1, 2013

    work page 2013

  23. [23]

    Mass-driven topology-aware curve skeleton extraction from incomplete point clouds

    Hongxing Qin, Jia Han, Ning Li, Hui Huang, and Baoquan Chen. Mass-driven topology-aware curve skeleton extraction from incomplete point clouds. IEEE transactions on visualization and computer graphics, 26 0 (9): 0 2805--2817, 2019

    work page 2019

  24. [24]

    Point2skeleton: Learning skeletal representations from point clouds

    Cheng Lin, Changjian Li, Yuan Liu, Nenglun Chen, Yi-King Choi, and Wenping Wang. Point2skeleton: Learning skeletal representations from point clouds. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 4277--4286, 2021

    work page 2021

  25. [25]

    Topology-preserving hard pixel mining for tubular structure segmentation

    Guoqing Zhang, Caixia Dong, and Yang Li. Topology-preserving hard pixel mining for tubular structure segmentation. In 34th British Machine Vision Conference 2023, BMVC 2023, Aberdeen, UK, November 20-24, 2023 . BMVA, 2023 a . URL https://papers.bmvc2023.org/0846.pdf

    work page 2023

  26. [26]

    Marching cubes: A high resolution 3d surface construction algorithm

    William E Lorensen and Harvey E Cline. Marching cubes: A high resolution 3d surface construction algorithm. ACM siggraph computer graphics, 21 0 (4): 0 163--169, 1987

    work page 1987

  27. [27]

    Deepsdf: Learning continuous signed distance functions for shape representation

    Jeong Joon Park, Peter Florence, Julian Straub, Richard Newcombe, and Steven Lovegrove. Deepsdf: Learning continuous signed distance functions for shape representation. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 165--174, 2019

    work page 2019

  28. [28]

    Local implicit grid representations for 3d scenes

    Chiyu Jiang, Avneesh Sud, Ameesh Makadia, Jingwei Huang, Matthias Nie ner, Thomas Funkhouser, et al. Local implicit grid representations for 3d scenes. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 6001--6010, 2020

    work page 2020

  29. [29]

    Occupancy networks: Learning 3d reconstruction in function space

    Lars Mescheder, Michael Oechsle, Michael Niemeyer, Sebastian Nowozin, and Andreas Geiger. Occupancy networks: Learning 3d reconstruction in function space. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 4460--4470, 2019

    work page 2019

  30. [30]

    Local deep implicit functions for 3d shape

    Kyle Genova, Forrester Cole, Avneesh Sud, Aaron Sarna, and Thomas Funkhouser. Local deep implicit functions for 3d shape. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 4857--4866, 2020

    work page 2020

  31. [31]

    Mip-nerf: A multiscale representation for anti-aliasing neural radiance fields

    Jonathan T Barron, Ben Mildenhall, Matthew Tancik, Peter Hedman, Ricardo Martin-Brualla, and Pratul P Srinivasan. Mip-nerf: A multiscale representation for anti-aliasing neural radiance fields. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 5855--5864, 2021

    work page 2021

  32. [32]

    D-nerf: Neural radiance fields for dynamic scenes

    Albert Pumarola, Enric Corona, Gerard Pons-Moll, and Francesc Moreno-Noguer. D-nerf: Neural radiance fields for dynamic scenes. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 10318--10327, 2021

    work page 2021

  33. [33]

    Unisurf: Unifying neural implicit surfaces and radiance fields for multi-view reconstruction

    Michael Oechsle, Songyou Peng, and Andreas Geiger. Unisurf: Unifying neural implicit surfaces and radiance fields for multi-view reconstruction. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 5589--5599, 2021

    work page 2021

  34. [34]

    NeuS: Learning Neural Implicit Surfaces by Volume Rendering for Multi-view Reconstruction

    Peng Wang, Lingjie Liu, Yuan Liu, Christian Theobalt, Taku Komura, and Wenping Wang. Neus: Learning neural implicit surfaces by volume rendering for multi-view reconstruction. arXiv preprint arXiv:2106.10689, 2021

    work page internal anchor Pith review Pith/arXiv arXiv 2021

  35. [35]

    Nerf-slam: Real-time dense monocular slam with neural radiance fields,

    Antoni Rosinol, John J Leonard, and Luca Carlone. Nerf-slam: Real-time dense monocular slam with neural radiance fields. arXiv preprint arXiv:2210.13641, 2022

    work page arXiv 2022

  36. [36]

    Nerf-loam: Neural implicit representation for large-scale incremental lidar odometry and mapping

    Junyuan Deng, Qi Wu, Xieyuanli Chen, Songpengcheng Xia, Zhen Sun, Guoqing Liu, Wenxian Yu, and Ling Pei. Nerf-loam: Neural implicit representation for large-scale incremental lidar odometry and mapping. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 8218--8227, 2023

    work page 2023

  37. [37]

    The ball-pivoting algorithm for surface reconstruction

    Fausto Bernardini, Joshua Mittleman, Holly Rushmeier, Cl \'a udio Silva, and Gabriel Taubin. The ball-pivoting algorithm for surface reconstruction. IEEE transactions on visualization and computer graphics, 5 0 (4): 0 349--359, 1999

    work page 1999

  38. [38]

    Surface reconstruction from point clouds without normals by parametrizing the gauss formula

    Siyou Lin, Dong Xiao, Zuoqiang Shi, and Bin Wang. Surface reconstruction from point clouds without normals by parametrizing the gauss formula. ACM Transactions on Graphics, 42 0 (2): 0 1--19, 2022

    work page 2022

  39. [39]

    Globally consistent normal orientation for point clouds by regularizing the winding-number field

    Rui Xu, Zhiyang Dou, Ningna Wang, Shiqing Xin, Shuangmin Chen, Mingyan Jiang, Xiaohu Guo, Wenping Wang, and Changhe Tu. Globally consistent normal orientation for point clouds by regularizing the winding-number field. ACM Transactions on Graphics (TOG), 42 0 (4): 0 1--15, 2023

    work page 2023

  40. [40]

    Surfacenet: An end-to-end 3d neural network for multiview stereopsis

    Mengqi Ji, Juergen Gall, Haitian Zheng, Yebin Liu, and Lu Fang. Surfacenet: An end-to-end 3d neural network for multiview stereopsis. In Proceedings of the IEEE international conference on computer vision, pages 2307--2315, 2017

    work page 2017

  41. [41]

    An algorithm for finding best matches in logarithmic expected time

    Jerome H Friedman, Jon Louis Bentley, and Raphael Ari Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software (TOMS), 3 0 (3): 0 209--226, 1977

    work page 1977

  42. [42]

    Olinde Rodrigues. Des lois g \'e om \'e triques qui r \'e gissent les d \'e placements d'un syst \`e me solide dans l'espace, et de la variation des coordonn \'e es provenant de ces d \'e placements consid \'e r \'e s ind \'e pendamment des causes qui peuvent les produire. Journal de math \'e matiques pures et appliqu \'e es , 5: 0 380--440, 1840

    work page

  43. [43]

    The rodrigues formula and polynomial differential operators

    Richard Rasala. The rodrigues formula and polynomial differential operators. Journal of Mathematical Analysis and Applications, 84 0 (2): 0 443--482, 1981

    work page 1981

  44. [44]

    Imagecas: A large-scale dataset and benchmark for coronary artery segmentation based on computed tomography angiography images

    An Zeng, Chunbiao Wu, Meiping Huang, Jian Zhuang, Shanshan Bi, Dan Pan, Najeeb Ullah, Kaleem Nawaz Khan, Tianchen Wang, Yiyu Shi, et al. Imagecas: A large-scale dataset and benchmark for coronary artery segmentation based on computed tomography angiography images. arXiv preprint arXiv:2211.01607, 2022

    work page arXiv 2022

  45. [45]

    Multi-site, multi-domain airway tree modeling (atm'22): A public benchmark for pulmonary airway segmentation

    Minghui Zhang, Yangqian Wu, Hanxiao Zhang, Yulei Qin, Hao Zheng, Wen Tang, Corey Arnold, Chenhao Pei, Pengxin Yu, Yang Nan, et al. Multi-site, multi-domain airway tree modeling (atm'22): A public benchmark for pulmonary airway segmentation. arXiv preprint arXiv:2303.05745, 2023 b

    work page arXiv 2023

  46. [46]

    Parse challenge 2022: Pulmonary arteries segmentation using swin u-net transformer (swin unetr) and u-net

    Akansh Maurya, Kunal Dashrath Patil, Rohan Padhy, Kalluri Ramakrishna, and Ganapathy Krishnamurthi. Parse challenge 2022: Pulmonary arteries segmentation using swin u-net transformer (swin unetr) and u-net. arXiv preprint arXiv:2208.09636, 2022

    work page arXiv 2022

  47. [47]

    Deepvesselnet: Vessel segmentation, centerline prediction, and bifurcation detection in 3-d angiographic volumes

    Giles Tetteh, Velizar Efremov, Nils D Forkert, Matthias Schneider, Jan Kirschke, Bruno Weber, Claus Zimmer, Marie Piraud, and Bjoern H Menze. Deepvesselnet: Vessel segmentation, centerline prediction, and bifurcation detection in 3-d angiographic volumes. Frontiers in Neuroscience, page 1285, 2020

    work page 2020

  48. [48]

    Tongjie Y Zhang and Ching Y. Suen. A fast parallel algorithm for thinning digital patterns. Communications of the ACM, 27 0 (3): 0 236--239, 1984

    work page 1984

  49. [49]

    Screened poisson surface reconstruction

    Michael Kazhdan and Hugues Hoppe. Screened poisson surface reconstruction. ACM Transactions on Graphics (ToG), 32 0 (3): 0 1--13, 2013

    work page 2013