A Support Construction for CT Image Based on K-Means Clustering ()

Wisan Dhammatorn^{1}, Hiroyuki Shioya^{2}

^{1}Department of Information and Electronic Engineering, Graduate School, Muroran Institute of Technology, Hokkaido, Japan.

^{2}College of Information and Systems, Muroran Institute of Technology, Hokkaido, Japan.

**DOI: **10.4236/jcc.2017.51011
PDF
HTML XML
1,573
Downloads
2,506
Views
Citations

Computer Tomography in medical imaging provides human internal body pictures in the digital form. The more quality images it provides, the better information we get. Normally, medical imaging can be constructed by projection data from several perspectives. In this paper, our research challenges and describes a numerical method for refining the image of a Region of Interest (ROI) by constructing support within a standard CT image. It is obvious that the quality of tomographic slice is affected by artifacts. CT using filter and* K*-means clustering provides a way to reconstruct an ROI with minimal artifacts and improve the degree of the spatial resolution. Experimental results are presented for improving the reconstructed images, showing that the approach enhances the overall resolution and contrast of ROI images. Our method provides a number of advantages: robustness with noise in projection data and support construction without the need to acquire any additional setup.

Keywords

Sparse CT Reconstruction, *K*-Means Clustering, Total Variation Filtering, Maximum Entropy Thresholding

Share and Cite:

Dhammatorn, W. and Shioya, H. (2017) A Support Construction for CT Image Based on K-Means Clustering. *Journal of Computer and Communications*, **5**, 137-151. doi: 10.4236/jcc.2017.51011.

1. Introduction

For a long time, research regarding image field has become popular. A digitalized image can be analyzed and manipulated in various meanings. The more image quality is improved, the more image explains and provides details. In order to get a better representation of the taken picture or to improve its quality, it is indisputably that taking more pictures from different views or angles is the simple way. This principle made practical use in medical imaging field also, where an accurate internal image is obtained by combining pictures from different views. This well-known method is used not only in nuclear medicine, but also in many fields such as scientific field, engineering field, military field and so on, for example, taking or scanning shape of extremely tiny object. These pictures can be acquired from data called projections and its procedure to combine the projections together to obtain an image called image reconstruction. In this imaging system, it is required to obtain an image when the number of projection profiles is restricted in angle under some situations. One of the most widely used techniques is Computed Tomography. Computed Tomography (CT) is the technique that can generate the internal structure of a target object by using the projections of various angles. Two examples of the limited angle problem are illustrated in Figure 1. They show relationship between object domain and Fourier domain of system. In Figure 1(a), the angular range of the projection is restricted to $\theta $ by obstacle. Thus, the missing areas of 2D Fourier transform of the projections are also restricted to $\theta $ shown in Figure 1(b). Although 2D image can be reconstructed from an angular set of 1D projection profiles through many conventional methods, those methods still have weakness in some cases. For example, finding the zero regions in reconstructed image in case there is no any zero value in a set of 1D projection of inverse problem. An example of problem is illustrated in Figure 2 which is shown the comparison between normal case and unusual case. In this paper, we called the zero region as the support of non-object region. The objective of support construction is to find and separate region between object area and non-object area in order to enhance reconstructed image in the next step. An example of appearance of support is demonstrated in Figure 3 to show region between possible object region (white area) and possible non-object region (black area). In order to obtain a good support, firstly a hybrid method is applied for improving the quality of reconstruction from projections when the number of projections is limited or small. The technique consists of 3 traditional methods (ART, FBP and iterative Fourier trans-

Figure 1. (a) Angular range of projections is restricted by shown in object domain, (b) Fourier domain.

Figure 2. Comparing projection profiles.

Figure 3. Support appearance of phantom.

form technique), which transforms repeatedly between object domain and Fourier domain using a prior data in each iteration. The filtered back projection (FBP) [1] is well known method and based on the relationship between the projections and sections on the object and frequency domains, respectively. This technique is developed from simple back projection method. Geometrically, its operation propagates the constructed sonogram back into 2D image plane along the projection paths. Nevertheless, a result image obtained from this simple technique is blurred. Thus, high pass filter will be performed in next step. In other words, filtered back projection is a technique to correct the blurring encountered in simple back projection method. Next procedure applied in this research is one of the most famous iterative methods called ART. The algebraic reconstruction technique (ART) [2] , also called Kaczmarz’s method is often used for solving problem regarding linear system which occurs on the object space, and many developments for the method have been presented. Iterative reconstruction technique has recently become a famous technique and received much attention in this CT research field because it has many advantage compared with conventional techniques. However, each method has advantage and identity individual itself. Thus, many techniques are used and combined their advantages together to get better image quality. All of each method will be more described the deeply details in next section. In the case of all angle projections, the reconstruction problem will be well-solved without ineluctable artifact in the discrete computation.

