2017
DOI: 10.1088/1361-6501/aa950e
|View full text |Cite
|
Sign up to set email alerts
|

Computing segmentations directly from x-ray projection data via parametric deformable curves

Abstract: We describe an efficient algorithm that computes a segmented reconstruction directly from x-ray projection data. Our algorithm uses a parametric curve to define the segmentation. Unlike similar approaches which are based on level-sets, our method avoids a pixel or voxel grid; hence the number of unknowns is reduced to the set of points that define the curve, and attenuation coefficients of the segments. Our current implementation uses a simple closed curve and is capable of separating one object from the backg… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
23
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 14 publications
(23 citation statements)
references
References 36 publications
0
23
0
Order By: Relevance
“…The proposed method is targeted at objects composed of homogeneous components. Our work extends the method by Dahl et al [2] that employs a deformable closed curve to outline one object in the reconstruction. Here, we replace one single The authors are with the Department of Applied Mathematics and Computer Science, Technical University of Denmark, 2800 Lyngby, Denmark (e-mail: jakoo@dtu.dk; abda@dtu.dk; vand@dtu.dk).…”
Section: Introductionmentioning
confidence: 81%
“…The proposed method is targeted at objects composed of homogeneous components. Our work extends the method by Dahl et al [2] that employs a deformable closed curve to outline one object in the reconstruction. Here, we replace one single The authors are with the Department of Applied Mathematics and Computer Science, Technical University of Denmark, 2800 Lyngby, Denmark (e-mail: jakoo@dtu.dk; abda@dtu.dk; vand@dtu.dk).…”
Section: Introductionmentioning
confidence: 81%
“…Gadelha et al (2019) used a deep convolutional neural network for 2D tomographic reconstruction, where the forward projection is based on the transformation of a regular grid and resampling. On the other hand, the work (Dahl et al, 2018) based on snakes (Kass et al, 1988) avoids a dense grid -it represents curves explicitly and proposes a direct forward projection of the curves. However, this method is limited to a single 2D curve, while the proposed method supports 3D objects.…”
Section: Related Workmentioning
confidence: 99%
“…However, this method is limited to a single 2D curve, while the proposed method supports 3D objects. Another difference is that (Dahl et al, 2018) evolves curves in the normal directions of curve points, while our deformation can displace the vertices in all directions.…”
Section: Related Workmentioning
confidence: 99%
“…Hence, the DART algorithm [5] alternates between an algebraic reconstruction step and a thresholding step, TVR-DART [44] is based on the same thresholding step augmented by a TV regularization under a variational approach. Other modern methods include levelset-based techniques using the Mumford-Shah functional [40,27,42,37,38] or parametric curve approaches [1,2], convex approaches [33], and graph-based approaches [20,32].…”
Section: Discrete Tomographymentioning
confidence: 99%