scholarly journals Image reconstruction algorithm based on variable atomic number matching pursuit

2016 ◽  
Vol 11 (2) ◽  
pp. 103-109
Author(s):  
Hongtu Zhao ◽  
Chong Chen ◽  
Chenxu Shi
Keyword(s):  
Image Reconstruction ◽  
Convex Optimization ◽  
Atomic Number ◽  
Matching Pursuit ◽  
Greedy Algorithms ◽  
Optimization Algorithms ◽  
Reconstruction Algorithm ◽  
Reconstruction Algorithms ◽  
Reconstruction Quality ◽  
Stable Reconstruction

As the most critical part of compressive sensing theory, reconstruction algorithm has an impact on the quality and speed of image reconstruction. After studying some existing convex optimization algorithms and greedy algorithms, we find that convex optimization algorithms should possess higher complexity to achieve higher reconstruction quality. Also, fixed atomic numbers used in most greedy algorithms increase the complexity of reconstruction. In this context, we propose a novel algorithm, called variable atomic number matching pursuit, which can improve the accuracy and speed of reconstruction. Simulation results show that variable atomic number matching pursuit is a fast and stable reconstruction algorithm and better than the other reconstruction algorithms under the same conditions.

scholarly journals Source reconstruction for bioluminescence tomography via L1∕2 regularization

2018 ◽  
Vol 11 (02) ◽  
pp. 1750014 ◽  
Author(s):  
Jingjing Yu ◽  
Qiyue Li ◽  
Haiyu Wang
Keyword(s):  
Image Quality ◽  
Matching Pursuit ◽  
Imaging Modality ◽  
Reconstruction Algorithm ◽  
Reconstruction Method ◽  
Reconstruction Algorithms ◽  
Preclinical Research ◽  
Bioluminescence Tomography ◽  
Comparison Results ◽  
Stable Reconstruction

Bioluminescence tomography (BLT) is an important noninvasive optical molecular imaging modality in preclinical research. To improve the image quality, reconstruction algorithms have to deal with the inherent ill-posedness of BLT inverse problem. The sparse characteristic of bioluminescent sources in spatial distribution has been widely explored in BLT and many L1-regularized methods have been investigated due to the sparsity-inducing properties of L1 norm. In this paper, we present a reconstruction method based on L[Formula: see text] regularization to enhance sparsity of BLT solution and solve the nonconvex L[Formula: see text] norm problem by converting it to a series of weighted L1 homotopy minimization problems with iteratively updated weights. To assess the performance of the proposed reconstruction algorithm, simulations on a heterogeneous mouse model are designed to compare it with three representative sparse reconstruction algorithms, including the weighted interior-point, L1 homotopy, and the Stagewise Orthogonal Matching Pursuit algorithm. Simulation results show that the proposed method yield stable reconstruction results under different noise levels. Quantitative comparison results demonstrate that the proposed algorithm outperforms the competitor algorithms in location accuracy, multiple-source resolving and image quality.

scholarly journals Constrained Backtracking Matching Pursuit Algorithm for Image Reconstruction in Compressed Sensing

2021 ◽  
Vol 11 (4) ◽  
pp. 1435
Author(s):  
Xue Bi ◽  
Lu Leng ◽  
Cheonshik Kim ◽  
Xinwen Liu ◽  
Yajun Du ◽  
...  
Keyword(s):  
Image Reconstruction ◽  
Compressed Sensing ◽  
Matching Pursuit ◽  
Reconstruction Algorithm ◽  
Energy Criterion ◽  
Step Size ◽  
Relationship Analysis ◽  
Support Set ◽  
Reconstruction Performance ◽  
Sparsity Level