The projection data is observed from the limited-view angles in the cases of the metallic implants in patients in medical, ocean acoustic tomography, electron microscopy of macromolecules, and so on. Then the problem is to become a kind of ill-posed type. An iterative Fourier method is to use the relationship between the given sections and prior information in Fourier and object domains. Although many kind developments for the algorithms for solving the limited view CT, the stagnation and fail to converge still are unsolved. Goal of our research is to construct support in order to find black region (pixel intensity is 0) in image reconstructed by projection profiles. Consequently, it is necessary to receive a good image as well as possible.

In this paper, we consider the combination of conventional methods for CT and focus on recent developments of the noise filtering method [3] [4] and some traditional techniques (ART, FBP and iterative Fourier method) [2] [5] - [10] , then introduce and discuss the reconstruction method that is based on ART, FBP, iterative Fourier transform and their hybrid with a numerical example.

2. Methodology

2.1. Total Variation

The total variation function is popular in several fields of mathematical image processing. The idea of the total variation has been firstly introduced as a denoising technique by Rudin, Osher and Fatemi [4] in Computer Vision. It is used as a global regularization term. Total variation is not only used for denoising, but also for more general signal restoration problems.

In this paper, Total Variation Denoising (TVD), also known as total variation regularization was used to be an approach for noise reduction which is defined in terms of an optimisation problem. In order to find the output of the TV denoising, output is obtained by minimizing a particular cost function. Although the algorithm can be solved in several different ways, the derivation is based on the min-max property and the majorization-minimization procedure given in [11] . In our experiment, we focus the numerical implementation of total variation denoising for one-dimensional discrete signals which are represented as projection profile of each perspective.

Let us consider a discrete real-valued in projection pro-file of N-point signal
$x\left(i\right)$ defined on
$1\le i\le N$ . The total variation measures how much the signal changes between signal values. There are many ways to define discrete TV by means of finite different signal value, but we used absolute values (l^{1} norm) because it is one of the simplest ways which is defined as

$\text{TV}\left(x\right)=\underset{i=2}{\overset{N}{{\displaystyle \sum}}}\left|x\left(i\right)-x\left(i-1\right)\right|$ (1)

Suppose $y$ is a signal consisted by original signal $x$ and additive white Gaussian noise $n$ as the following.

$y=x+n$ (2)

We want to estimate the target $x$ by using iterative clipping algorithm [3] to minimize the objective function which the general form of its can be defined as

${x}_{\mathrm{min}}=\mathrm{arg}{\mathrm{min}}_{x}\left\{y-{x}_{2}^{2}+\lambda \text{TV}\left(x\right)\right\}$ (3)

Smoothness of the signal is controlled by the regularization parameter $\lambda $ .

To find parameter $x$ , the iterative clipping algorithm for TV denoising was applied and it was clearly explained in [3] . In order to enhance image quality after performing TV method, directional Total Variational algorithm in various patterns were performed also. The proposed algorithm consists of 6 patterns of converting 2D image to 1D data shown in Figure 4. In each step of directional total variational algorithm, The TV denoising is processed on 1D data after transforming from 2D image. Then 1D data is converted back to 2D image again. The results are retained the smooth 1D projection and combined the ensemble in final step.

Figure 4. Block diagram patterns of the directional total variational algorithm. (a) top- down horizontal directional pattern based on TV filtering, (b) bottom-up horizontal directional pattern based on TV filtering, (c) top-down vertical directional based on TV filtering, (d) bottom-up vertical directional based on TV filtering, (e) zig-zag directional pattern 1, (f) zig-zag directional pattern 2.

2.2. Iterative FT

An iterative FT presented in this paper is used for combining analytical and algebraic reconstruction techniques. An iterative methods such as Algebraic Reconstruction Technique (ART) and analytical Fourier methods such as Filtered Back projection (FBP) have been considered by several applications. There are many approaches in image reconstruction field using projection data, and almost of those methods were developed from ART algorithm because of its simple principle and good effectiveness. The fundamental equation is presented by the following.

