Model-driven CT reconstruction algorithm for nano-resolution x-ray phase contrast imaging

The low-density imaging performance of a zone plate-based nano-resolution hard x-ray computed tomography(CT)system can be significantly improved by incorporating a grating-based Lau interferometer. Due to the diffraction, however,the acquired nano-resolution phase signal may suffer splitting problem, which impedes the direct reconstruction of phase contrast CT(nPCT) images. To overcome, a new model-driven nPCT image reconstruction algorithm is developed in this study. In it, the diffraction procedure is mathematically modeled into a matrix B, from which the projections without signal splitting can be generated invertedly. Furthermore, a penalized weighted least-square model with total variation(PWLSTV) is employed to denoise these projections, from which nPCT images with high accuracy are directly reconstructed.Numerical experiments demonstrate that this new algorithm is able to work with phase projections having any splitting distances. Moreover, results also reveal that nPCT images of higher signal-to-noise-ratio(SNR) could be reconstructed from projections having larger splitting distances. In summary, a novel model-driven nPCT image reconstruction algorithm with high accuracy and robustness is verified for the Lau interferometer-based hard x-ray nano-resolution phase contrast imaging.

Improvement of Binocular Reconstruction Algorithm for Measuring 3D Pavement Texture Using a Single Laser Line Scanning Constraint

The dense and accurate measurement of 3D texture is helpful in evaluating the pavement function.To form dense mandatory constraints and improve matching accuracy,the traditional binocular reconstruction technology was improved threefold.First,a single moving laser line was introduced to carry out global scanning constraints on the target,which would well overcome the difficulty of installing and recognizing excessive laser lines.Second,four kinds of improved algorithms,namely,disparity replacement,superposition synthesis,subregion segmentation,and subregion segmentation centroid enhancement,were established based on different constraint mechanism.Last,the improved binocular reconstruction test device was developed to realize the dual functions of 3D texture measurement and precision self-evaluation.Results show that compared with traditional algorithms,the introduction of a single laser line scanning constraint is helpful in improving the measurement’s accuracy.Among various improved algorithms,the improvement effect of the subregion segmentation centroid enhancement method is the best.It has a good effect on both overall measurement and single pointmeasurement,which can be considered to be used in pavement function evaluation.

Ultrahigh spatiotemporal resolution beam signal reconstruction with bunch phase compensation

Various electromagnetic signals are excited by the beam in the acceleration and beam-diagnostic elements of a particle accelerator.It is important to obtain time-domain waveforms of these signals with high temporal resolution for research,such as the study of beam–cavity interactions and bunch-by-bunch parameter measurements.Therefore,a signal reconstruction algorithm with ultrahigh spatiotemporal resolution and bunch phase compensation based on equivalent sampling is proposed in this paper.Compared with traditional equivalent sampling,the use of phase compensation and setting the bunch signal zero-crossing point as the time reference can construct a more accurate reconstructed signal.The basic principles of the method,simulation,and experimental comparison are also introduced.Based on the beam test platform of the Shanghai Synchrotron Radiation Facility(SSRF)and the method of experimental verification,the factors that affect the reconstructed signal quality are analyzed and discussed,including the depth of the sampled data,quantization noise of analog-to-digital converter,beam transverse oscillation,and longitudinal oscillation.The results of the beam experiments show that under the user operation conditions of the SSRF,a beam excitation signal with an amplitude uncertainty of 2%can be reconstructed.

An algorithm for computed tomography image reconstruction from limited-view projections

With the development of the compressive sensing theory, the image reconstruction from the projections viewed in limited angles is one of the hot problems in the research of computed tomography technology. This paper develops an iterative algorithm for image reconstruction, which can fit the most cases. This method gives an image reconstruction flow with the difference image vector, which is based on the concept that the difference image vector between the reconstructed and the reference image is sparse enough. Then the l1-norm minimization method is used to reconstruct the difference vector to recover the image for flat subjects in limited angles. The algorithm has been tested with a thin planar phantom and a real object in limited-view projection data. Moreover, all the studies showed the satisfactory results in accuracy at a rather high reconstruction speed.

