tomographic reconstruction tomographic reconstruction tomographic reconstruction is a type of multidimensional inverse problem where the challenge is to yield an estimate of a specific system from a finite number of projections. the mathematical basis for tomographic imaging was laid down by johann radon. a notable example of applications is the reconstruction of computed tomography (ct) where cross-sectional images of patients are obtained in non-invasive manner. recent developments have seen the radon transform and its inverse used for tasks related to realistic object insertion required for testing and evaluating computed tomography use in airport security. this article applies in general to reconstruction methods for all kinds of tomography, but some of the terms and physical descriptions refer directly to the reconstruction of x-ray computed tomography. introducing formula figure 1: parallel beam geometry utilized in tomography and tomographic reconstruction. each projection, resulting from tomography under a specific angle, is made up of the set of line integrals through the object. resulting tomographic image from a plastic skull phantom. projected x-rays are clearly visible on this slice taken with a ct-scan as image artifacts, due to limited amount of projection slices over angles. the projection of an object, resulting from the tomographic measurement process at a given angle θ , is made up of a set of line integrals (see fig. 1). a set of many such projections under different angles organized in 2d is called sinogram (see fig. 3). in x-ray ct, the line integral represents the total attenuation of the beam of x-rays as it travels in a straight line through the object. as mentioned above, the resulting image is a 2d (or 3d) model of the attenuation coefficient. that is, we wish to find the image μ ( x , y ) . the simplest and easiest way to visualise the method of scanning is the system of parallel projection, as used in the first scanners. for this discussion we consider the data to be collected as a series of parallel rays, at position r , across a projection at angle θ . this is repeated for various angles. attenuation occurs exponentially in tissue: i = i 0 exp ⁡ ( − ∫ μ ( x , y ) d s ) \exp \left(\right)} where μ ( x , y ) is the attenuation coefficient as a function of position. therefore, generally the total attenuation p of a ray at position r , on the projection at angle θ , is given by the line integral: p θ ( r ) = ln ⁡ ( i i 0 ) = − ∫ μ ( x , y ) d s (r)=\ln \left(\right)=-\int \mu (x,y)\,ds} using the coordinate system of figure 1, the value of r onto which the point ( x , y ) will be projected at angle θ is given by: x cos ⁡ θ + y sin ⁡ θ = r so the equation above can be rewritten as p θ ( r ) = ∫ − ∞ ∞ ∫ − ∞ ∞ f ( x , y ) δ ( x cos ⁡ θ + y sin ⁡ θ − r ) d x d y (r)=\int _^\int _^f(x,y)\delta (x\cos \theta +y\sin \theta -r)\,dx\,dy} where f ( x , y ) represents μ ( x , y ) and δ ( ) is the dirac delta function. this function is known as the radon transform (or sinogram) of the 2d object. the fourier transform of the projection can be written as p θ ( ω ) = ∫ − ∞ ∞ ∫ − ∞ ∞ f ( x , y ) exp ⁡ [ − j ω ( x cos ⁡ θ + y sin ⁡ θ ) ] d x d y = f ( ω 1 , ω 2 ) (\omega )=\int _^\int _^f(x,y)\exp\,dx\,dy=f(\omega _,\omega _)} where ω 1 = ω cos ⁡ θ , ω 2 = ω sin ⁡ θ =\omega \cos \theta ,\omega _=\omega \sin \theta } p θ ( ω ) (\omega )} represents a slice of the 2d fourier transform of f ( x , y ) at angle θ . using the inverse fourier transform, the inverse radon transform formula can be easily derived. f ( x , y ) = 1 2 π ∫ 0 π g θ ( x cos ⁡ θ + y sin ⁡ θ ) d θ \int \limits _^g_(x\cos \theta +y\sin \theta )d\theta } where g θ ( x cos ⁡ θ + y sin ⁡ θ ) (x\cos \theta +y\sin \theta )} is the derivative of the hilbert transform of p θ ( r ) (r)} in theory, the inverse radon transformation would yield the original image. the projection-slice theorem tells us that if we had an infinite number of one-dimensional projections of an object taken at an infinite number of angles, we could perfectly reconstruct the original object, f ( x , y ) . however, there will only be a finite number of projections available in practice. assuming f ( x , y ) has effective diameter d and desired resolution is r s , rule of thumb number of projections needed for reconstruction is n > π d / r s reconstruction algorithms practical reconstruction algorithms have been developed to implement the process of reconstruction of a three-dimensional object from its projections. these algorithms are designed largely based on the mathematics of the radon transform, statistical knowledge of the data acquisition process and geometry of the data imaging system. fourier-domain reconstruction algorithm reconstruction can be made using interpolation. assume n projections of f ( x , y ) are generated at equally spaced angles, each sampled at the same rate. the discrete fourier transform (dft) on each projection yields sampling in the frequency domain. combining all the frequency-sampled projections generates a polar raster in the frequency domain. the polar raster is sparse, so interpolation is used to fill the unknown dft points, and reconstruction can be done through the inverse discrete fourier transform. reconstruction performance may improve by designing methods to change the sparsity of the polar raster, facilitating the effectiveness of interpolation. for instance, a concentric square raster in the frequency domain can be obtained by changing the angle between each projection as follow: θ ′ = r 0 max { | cos ⁡ θ | , | sin ⁡ θ | } where r 0 is highest frequency to be evaluated. the concentric square raster improves computational efficiency by allowing all the interpolation positions to be on rectangular dft lattice. furthermore, it reduces the interpolation error. yet, the fourier-transform algorithm has a disadvantage of producing inherently noisy output. back projection algorithm in practice of tomographic image reconstruction, often a stabilized and discretized version of the inverse radon transform is used, known as the filtered back projection algorithm. with a sampled discrete system, the inverse radon transform is f ( x , y ) = 1 2 π ∑ i = 0 n − 1 δ θ i g θ i ( x cos ⁡ θ i + y sin ⁡ θ i ) \sum _^\delta \theta _g_(x\cos \theta _+y\sin \theta _)} g θ ( t ) = p θ ( t ) ⋅ k ( t ) (t)=p_(t)\cdot k(t)} where δ θ is the angular spacing between the projections and k ( t ) is a radon kernel with frequency response | ω | . the name back-projection comes from the fact that a one-dimensional projection needs to be filtered by a one-dimensional radon kernel (back-projected) in order to obtain a two-dimensional signal. the filter used does not contain dc gain, so adding dc bias may be desirable. reconstruction using back-projection allows better resolution than interpolation method described above. however, it induces greater noise because the filter is prone to amplify high-frequency content. iterative reconstruction algorithm the iterative algorithm is computationally intensive but it allows the inclusion of a priori information about the system f ( x , y ) . let n be the number of projections and d i be the distortion operator for the i th projection taken at an angle θ i . { λ i } \}} are a set of parameters to optimize the conversion of iterations. f 0 ( x , y ) = ∑ i = 1 n λ i p θ i ( r ) (x,y)=\sum _^\lambda _p_(r)} a fan-beam reconstruction of shepp-logan phantom with different sensor spacing. smaller spacing between the sensors allow finer reconstruction. the figure was generated by using matlab. f k ( x , y ) = f k − 1 ( x , y ) + ∑ i = 1 n λ i [ p θ i ( r ) − d i f k − 1 ( x , y ) ] (x,y)=f_(x,y)+\sum _^\lambda _ an alternative family of recursive tomographic reconstruction algorithms are the algebraic reconstruction techniques and iterative sparse asymptotic minimum variance. fan-beam reconstruction use of a noncollimated fan beam is common since a collimated beam of radiation is difficult to obtain. fan beams will generate series of line integrals, not parallel to each other, as projections. the fan-beam system requires a 360-degree range of angles, which imposes mechanical constraints, but it allows faster signal acquisition time, which may be advantageous in certain settings such as in the field of medicine. back projection follows a similar two-step procedure that yields reconstruction by computing weighted sum back-projections obtained from filtered projections. deep learning reconstruction the influence of poisson noise in deep learning reconstruction where poisson noise causes the u-net fail to reconstruct an existing high contrast lesion-like object. deep learning methods are widely applied to image reconstruction nowadays and have achieved impressive results in various image reconstruction tasks, including low-dose denoising, sparse-view reconstruction, limited angle tomography and metal artifact reduction. an excellent overview can be found in the special issue of ieee transaction on medical imaging. one group of deep learning reconstruction algorithms apply post-processing neural networks to achieve image-to-image reconstruction, where input images are reconstructed by conventional reconstruction methods. artifact reduction using the u-net in limited angle tomography is such an example application. however, incorrect structures may occur in an image reconstructed by such a completely data-driven method, as displayed in the figure. therefore, integration of known operators into the architecture design of neural networks appears beneficial, as described in the concept of precision learning. for example, direct image reconstruction from projection data can be learnt from the framework of filtered back-projection. another example is to build neural networks by unrolling iterative reconstruction algorithms. except for precision learning, using conventional reconstruction methods with deep learning reconstruction prior is also an alternative approach to improve the image quality of deep learning reconstruction. tomographic reconstruction software for flexible tomographic reconstruction, open source toolboxes are available, such as pyro-nn, tomopy, conrad, odl, the astra toolbox, and tigre. tomopy is an open-source python toolbox to perform tomographic data processing and image reconstruction tasks at the advanced photon source at argonne national laboratory. tomopy toolbox is specifically designed to be easy to use and deploy at a synchrotron facility beamline. it supports reading many common synchrotron data formats from disk through scientific data exchange, and includes several other processing algorithms commonly used for synchrotron data. tomopy also includes several reconstruction algorithms, which can be run on multi-core workstations and large-scale computing facilities. the astra toolbox is a matlab and python toolbox of high-performance gpu primitives for 2d and 3d tomography, from 2009 to 2014 developed by iminds-vision lab, university of antwerp and since 2014 jointly developed by iminds-visionlab (now imec-visionlab), uantwerpen and cwi, amsterdam. the toolbox supports parallel, fan, and cone beam, with highly flexible source/detector positioning. a large number of reconstruction algorithms are available through tomopy and the astra toolkit, including fbp, gridrec, art, sirt, sart, bart, cgls, pml, mlem and osem. in 2016, the astra toolbox has been integrated in the tomopy framework. by integrating the astra toolbox in the tomopy framework, the optimized gpu-based reconstruction methods become easily available for synchrotron beamline users, and users of the astra toolbox can more easily read data and use tomopy's other functionality for data filtering and artifact correction. gallery shown in the gallery is the complete process for a simple object tomography