$\underset{j=1}{\overset{N}{{\displaystyle \sum}}}{A}_{ij}{f}_{j}={p}_{i}\text{}i=1,\cdots ,M$ (4)

where each ${p}_{i}$ is a projection along ${i}^{\text{th}}$ ray; M is the total number of rays in all projections; and ${A}_{ij}$ is a weight of every pixel for all the different rays in the projection; ${f}_{i}$ represents a column vector which contains the values of pixels and N is the total number of pixels. However, in most cases the ray width is often approximately equal to the cell width of the image and a line integral is called a ray sum. The implementation of ART [2] is formed by the Kaczmarz method due to the following.

${f}_{j}^{k+1}={f}_{j}^{k}+\alpha \left\{\frac{{p}_{i}-{{\displaystyle \sum}}_{n=1}^{N}{A}_{in}{f}_{n}^{k}}{{{\displaystyle \sum}}_{n=1}^{N}{A}_{in}^{2}}{A}_{ij}\right\}$ (5)

where ${f}_{j}^{k}$ and ${f}_{j}^{k+1}$ are the current and updated vector respectively; $\sum}_{n=1}^{N}{A}_{in}{f}_{n}^{k$ is the sum of pixels along ${i}^{\text{th}}$ ray in ${k}^{\text{th}}$ iteration; and ${p}_{i}$ is the sum of projection for the ${i}^{\text{th}}$ ray; and $\alpha $ is a coefficient.

Next, we will explain regarding algorithm of FBP solution. The FBP method uses a relationship between the Fourier transform of the projections of a target image and the correspond sections in the Fourier domain. It is based on the Radon transform. $\left(r,\theta \right)$ is a polar coordinate of the object domain, and F is the Fourier transform of the target image. The relationship is presented as the following.

$F\left(\rho \mathrm{cos}\theta ,\rho \mathrm{sin}\theta \right)={\displaystyle {\int}_{-\infty}^{\infty}g\left(r,\theta \right)\mathrm{exp}\left\{-j2\text{\pi}r\rho \right\}\text{d}r}$ (6)

where $g\left(r,\theta \right)$ is the projection with angle $\theta $ and site $r$ , then it is represented by ${{\displaystyle \int}}^{\text{}}f\left(r\mathrm{cos}\theta -s\mathrm{sin}\theta ,r\mathrm{sin}\theta +s\mathrm{cos}\theta \right)\mathrm{exp}\left\{-j2\text{\pi}r\rho \right\}\text{d}s,$ and non-italic $j$ presents imaginary unit.

We started to construct image using ART as an initial input before iterative FT was applied in next step to enhance the quality of image. The concept of iterative revision model was first provided by Gerchberg and Saxton in order to solve the problem of structure in science imaging. A plausible result is provided by the popular methods, ART and FBP, with enough constraints. However, the problem becomes to be an ill-posed type in the case of the limited view. As a good method using the Fourier domain for such the situation, an iterative Fourier transform method was presented in the GP (Gerchberg-Papoulis) algorithm [12] , and the more development was presented in later [5] . The algorithm was presented in Figure 5, and it consists of the following four steps: 1) F is obtained by the Fourier transform of a prior $\rho $ ; 2) replace $F$ with ${F}^{\prime}$ to satisfy the Fourier domain constraint; 3) ${\rho}^{\prime}$ is given by the inverse Fourier transform ${F}^{\prime}$ and 4) replace ${\rho}^{\prime}$ by $\rho $ that allow it to satisfy the object domain, the prior is updated. The diagram of iterative process is shown in Figure 6.

The sections are overwritten by the given projections in 2), and a prior knowledge of the target is embittered to the ${\rho}^{\prime}$ in 4). The following is well used as one of the updated method in 4),

$\rho \left(r\right)\to \{\begin{array}{l}{\rho}^{\prime}\left(r\right)\text{}r\notin D\hfill \\ 0\text{}r\notin D\hfill \end{array}$ (7)

where D is the region at which ${{\rho}^{\prime}}_{n}$ violates the object-domain constraint such the prior knowledge.

Such the updating procedure has been developed in the challenging the phase retrieval problem [8] , and the more refinement are expected using the progress than before. In the limited view of the tomographic problem, each method cannot give a good result in the meaning of the initial condition, parameters, itera-

Figure 5. An illustration of iterative method.

Figure 6. Diagram of iterative procedure.

tions, and falling to the global solution. Therefore, in this presentation, we show a good hybrid of ART, FBP and iterative Fourier transform for the limited view constraint. The algorithm can be explained by following operations:

1) Construct 2D image as initial input which is constructed by traditional method (ART).

