In this paper we develop a general exact fan-beam reconstruction algorithm for free-form trajectories not only closed but also unclosed, based on the fan-beam reconstruction formula recently developed by Noo et al. [1...
详细信息
ISBN:
(纸本)0780387007
In this paper we develop a general exact fan-beam reconstruction algorithm for free-form trajectories not only closed but also unclosed, based on the fan-beam reconstruction formula recently developed by Noo et al. [1]. With this algorithm we can obtain exact region of interest (ROI) reconstruction if and only if every projecting line passing through the ROI intersects the free-form source trajectory, when the projections are not truncated. Furthermore, under the condition that the source-to-detectors distance changes slowly enough relative to the length of itself, we obtain a very good approximate reconstruction formula. And we also develop an reconstruction algorithm for nonstandard spirals with different pitches, based on some developments in the recent two years. In the end the fan-beam formula is tested using the Shepp-Logan phantom the formula can get perfect numerical results.
In the era of the Internet of Medical Things (IoMT), modern healthcare devices generate vast amounts of data, necessitating enhanced data processing, storage, transmission bandwidth, and increased power consumption, e...
详细信息
ISBN:
(数字)9798350365504
ISBN:
(纸本)9798350365511
In the era of the Internet of Medical Things (IoMT), modern healthcare devices generate vast amounts of data, necessitating enhanced data processing, storage, transmission bandwidth, and increased power consumption, especially in sensing applications. Compressive Sensing (CS) addresses these challenges by enabling signal acquisition with fewer samples than the traditional Nyquist rate, thereby conserving power. This is particularly beneficial for mobile healthcare applications, such as Electrocardiogram (ECG) monitoring, which require continuous monitoring and substantial power and bandwidth for signal transmission and reconstruction. Despite various CS strategies and reconstruction algorithms explored for ECG signals, achieving high accuracy with a high compression ratio remains a challenge. This research analyzes six sensing strategies two sparse bases nine reconstruction algorithms, to identify the most efficient method for ECG signal processing within the CS framework. From our analysis it shows that RL1 with db2 sparse basis shows the averagely superior performance with RGM, RBMB and RBMS and RLDPC sensing matrices and CVX-L1 shows the good parformance with SFM sensing matrix.
The proliferation of image reconstruction algorithms imposes a need for an efficient and objective evaluation procedure for comparing the efficacy of different algorithms for a particular medical task. In assessing th...
详细信息
The proliferation of image reconstruction algorithms imposes a need for an efficient and objective evaluation procedure for comparing the efficacy of different algorithms for a particular medical task. In assessing the relative task-oriented performance of reconstruction algorithms, it is desirable to assign statistical significance to claims of superiority of one algorithm over another. However, very often the achievement of statistical significance demands a large number of observations. Performing such an evaluation on mathematical phantoms requires a means of running the competing algorithms on projection data obtained from a large number of randomly generated phantoms. Thereafter, various numerical measures of agreement between the reconstructed images and the original phantoms may be used to reach a conclusion which has some statistical substance. Here, the authors illustrate the software SuperSNARK which automates an evaluation methodology for assigning statistical significance to the observed differences in performance of two or more image reconstruction algorithms. In particular, the authors compare the relative efficacy of the maximum likelihood expectation maximization algorithm and the filtered backprojection method for performing three specific imaging tasks in positron emission tomography.< >
In this paper we develop a method that introduces a priori geometrical information about a conductivity distribution in EIT reconstruction algorithms in order to improve their quantification ability. We propose correc...
详细信息
In this paper we develop a method that introduces a priori geometrical information about a conductivity distribution in EIT reconstruction algorithms in order to improve their quantification ability. We propose correction expressions for two reconstruction algorithms: backprojection algorithm and exponential algorithm. There is no theoretical evidence of the uniqueness of the solution to the inverse boundary problem which EIT deals with. We focused our attention to the problem of a circular centred uniform perturbation in a uniform background. It is easily seen that for cosine profiles there are different combinations of conductivity change and perturbation radius that yield the same voltage change. A similar result is obtained for adjacent injection profiles. This supports the fact that the kind of correction we propose is necessary not only as a consequence of the behaviour of the reconstruction algorithm but also because of the nature of the problem.
We present a review of methods for the forward and inverse problems in optical tomography. We limit ourselves to the highly scattering case found in applications in medical imaging, and to the problem of absorption an...
详细信息
We present a review of methods for the forward and inverse problems in optical tomography. We limit ourselves to the highly scattering case found in applications in medical imaging, and to the problem of absorption and scattering reconstruction. We concentrate on the use numerical method based on finite elements.
Numerous techniques were invented in computer vision and photogrammetry to obtain spatial information from digital images. We intend to describe and improve the performance of these vision techniques by providing test...
详细信息
Numerous techniques were invented in computer vision and photogrammetry to obtain spatial information from digital images. We intend to describe and improve the performance of these vision techniques by providing test objectives, data, metrics and test protocols. In this paper we propose a comprehensive benchmarking dataset for evaluating a variety of automatic surface reconstruction algorithms (shape-from-X) and a methodology for comparing their results.
The theory of projection onto convex sets (POCS) is very useful for comparing iterative reconstruction algorithms. Although originally developed with the Euclidian distance, it has been shown that POCS can be attended...
详细信息
The theory of projection onto convex sets (POCS) is very useful for comparing iterative reconstruction algorithms. Although originally developed with the Euclidian distance, it has been shown that POCS can be attended to pseudo-distances or can even use a different distance for each convex set. Five well known iterative algorithms that can be used to reconstruct images from partial noisy data have been formulated by POCS. Additional convex constraints and relaxation parameters can thus be introduced in these algorithms.
We investigate performance tradeoffs for a class of filtered backprojection (FBP) image reconstruction algorithms. The recently developed fast hierarchical backprojection asymptotically achieves the same O(N/sup 2/ lo...
详细信息
We investigate performance tradeoffs for a class of filtered backprojection (FBP) image reconstruction algorithms. The recently developed fast hierarchical backprojection asymptotically achieves the same O(N/sup 2/ log N) cost as Fourier-based methods while retaining many advantages of the FBP technique. In this paper, we provide a detailed cost and performance analysis of the algorithm on a general purpose platform. Based on carefully tuned implementations of both the direct and the hierarchical backprojection, we explore the tradeoffs between distortion and runtime by varying several algorithm and implementation choices. Experimental results show that, given the desired performance, the choice of algorithm parameters is not obvious and largely depends on the image properties and the underlying computer platform.
Image reconstruction directly from list-mode data requires different data correction techniques to standard projection-data based reconstruction, particularly in the case of iterative reconstruction. Attenuation and s...
详细信息
Image reconstruction directly from list-mode data requires different data correction techniques to standard projection-data based reconstruction, particularly in the case of iterative reconstruction. Attenuation and scatter correction techniques have been developed for two list-mode data driven reconstruction algorithms (FAIR-B (iterative) and Atrax (analytic/iterative)) recently proposed by the authors, and the results compared with two popular projection-data based algorithms (FORE+OSEM (iterative) and FORE+FBP (analytic)). List-mode data driven algorithms require event-by-event correction schemes, or alternatively image space procedures, as no direct operations to the completely sampled projection data set can be practically carried out. The methods developed in this work allow correction of list-mode data driven EM-ML type algorithms, such as FAIR, as well as analytic list-mode algorithms. The correction schemes have been applied to simulated data from various activity and attenuating medium distributions for a rotating 3D PET system. Both list-mode algorithms show improvements over the projection-data based methods in some situations.
暂无评论