Sparse reconstruction for fluorescence molecular tomography via a fast iterative algorithm

Fluorescence molecular tomography(FMT)is a fast-developing optical imaging modalitythat has great potential in early diagnosis of disease and drugs development.However,recon-struction algorithms have to address a highly ill-posed problem to fulfll 3D reconstruction inFMT.In this contribution,we propose an efficient iterative algorithm to solve the large-scalereconstruction problem,in which the sparsity of fluorescent targets is taken as useful a prioriinformation in designing the reconstruction algorithm.In the implementation,a fast sparseapproximation scheme combined with a stage-wise learning strategy enable the algorithm to dealwith the ill-posed inverse problem at reduced computational costs.We validate the proposed fastiterative method with numerical simulation on a digital mouse model.Experimental results demonstrate that our method is robust for different finite element meshes and different Poissonnoise levels.

Research on the Application of Super Resolution Reconstruction Algorithm for Underwater Image

Underwater imaging is widely used in ocean,river and lake exploration,but it is affected by properties of water and the optics.In order to solve the lower-resolution underwater image formed by the influence of water and light,the image super-resolution reconstruction technique is applied to the underwater image processing.This paper addresses the problem of generating super-resolution underwater images by convolutional neural network framework technology.We research the degradation model of underwater images,and analyze the lower-resolution factors of underwater images in different situations,and compare different traditional super-resolution image reconstruction algorithms.We further show that the algorithm of super-resolution using deep convolution networks(SRCNN)which applied to super-resolution underwater images achieves good results.

Simulation and photoelectron track reconstruction of soft X-ray polarimeter

The soft X-ray polarimeter(SXP)is a detector with a wide energy range,large area,and large field of view.A SXP will be mounted on the Chinese Space Station and will mainly focus on detecting the polarization of transient soft X-ray(2–10 keV)sources,especially gamma-ray bursts(GRBs).In this work,a polarimeter detector unit is taken as an example,and Geant4 and Garfield++software are used to simulate the detection efficiency and track production.An improved track reconstruction algorithm is proposed and used to reconstruct two-dimensional images of the tracks.In this method,the initial emission angle of photoelectrons is reconstructed from the initial part of the track by shortening or extending the initial part of the track until the remaining track is straight,and the number of pixels is within an adjustable threshold.The modulation factor of the photoelectronic tracks after reconstruction reaches approximately 57%in the photon energy range of 7–10 keV.

AN IMPROVED SPARSITY ADAPTIVE MATCHING PURSUIT ALGORITHM FOR COMPRESSIVE SENSING BASED ON REGULARIZED BACKTRACKING

Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown. In order to match the sparsity more accurately, we presented an improved SAMP algorithm based on Regularized Backtracking (SAMP-RB). By adapting a regularized backtracking step to SAMP algorithm in each iteration stage, the proposed algorithm can flexibly remove the inappropriate atoms. The experimental results show that SAMP-RB reconstruction algorithm greatly improves SAMP algorithm both in reconstruction quality and computational time. It has better reconstruction efficiency than most of the available matching pursuit algorithms.

Multiple helical scans and the reconstruction of over FOV-sized objects in cone-beam CT

In cone-beam computed tomography （CBCT）, there are often cases where the size of the specimen is larger than the field of view （FOV） （referred to as over FOV-sized （OFS））. To acquire the complete projection data for OFS objects, some scan modes have been developed for long objects and short but over-wide objects. However, these modes still cannot meet the requirements for both longitudinally long and transversely wide objects. In this paper, we propose a multiple helical scan mode and a corresponding reconstruction algorithm for both longitudinally long and transversely wide objects. The simulation results show that our model can deal with the problem and that the results are acceptable, while the OFS object is twice as long compared with the FOV in the same latitude.