2) Construct sinogram from projection project of each angle $\theta $ .

3) Take Fourier transform of r to obtain 1D-FT.

4) Revise $F$ by replacing 1D-FT from step 2) by 1DFT of original projection value and ramp filtering are applied.

5) Obtain inverse 1D-FT for the filtered projection for each $\theta $ .

6) Take inverse FT and obtain reconstructed image by back projection method.

7) Revise reconstructed image by applying a prior data and support in image space.

8) Go to step 2).

These eight steps are repeatedly calculated until the process is stopped under some suitable condition of convergence. The criterion which is used to terminate process is the ratio of error between distance of original profiles and profiles of reconstructed image to become sufficiently small. Unfortunately, the number of iteration can be easily fixed but ε or value makes loop terminated cannot be fixed or set only one constant. Different data provide different distance. Thus, appropriate way is to select the result that provides the smallest distance of a set of projection in fixed iteration. In our presentation, the iterative method is connectively used with ART and FBP.

2.3. K-Means Clustering for Support Construction

The definition of object support (outline of the object) in real space is a region of interest where a target object is located. In order to construct support of reconstructed image, K-means clustering for support construction in diffractive imaging approach [7] was used in our work. K-means is an unsupervised clustering algorithm that can classify the input data points into multiple classes. In the beginning, the object domain is divided into two kinds of regions: one is the object support and the other is its complement. When the external shape of the object is clearly determined, the image intensities from areas except for the external dimension are set to be 0 (zero) (real-space constraint conditions). In this experiment, value of K is set equal to 2 because we will focus only 2 regions between object and non-object support. An algorithm of K-means for constructing support can be more clearly explain each step by following:

1) Calculate $\left|{\rho}^{\prime}\right|$ from $\rho $ .

2) Set an initial cluster presented in Figure 7.

3) Calculate center of C1.

a) $\text{center}\_c1$ = center value of C1.

b) $\text{center}\_c1$ = $\frac{1}{N\_c1}{\displaystyle {\sum}_{r\in c1}\left|{\rho}^{\prime}\left(r\right)\right|}$ .

where $N\_c1$ is number of pixel in region C1.

4) Calculate center of C2.

a) $\text{center}\_c2$ = center value of C2.

b) $\text{center}\_c2$ = $\frac{1}{N\_c2}{\displaystyle {\sum}_{r\in c2}\left|{\rho}^{\prime}\left(r\right)\right|}$ .

where $N\_c2$ is number of pixel in region C2.

5) For $r<N:N$ is number of all pixel.

If $\text{d}\left(\left|{\rho}^{\prime}\left(r\right)\right|,\text{center}\_c1\right)<\text{d}\left(\left|{\rho}^{\prime}\left(r\right)\right|,\text{center}\_c2\right)$

$r\in C1,r\notin C2$

Else

$r\in C1,r\notin C2$

6) Consider region of object by comparing value between C1 and C2.

7) Expand 1 pixel region around object.

8) Go to step 3 and repeat until value of C1 and C2 are not changed.

A simple schematic diagram of K-means clustering method is illustrated in Figure 8. An initial support can be randomly given and then each cluster is updated by K-means iteration which is shown an example of process result in Figure 9. The benefits of using K-means clustering method are effectively to construct support without many setting conditions.

Figure 7. An example of initial cluster.

Figure 8. K-means diagram.

Figure 9. Support construction.

2.4. Maximum Entropy Thresholding

In image segmentation field, information entropy that occasionally called Shanon’s entropy [12] or maximum entropy is one of the effective techniques to automatically find the optimal threshold. Moreover, it is being increasingly widely used as an optimal technique of image reconstruction in case noisy, incomplete data and elsewhere. In this paper, we applied maximum entropy to construct better support after obtaining from K-means method in previous step. While K-means method is performed to firstly construct initial support, maximum entropy creates more reasonable support.

For the single threshold, an algorithm can be summarized by the following. Suppose that value of a normalized histogram is shown in term of $h\left(i\right)$ which $i$ takes integer values from 0 to N and result is converted to 8 bits gray scale image, that is: ${\sum}_{i=0}^{255}h\left(i\right)}=1$ . By using $t$ as a threshold value, an entropy of black pixels is defined by