Image reconstruction based on sparse constraints is an important research topic in compressed sensing. Sparsity adaptive matching pursuit (SAMP) is a greedy pursuit reconstruction algorithm, which reconstructs signals without prior information of the sparsity level and potentially presents better reconstruction performance than other greedy pursuit algorithms. However, SAMP still suffers from being sensitive to the step size selection at high sub-sampling ratios. To solve this problem, this paper proposes a constrained backtracking matching pursuit (CBMP) algorithm for image reconstruction. The composite strategy, including two kinds of constraints, effectively controls the increment of the estimated sparsity level at different stages and accurately estimates the true support set of images. Based on the relationship analysis between the signal and measurement, an energy criterion is also proposed as a constraint. At the same time, the four-to-one rule is improved as an extra constraint. Comprehensive experimental results demonstrate that the proposed CBMP yields better performance and further stability than other greedy pursuit algorithms for image reconstruction.

scholarly journals Combining Acceleration Techniques for Low-Dose X-Ray Cone Beam Computed Tomography Image Reconstruction

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Hsuan-Ming Huang ◽  
Ing-Tsung Hsiao
Keyword(s):  
Computed Tomography ◽  
Image Reconstruction ◽  
Low Dose ◽  
Computational Cost ◽  
Reconstruction Algorithm ◽  
Reconstruction Algorithms ◽  
Acceleration Techniques ◽  
Reconstruction Methods ◽  
Speed Up ◽  
Phantom Studies

Background and Objective. Over the past decade, image quality in low-dose computed tomography has been greatly improved by various compressive sensing- (CS-) based reconstruction methods. However, these methods have some disadvantages including high computational cost and slow convergence rate. Many different speed-up techniques for CS-based reconstruction algorithms have been developed. The purpose of this paper is to propose a fast reconstruction framework that combines a CS-based reconstruction algorithm with several speed-up techniques.Methods. First, total difference minimization (TDM) was implemented using the soft-threshold filtering (STF). Second, we combined TDM-STF with the ordered subsets transmission (OSTR) algorithm for accelerating the convergence. To further speed up the convergence of the proposed method, we applied the power factor and the fast iterative shrinkage thresholding algorithm to OSTR and TDM-STF, respectively.Results. Results obtained from simulation and phantom studies showed that many speed-up techniques could be combined to greatly improve the convergence speed of a CS-based reconstruction algorithm. More importantly, the increased computation time (≤10%) was minor as compared to the acceleration provided by the proposed method.Conclusions. In this paper, we have presented a CS-based reconstruction framework that combines several acceleration techniques. Both simulation and phantom studies provide evidence that the proposed method has the potential to satisfy the requirement of fast image reconstruction in practical CT.

Ultra-limited-angle CT image reconstruction algorithm based on reweighting and edge-preserving

2022 ◽  
pp. 1-13
Author(s):  
Lei Shi ◽  
Gangrong Qu ◽  
Yunsong Zhao
Keyword(s):  
Image Reconstruction ◽  
Condition Number ◽  
Reconstruction Algorithm ◽  
Projection Data ◽  
Ct Image ◽  
Reconstruction Algorithms ◽  
Edge Preserving ◽  
Image Reconstruction Algorithm ◽  
Ct Image Reconstruction ◽  
Limited Angle

BACKGROUND: Ultra-limited-angle image reconstruction problem with a limited-angle scanning range less than or equal to π 2 is severely ill-posed. Due to the considerably large condition number of a linear system for image reconstruction, it is extremely challenging to generate a valid reconstructed image by traditional iterative reconstruction algorithms. OBJECTIVE: To develop and test a valid ultra-limited-angle CT image reconstruction algorithm. METHODS: We propose a new optimized reconstruction model and Reweighted Alternating Edge-preserving Diffusion and Smoothing algorithm in which a reweighted method of improving the condition number is incorporated into the idea of AEDS image reconstruction algorithm. The AEDS algorithm utilizes the property of image sparsity to improve partially the results. In experiments, the different algorithms (the Pre-Landweber, AEDS algorithms and our algorithm) are used to reconstruct the Shepp-Logan phantom from the simulated projection data with noises and the flat object with a large ratio between length and width from the real projection data. PSNR and SSIM are used as the quantitative indices to evaluate quality of reconstructed images. RESULTS: Experiment results showed that for simulated projection data, our algorithm improves PSNR and SSIM from 22.46db to 39.38db and from 0.71 to 0.96, respectively. For real projection data, our algorithm yields the highest PSNR and SSIM of 30.89db and 0.88, which obtains a valid reconstructed result. CONCLUSIONS: Our algorithm successfully combines the merits of several image processing and reconstruction algorithms. Thus, our new algorithm outperforms significantly other two algorithms and is valid for ultra-limited-angle CT image reconstruction.