Source reconstruction for bioluminescence tomography via L_(1/2)regularization

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_(1/2) regularization to enhance sparsity of BLT solution and solve the nonconvex L_(1/2) 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.

Image Reconstruction Based on Compressed Sensing Measurement Matrix Optimization Method

In this paper,the observation matrix and reconstruction algorithm of compressed sensing sampling theorem are studied.The advantages and disadvantages of greedy reconstruction algorithm are analyzed.The disadvantages of signal sparsely are preset in this algorithm.The sparsely adaptive estimation algorithm is proposed.The compressed sampling matching tracking algorithm supports the set selection and culling atomic standards to improve.The sparse step size adaptive compressed sampling matching tracking algorithm is proposed.The improved algorithm selects the sparsely as the step size to select the support set atom,and the maximum correlation value.Half of the threshold culling algorithm supports the concentration of excess atoms.The experimental results show that the improved algorithm has better power and lower image reconstruction error under the same sparsely criterion,and has higher image reconstruction quality and visual effects.

Radar Imaging Based on Iterative Algorithms

It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.

A Multiresolution Reconstructive Algorithm Based on Network Theory for Electrical Capacitance Tomography

Electrical capacitance tomography technique reconstructs dielectric constant distribution in an object by measuring the capacitances between the eletrode pairs which are mounted around this object. Because of the limitation of measurement condition, the measured data are imcomplet. This paper describes a multiresolution reconstructive algorithm which is based on network theory for electrical capacitance tomography technique. The dielectric constant distribution of flow of two components in a pipeline is reconstructed. The algorithm is as follows: Firstly, construct a rough, first level system model, and assume the dielectric constant distribution of the region to be reconstructed. After iteration, the dielectic constant of each unit can be reconstructed. Secondly, construct a finer, second level the system model and determine the initial dielectric constant of each unit in the region to be reconstructed according to related information between two levels. After iteration, the image of the pipeline's cross section can be reconstructed. The results of simulated experiments about different kinds of medium distributions show that this algorithm is effective and can converge.

Video Compressed Sensing Reconstruction Based on Multi-Dimensional Reference Frame Multi Hypothesis Rediction

In this paper,a video compressed sensing reconstruction algorithm based on multidimensional reference frames is proposed using the sparse characteristics of video signals in different sparse representation domains.First,the overall structure of the proposed video compressed sensing algorithm is introduced in this paper.The paper adopts a multi-reference frame bidirectional prediction hypothesis optimization algorithm.Then,the paper proposes a reconstruction method for CS frames at the re-decoding end.In addition to using key frames of each GOP reconstructed in the time domain as reference frames for reconstructing CS frames,half-pixel reference frames and scaled reference frames in the pixel domain are also used as CS frames.Reference frames of CS frames are used to obtain higher quality assumptions.Themethod of obtaining reference frames in the pixel domain is also discussed in detail in this paper.Finally,the reconstruction algorithm proposed in this paper is compared with video compression algorithms in the literature that have better reconstruction results.Experiments show that the algorithm has better performance than the best multi-reference frame video compression sensing algorithm and can effectively improve the quality of slowmotion video reconstruction.

Extension of emission expectation maximization lookalike algorithms to Bayesian algorithms

We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization(ML-EM)algorithm.In this study,we extend these algorithms to Bayesian algorithms.The family of emission-EM-lookalike algorithms utilizes a multiplicative update scheme.The extension of these algorithms to Bayesian algorithms is achieved by introducing a new simple factor,which contains the Bayesian information.One of the extended algorithms can be applied to emission tomography and another to transmission tomography.Computer simulations are performed and compared with the corresponding un-extended algorithms.The total-variation norm is employed as the Bayesian constraint in the computer simulations.The newly developed algorithms demonstrate a stable performance.A simple Bayesian algorithm can be derived for any noise variance function.The proposed algorithms have properties such as multiplicative updating,non-negativity,faster convergence rates for bright objects,and ease of implementation.Our algorithms are inspired by Green’s one-steplate algorithm.If written in additive-update form,Green’s algorithm has a step size determined by the future image value,which is an undesirable feature that our algorithms do not have.