${H}_{B}^{t}=-\underset{i=0}{\overset{t}{{\displaystyle \sum}}}\frac{h\left(i\right)}{{{\displaystyle \sum}}_{j=0}^{t}h\left(j\right)}\mathrm{log}\frac{h\left(i\right)}{{{\displaystyle \sum}}_{j=0}^{t}h\left(j\right)}$ (8)

and an entropy of white pixels is given by

${H}_{W}^{t}=-\underset{i=t+1}{\overset{255}{{\displaystyle \sum}}}\frac{h\left(i\right)}{{{\displaystyle \sum}}_{j=t+1}^{255}h\left(j\right)}\mathrm{log}\frac{h\left(i\right)}{{{\displaystyle \sum}}_{j=t+1}^{255}h\left(j\right)}$ (9)

The optimal threshold maximizing the sum of above two entropies is presented as the following. An example of the result of optimal threshold is shown in Figure 10.

${t}_{\mathrm{max}}=\mathrm{arg}{\mathrm{max}}_{t}\left({H}_{W}^{t}+{H}_{B}^{t}\right)$ (10)

Figure 10. An illustration of histogram.

3. Experimental Result

The performance of the proposed algorithm for an ex-ample of a test signal (projection profile at 0˚) with SNR of 30 dB is shown in Figure 11. The original signal is shown in Figure 12(a). The noisy version of the signal is shown in Figure 12(b) and the output result after performing noise reduction is shown in Figure 12(c). We set the proper regularization parameter lambda. The error results are summarized in Table 1. Then, reconstructed image results were illustrated in Figure 4. In Table 1, we compare error of distance between original projection profiles and projection profiles of reconstructed image. Projection profiles of reconstructed image can be obtained 2 ways between reconstructed image by using FBP under Non-filtering method conditions and proposed method (Total Variation Denoising).

Figure 11. Schematic diagram of procedure.

Figure 12. (a) Original projection at 0˚, (b) projection at 0˚ with noise, (c) projection profile at 0˚ after using TV denoising.

Table 1. Angles and corresponding error.

There are typical methods for the reconstruction of an unknown object using the constraints of the object and Fourier domains. For presenting the effectiveness of a hybrid procedure mixing method referred to previous section, a numerical example is settled in the following. The Shepp-Logan phantom (256 × 256) is used for a target object in Figure 12. As the numerical comparison, the result of our pro-posed method is better than traditional methods (ART and FBP) in the meaning of the error calculated by Euclidean distance of each projection profile.

In the next example from Figures 13-16, to test the robustness of the algo-

Figure 13. (a) Original image, (b) Reconstructed image with noise, (c) Reconstructed image after using TV denoising, (d) Reconstructed image after using TV denoising and support construction, (e), (f), (g) and (h), projection profiles of (a), (b), (c) and (d).

Figure 14. (a) Original image, (b) Reconstructed image corrupted by white Guassian noise, (c) Reconstructed image result after performing TV denoising method, (d) Support constructed by K-means clustering, (e) An illustrate of projection profiles at 0˚ of (a), (f) An illustrate of projection profiles at ${0}^{\xb0}$ of (b), (g) An illustrate of projection profiles at ${0}^{\xb0}$ of (c), (h) Final support result constructed by maximum Entropy thresholding and K-means clustering.

Figure 15. (a) Original image, (b) Reconstructed image corrupted by white Guassian noise, (c) Reconstructed image result after performing TV denoising method, (d) Support constructed by K-means clustering, (e) An illustrate of projection profiles at ${0}^{\xb0}$ of (a), (f) An illustrate of projection profiles at ${0}^{\xb0}$ of (b), (g) An illustrate of projection profiles at ${0}^{\xb0}$ of (c), (h) Final support result constructed by maximum Entropy thresholding and K-means clustering.

Figure 16. (a) Original image, (b) Reconstructed image corrupted by white Guassian noise, (c) Reconstructed image result after performing TV denoising method, (d) Support constructed by K-means clustering, (e) An illustrate of projection profiles at ${0}^{\xb0}$ of (a), (f) An illustrate of projection profiles at ${0}^{\xb0}$ of (b), (g) An illustrate of projection profiles at ${0}^{\xb0}$ of (c), (h) Final support result constructed by maximum Entropy thresholding and K-means clustering.