scholarly journals Improved Reconstruction Quality of Bioluminescent Images by Combining SP3Equations and Bregman Iteration Method

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Qiang Wu ◽  
Jinchao Feng ◽  
Kebin Jia ◽  
Xiangyu Wang
Keyword(s):  
Drug Development ◽  
Iteration Method ◽  
Tumor Therapy ◽  
Reconstruction Algorithm ◽  
Reconstruction Algorithms ◽  
Bregman Iteration ◽  
Bioluminescence Tomography ◽  
Practical Applications ◽  
Reconstruction Quality

Bioluminescence tomography (BLT) has a great potential to provide a powerful tool for tumor detection, monitoring tumor therapy progress, and drug development; developing new reconstruction algorithms will advance the technique to practical applications. In the paper, we propose a BLT reconstruction algorithm by combining SP3equations and Bregman iteration method to improve the quality of reconstructed sources. The numerical results for homogeneous and heterogeneous phantoms are very encouraging and give significant improvement over the algorithms without the use of SP3equations and Bregman iteration method.

scholarly journals Evaluation of 68Ga-PSMA PET/CT Images Acquired with a Reduced Scan Time Duration in Prostate Cancer Patients using the Digital Biograph Vision

2020 ◽  
Author(s):  
Manuel Weber ◽  
Regina Hofferber ◽  
Ken Herrmann ◽  
Wolfgang Peter Fendler ◽  
Maurizio Conti ◽  
...  
Keyword(s):  
Prostate Cancer ◽  
Image Reconstruction ◽  
Diagnostic Performance ◽  
Reconstruction Algorithm ◽  
Reconstruction Algorithms ◽  
Time Duration ◽  
Acquisition Protocol ◽  
Scan Time ◽  
Psma Pet ◽  
Pet Ct

Abstract Aim 68Ga-PSMA PET/CT allows for a superior detection of prostate cancer (PC) tissue, especially in context of a low tumor burden. Digital PET/CT bears the potential of reducing scan time duration / administered tracer activity due to, for instance, its higher sensitivity and improved time coincidence resolution. It might thereby expand 68Ga-PSMA PET/CT that is currently limited by 68Ge/68Ga-generator yield. Our aim was to clinically evaluate the influence of a reduced scan time duration in combination with different image reconstruction algorithms on the diagnostic performance. Methods Twenty PC patients (11 for biochemical recurrence, 5 for initial staging, 4 for metastatic disease) sequentially underwent 68Ga-PSMA PET/CT on a digital Siemens Biograph Vision. PET data were collected in continuous-bed-motion mode with a scan time duration of approximately 17 min (reference acquisition protocol) and 5 min (reduced acquisition protocol). 4 iterative reconstruction algorithms were applied using a time-of-flight (TOF) approach alone or combined with point-spread-function (PSF) correction, each with 2 or 4 iterations. To evaluate the diagnostic performance, the following metrics were chosen: (a) per-region detectability, (b) the tumor maximum and peak standardized uptake values (SUVmax and SUVpeak) and (c) image noise using the liver’s activity distribution. Results Overall, 98% of regions (91% of affected regions) were correctly classified in the reduced acquisition protocol independent of the image reconstruction algorithm. Two nodal lesions (each ≤ 4 mm) were not identified (leading to downstaging in 1/20 cases). Mean absolute percentage deviation of SUVmax (SUVpeak) was approximately 9% (6%) for each reconstruction algorithm. The mean image noise increased from 13–21% (4 iterations) and from 10–15% (2 iterations) for PSF + TOF and TOF images. Conclusions High agreement at 3.5-fold reduction of scan time in terms of per-region detection (98% of regions) and image quantification (mean deviation ≤ 10%) was demonstrated; however, small lesions can be missed in about 10% of patients leading to downstaging (T1N0M0 instead of T1N1M0) in 5% of patients. Our results suggest that a reduction of scan time duration or administered 68Ga-PSMA activities can be considered in metastatic patients, where missing small lesions would not impact patient management.

