Biomedical subjects

Yangbo Ye

Publications and source records attributed to Yangbo Ye.

8 recordsLinked to original sources

PubMed2006

Practical cone-beam lambda tomography.

As a potentially important technology for medical x-ray computed tomography (CT), lambda tomography (LT) is to reconstruct a gradient-like image only from local projection data. Based on our recently derived exact fan-beam LT formula, [H. Y. Gu and G. Wang, Int. J. Biomed. Imaging 2006(1), 1-9 (2006)] here we propose a practical cone-beam LT algorithm for LT reconstruction from local data collected along an arbitrary smooth three-dimensional curve. A key step in our algorithm is to determine an appropriate vector perpendicular to the line connecting the x-ray source and an image point. The algorithm is implemented assuming an equispatial planar detector and a nonstandard spiral trajectory. The numerical simulation results demonstrate the merits of our method.

Algorithms↗

PubMed2005

A backprojection-filtration algorithm for nonstandard spiral cone-beam CT with an n-PI-window.

For applications in bolus-chasing computed tomography (CT) angiography and electron-beam micro-CT, the backprojection-filtration (BPF) formula developed by Zou and Pan was recently generalized by Ye et al to reconstruct images from cone-beam data collected along a rather flexible scanning locus, including a nonstandard spiral. A major implication of the generalized BPF formula is that it can be applied for n-PI-window-based reconstruction in the nonstandard spiral scanning case. In this paper, we design an n-PI-window-based BPF algorithm, and report the numerical simulation results with the 3D Shepp-Logan phantom and Defrise disk phantom. The proposed BPF algorithm consists of three steps: cone-beam data differentiation, weighted backprojection and inverse Hilbert filtration. Our simulated results demonstrate the feasibility and merits of the proposed algorithm.

Algorithms↗

PubMed2005

A general exact reconstruction for cone-beam CT via backprojection-filtration.

In this paper, we prove a generalized backprojection-filtration formula for exact cone-beam image reconstruction with an arbitrary scanning locus. Our proof is independent of the shape of the scanning locus, as long as the object is contained in a region where there is a chord through any interior point. As special cases, this generalized formula can be applied with cone-beam scanning along nonstandard spiral and saddle curves, as well as in an n-PI window setting. The algorithmic implementation and numerical results are described to support the correctness of our general claim.

Algorithms↗

PubMed2005

Filtered backprojection formula for exact image reconstruction from cone-beam data along a general scanning curve.

Recently, Katsevich proved a filtered backprojection formula for exact image reconstruction from cone-beam data along a helical scanning locus, which is an important breakthrough since 1991 when the spiral cone-beam scanning mode was proposed. In this paper, we prove a generalized Katsevich's formula for exact image reconstruction from cone-beam data collected along a rather flexible curve. We will also give a general condition on filtering directions. Based on this condition, we suggest a natural choice of filtering directions, which is more convenient than Katsevich's choice and can be applied to general scanning curves. In the derivation, we use analytical techniques instead of geometric arguments. As a result, we do not need the uniqueness of the PI lines. In fact, our formula can be used to reconstruct images on any chord as long as a scanning curve runs from one endpoint of the chord to the other endpoint. This can be considered as a generalization of Orlov's classical theorem. Specifically, our formula can be applied to (i) nonstandard spirals of variable radii and pitches (with PI- or n-PI-windows), and (ii) saddlelike curves.

Algorithms↗

PubMed2005

Computed tomography simulation with superquadrics.

Accurate and efficient simulation of an x-ray transform for representative structures plays an important role in research and development of x-ray CT, for the evaluation and improvement of CT image reconstruction algorithms, in particular. Superquadrics are a family of three-dimensional objects, which can be used to model a variety of anatomical structures. In this paper, we propose an algorithm for the computation of x-ray transforms for superellipsoids and tori with a monochromatic x-ray. Their usefulness is demonstrated by projection and reconstruction of a superquadric-based thorax phantom. Our work indicates that superquadric modeling provides a more realistic visualization than quadratic modeling, and a faster computation than spline methods.

Algorithms↗

PubMed2005

Exact BPF and FBP algorithms for nonstandard saddle curves.

A hot topic in cone-beam CT research is exact cone-beam reconstruction from a general scanning trajectory. Particularly, a nonstandard saddle curve attracts attention, as this construct allows the continuous periodic scanning of a volume-of-interest (VOI). Here we evaluate two algorithms for reconstruction from data collected along a nonstandard saddle curve, which are in the filtered backprojection (FBP) and backprojection filtration (BPF) formats, respectively. Both the algorithms are implemented in a chord-based coordinate system. Then, a rebinning procedure is utilized to transform the reconstructed results into the natural coordinate system. The simulation results demonstrate that the FBP algorithm produces better image quality than the BPF algorithm, while both the algorithms exhibit similar noise characteristics.

Algorithms↗

PubMed2004

Minimum detection windows, PI-line existence and uniqueness for helical cone-beam scanning of variable pitch.

The goal of this paper is to study Cone-beam CT scanning along a helix of variable pitch. First the rationale and applications in medical imaging of variable pitch CT reconstruction are explained. Then formulas for the minimum detection window are derived. The main part of the paper proves a necessary and sufficient condition for the existence and uniqueness of PI-lines inside this variable pitch helix. These results are necessary steps toward an exact reconstruction algorithm for helix scanning of variable pitch, generalizing Katsevich's formula on constant pitch exact reconstruction. It is shown through an example that, when the derivative of the pitch function is not convex, or when the pitch function passes a inflection point and begins to slow down, PI-lines may be not unique near the rim of the helix cylinder. The conclusion is that the restriction on the pitch function is weaker, if the object is placed well within the helix cylinder and far from its rim, in order to preserve the uniqueness of PI-lines. If the object is near the rim, the restriction condition on the allowable pitch functions becomes stronger.

Angiography↗

PubMed2003

A pointwise limit theorem for filtered backprojection in computed tomography.

Computed tomography (CT) is one of the most important areas in the modern science and technology. The most popular approach for image reconstruction is filtered backprojection. It is essential to understand the limit behavior of the filtered backprojection algorithms. The classic results on the limit of image reconstruction are typically done in the norm sense. In this paper, we use the method of limited bandwidth to handle filtered backprojection-based image reconstruction when the spectrum of an underlying image is not absolutely integrable. Our main contribution is, assuming the method of limited bandwidth, to prove a pointwise limit theorem for a class of functions practically relevant and quite general. Further work is underway to extend the theory and explore its practical applications.

Algorithms↗