rithm various noise attack are presented to the reconstructed image. Then, we showed the appearance of support constructed by K-means method compare with maximum entropy thresholding and example of projection profiles.

From experimental results, we can deduce that traditional method does not give a plausible image. However, our proposed method provides the better results than traditional method. When the support results are used to combine with the results from iterative FT, these results are a little refined, and such the hybrid gives a stable process for the reconstruction from the limited angles projections. The proposed method will be successful as compare with other traditional methods with noise reduction. However, the results of iterative methods are different in the situation of the stagnation and fail of convergence under the limited constraint of projections. The more refinement of unifying the reconstruction algorithms and developed computation for the ill-posed imaging problems is our future work.

4. Conclusion

To summarize, in this paper we tried to show the results after reconstructing an image using projections from different angles under various noise conditions assumed as Gaussian noise. In order to achieve, we divided into 3 steps for our experiment. Firstly, the topical filter method proposed by [3] was used to reduce noise in projection profiles. Then, an iterative technique was described for tomography image reconstruction in case the number of projections is small and the angular range is limited. Final step is to combine the reconstructed image with support constructed by K-means clustering techniques widely used in diffractive imaging. The effectiveness of our proposed method was confirmed by program simulation. Future perspectives of the proposed work include the application of the implemented algorithm combined with other methods for the determination of optimal projection data.

Acknowledgements

The mathematical analysis and simulation system of our work are supported by MEXT/JSPS Kakenshi 16K00222, JST A-step AS26Z02472H and MP27115663145.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] | Karthik, S., Hermanth, V.K., Soman, K.P., Balaji, V., Sachin Kumar, S. and Sabarimalai Manikandan, M. (2012) Directional Total Variation Filtering Based Image Denoising. IJCSI, 9, 161-170. |

[2] |
Rudin, L., Osher, S. and Fatemi, E. (1992) Nonlinear Total Variation Based Noise Removal Algorithms. Physica D, 60, 259-268.
https://doi.org/10.1016/0167-2789(92)90242-F |

[3] |
Sato, T., Norton, S.J., Linzer, M., Ikeda, O. and Hirama, M. (1981) Tomographic Image Reconstruction from Limited Projections Using Iterative Revisions in Image and Transform Spaces. Applied Optics, 20, 395-399.
https://doi.org/10.1364/AO.20.000395 |

[4] |
Gordon, R. andHerman, G.T. (1974) Three-Dimensional Reconstruction from Projections: A Review of Algorithms. International Review of Cytology, 38, 111.
https://doi.org/10.1016/S0074-7696(08)60925-0 |

[5] |
Gullberg, G.T. (1979) The Reconstruction of Fan-Beam Data by Filtering the Back-Projection. Computer Graphics and Image Processing, 10, 30-47.
https://doi.org/10.1016/0146-664X(79)90033-9 |

[6] | Raparia, D., Alessi, J. and Kponou, A. (1997) The Algebraic Reconstruction Technique (ART). Proceedings of the Particle Accelerator Conference, 2, 2023-2025. |

[7] |
Hattanda, S., Shioya, H., Maehara, Y. and Gohara, K. (2014) K-Means Clustering for Support Construction in Diffractive Imaging. The Journal of the Optical Society of America, 31, 470-474. https://doi.org/10.1364/JOSAA.31.000470 |

[8] |
Shioya, H. and Gohara, K. (2006) Generalized Phase Retrieval Algorithm Based on Information Measures. Optics Communications, 266, 88-93.
https://doi.org/10.1016/j.optcom.2006.04.034 |

[9] |
Fienup, J.R. (1982) Phase Retrieval Algorithms: A Comparison. Applied Optics, 21, 2758. https://doi.org/10.1364/AO.21.002758 |

[10] |
Chambolle, A. (2004) An Algorithm for Total Variation Minimization and Applications. Journal of Mathematical Imaging and Vision, 20, 89-97.
https://doi.org/10.1023/B:JMIV.0000011321.19549.88 |

[11] |
Papoulis, A. (1975) A New Algorithm in Spectral Analysis and Bandlimited Extrapolation. IEEE Transactions on Circuits and Systems, 22, 735-742.
https://doi.org/10.1109/TCS.1975.1084118 |

[12] | Shannon, C.E. and Weaver, W. (1949) The Mathematical Theory of Communication. University of Illinois Press, Urbana. |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.