Image Reconstruction Algorithms For Ultrasonic Tomography

2012 ◽  
Author(s):  
Mohd Hafiz Fazalul Rahiman ◽  
Ruzairi Abdul Rahim ◽  
Herlina Abdul Rahim
Keyword(s):  
Image Reconstruction ◽  
Reconstruction Algorithm ◽  
Ultrasonic Tomography ◽  
Back Projection ◽  
Reconstruction Algorithms ◽  
Tomography System ◽  
Tomography Image ◽  
Real Objects ◽  
Linear Back Projection ◽  
Image Reconstruction Algorithms

Kertas ini membincangkan algoritma pembangunan imej bagi kegunaan dalam tomografi ultrasonik. Terdapat tiga jenis algoritma pembangunan iaitu Linear Back Projection, Hybrid Reconstruction dan Hybrid Binary Reconstruction. Algoritma tersebut telah diuji ke atas sistem tomografi ultrasonik berdasarkan kepada beberapa bayang yang telah dikenalpasti dan objek–objek sebenar. Prestasi algoritma tersebut telah di analisa dan bincangkan pada bahagian akhir kertas ini. Kata kunci: Algoritma pembangunan; tomografi ultrasonic; pemprosesan image; mabuk This paper presented image reconstruction algorithms for use in ultrasonic tomography. There are three types of reconstruction algorithms namely Linear Back Projection, Hybrid Reconstruction and Hybrid Binary Reconstruction. The algorithms have been evaluated on ultrasonic tomography system based on several known phantoms and real objects. The performance of the algorithms have been analysed and discussed at the end of the paper. Key words: Reconstruction algorithm; ultrasonic tomography; image processing

scholarly journals Image reconstruction algorithms for the microwave holographic vision system with reliable gap detection at theoretical limits

2018 ◽  
Vol 185 ◽  
pp. 01004
Author(s):  
Dmitry Leshchiner ◽  
Konstantin Zvezdin ◽  
Anatoly Popkov ◽  
Grigory Chepkov ◽  
Pietro Perlo
Keyword(s):  
Image Reconstruction ◽  
Fresnel Zone ◽  
Vision System ◽  
Reconstruction Algorithm ◽  
Gap Detection ◽  
Reconstruction Algorithms ◽  
Maximal Interval ◽  
Microwave Scattering ◽  
Zone Width ◽  
Microwave Detector

We present a reliable image reconstruction algorithm suitable for a microwave holographic vision system with several sensors coupled to the spin-diode based microwave detector and a single emission source. An objective is, by reconstructing the spatial microwave scattering density on the scene, to detect the presence and the nature of road obstacles impeding driving in the near vehicle zone. The idea of holographic visualization is to reconstruct the spatial microwave scattering density of an object by detecting an amplitude and phase of a reflected signal by lattice of sensors. We discuss versions of an algorithm, determine and analyse its resolution limits for various distances with different number of sensors for a one-dimensional test problem of detecting two walls (or posts) separated by a gap at a fixed distance. The maximal interval between sensors needed for a reliable reconstruction equals approximately Fresnel zone width. We show that maximal resolution achieved by our algorithm with an appropriate number of sensors was about 40% of Fresnel zone width for wall detection and about 30% of zone width for gap detection.

scholarly journals Evaluation of [68Ga]Ga-PSMA PET/CT Images Acquired with a Reduced Scan Time Duration in Prostate Cancer Patients using the Digital Biograph Vision

2020 ◽  
Author(s):  
Manuel Weber ◽  
Walter Jentzen ◽  
Regina Hofferber ◽  
Ken Herrmann ◽  
Wolfgang Peter Fendler ◽  
...  
Keyword(s):  
Prostate Cancer ◽  
Image Reconstruction ◽  
Cancer Patients ◽  
Diagnostic Performance ◽  
Reconstruction Algorithm ◽  
Reconstruction Algorithms ◽  
Time Duration ◽  
Acquisition Protocol ◽  
Scan Time ◽  
Pet Ct