A computed tomography reconstruction algorithm based on multipurpose optimal criterion and simulated annealing theory

Although emission spectral tomography （EST） combines emission spectral measurement with optical computed tomography （OCT）, it is difficult to gain transient emission data from a large number of views, therefore, high precision OCT algorithms with few views ought to be studied for EST application. To improve the reconstruction precision in the case of few views, a new computed tomography reconstruction algorithm based on multipurpose optimal criterion and simulated annealing theory （multi-criterion simulated annealing reconstruction technique, MCSART） is proposed. This algorithm can suffice criterion of least squares, criterion of most uniformity, and criterion of most smoothness synchronously. We can get global optimal solution by MCSART algorithm with simulated annealing theory. The simulating experiment result shows that this algorithm is superior to the traditional algorithms under various noises.

A Fourier Reconstruction Algorithm in π-Scheme Short-Scan SPECT

In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed tomography（SPECT） with uniform attenuation, and the modified central slice theorem is developed. Numerical simulations are conducted to demonstrate the effec- tiveness of the developed method.

Reconstruction algorithm of super-resolution infrared image based on human vision processing mechanism

Aiming at solving the problem of low resolu- tion and visual blur in infrared imaging, a super-resolution infrared image reconstruction method using human vision processing mechanism （HVPM） was proposed. This method combined a mechanism of vision lateral inhibition with an algorithm projection onto convex sets （POCS） reconstruction, the improved vision lateral inhibition network was utilized to enhance the contrast between object and background of low-resolution image sequences, then POCS algorithm was adopted to reconstruct super- resolution image. Experimental results showed that the proposed method can significantly improve the visual effect of image, whose contrast and information entropy of reconstructed infrared images were improved by approxi- mately 5 times and 1.6 times compared with traditional POCS reconstruction algorithm, respectively.

Electrical impedance tomography using adaptive mesh refinement

In electrical impedance tomography （EIT）, distribution of the internal resistivity or conductivity of an unknown object is esti- mated using measured boundary voltage data induced by different current patterns with various reconstruction algorithms. The reconstruction algorithms usually employ the Newton-Raphson iteration scheme to visualize the resistivity distribution inside the object. Accuracy of the imaging process depends not only on the algorithm used, but also on the scheme of finite element discretization. In this paper an adaptive mesh refinement is used in a modified reconstruction algorithm for the regularized Err. The method has a major impact on efficient solution of the forward problem as well as on achieving improved image resolution. Computer simulations indicate that the Newton-Raphson reconstruction algorithm for Err using adaptive mesh refinement performs better than the classical Newton-Raphson algorithm in terms of reconstructed image resolution.

An effective time-domain microwave image reconstruction algorithm for loss-y layered media utilizing the ADI-FDTD method

The finite-difference time-domain （FDTD） method is extensively applied in dealing with time-domain microwave imaging（MWI） problems since it is robust, fast, simple to implement. However, the FDTD method is an explicit time-stepping technique, due to the constraint of the Courant-Friedrich-Levy （CFL） stability condition, the time step needs to be as small as the size of the fine cells, which brings a major increase in computational costs. A fast nonlinear electromagnetic reconstruction algorithm for layered loss-y media by using the alternating-direction implicit finite-difference time-domain （ADI-FDTD） method is proposed. This algorithm is based on an adjoint method, and the nonlinear iterations apply the ADI-FDTD method to calculate the forward and adjoint field, and adopt the Polak, Ribiere, Polyar conjugate-gradient （PRP-CG） optimization scheme. By comparing the simulation results based on ADI-FDTD method and the FDTD method, the validity and efficiency of the proposed algorithm have been proved. Furthermore, the relative residual errors （RRE） are introduced as the iterative computation termination conditions, which further prove the accuracy of this algorithm.