Abstract Aim: [68Ga]Ga-PSMA-11 PET/CT allows for a superior detection of prostate cancer tissue, especially in the context of a low tumor burden. Digital PET/CT bears the potential of reducing scan time duration / administered tracer activity due to, for instance, its higher sensitivity and improved time coincidence resolution. It might thereby expand [68Ga]Ga-PSMA-11 PET/CT that is currently limited by 68Ge/68Ga-generator yield. Our aim was to clinically evaluate the influence of a reduced scan time duration in combination with different image reconstruction algorithms on the diagnostic performance.Methods: Twenty prostate cancer patients (11 for biochemical recurrence, 5 for initial staging, 4 for metastatic disease) sequentially underwent [68Ga]Ga-PSMA-11 PET/CT on a digital Siemens Biograph Vision. PET data were collected in continuous-bed-motion mode with a mean scan time duration of 16.7 min (reference acquisition protocol) and 4.6 min (reduced acquisition protocol). 4 iterative reconstruction algorithms were applied using a time-of-flight (TOF) approach alone or combined with point-spread-function (PSF) correction, each with 2 or 4 iterations. To evaluate the diagnostic performance, the following metrics were chosen: (a) per-region detectability, (b) the tumor maximum and peak standardized uptake values (SUVmax and SUVpeak) and (c) image noise using the liver’s activity distribution.Results: Overall, 98% of regions (91% of affected regions) were correctly classified in the reduced acquisition protocol independent of the image reconstruction algorithm. Two nodal lesions (each ≤4 mm) were not identified (leading to downstaging in 1/20 cases). Mean absolute percentage deviation of SUVmax (SUVpeak) was approximately 9% (6%) for each reconstruction algorithm. The mean image noise increased from 13% to 21% (4 iterations) and from 10% to 15% (2 iterations) for PSF+TOF and TOF images.Conclusions: High agreement at 3.5-fold reduction of scan time in terms of per-region detection (98 % of regions) and image quantification (mean deviation ≤ 10 %) was demonstrated; however, small lesions can be missed in about 10% of patients leading to downstaging (T1N0M0 instead of T1N1M0) in 5 % of patients. Our results suggest that a reduction of scan time duration or administered [68Ga]Ga-PSMA-11 activities can be considered in metastatic patients, where missing small lesions would not impact patient management. Limitations include the small and heterogeneous sample size and the lack of follow-up.

scholarly journals An Image Reconstruction Algorithm based on Sparse Representation for Image Compressed Sensing

2021 ◽  
Vol 15 ◽  
pp. 511-518
Author(s):  
Shuyao Tian ◽  
Liancheng Zhang ◽  
Yajun Liu
Keyword(s):  
Image Reconstruction ◽  
Sparse Representation ◽  
Sampling Rate ◽  
Reconstruction Algorithm ◽  
Reconstruction Algorithms ◽  
Step Size ◽  
Sampling Process ◽  
Artifact Suppression ◽  
Reconstruction Time ◽  
Improved Algorithm

It is difficult to control the balance between artifact suppression and detail preservation. In addition, the information contained in the reconstructed image is limited. For achieving the purpose of less lost information and lower computational complexity in the sampling process, this paper proposed a novel algorithm to realize the image reconstruction using sparse representation. Firstly, the principle of algorithm for sparse representation is introduced, and then the current commonly used reconstruction algorithms are described in detail. Finally, the algorithm can still process the image when the sparsity is unknown by introducing the sparsity theory and dynamically changing the step size to approximate the sparsity. The results explain that the improved algorithm can not only reconstruct the image with unknown sparsity, but also has advantages over other algorithms in reconstruction time. In addition, compared with other algorithms, the reconstruction time of the improved algorithm is the shortest under the same sampling rate.

Sign in / Sign up

Export Citation Format

Share Document