# Neural Network Blind Equalization Algorithm Applied in Medical CT Image Restoration

Authors: Yunshan Sun; Liyi Zhang; Jin Zhang; Lijuan Shi
Journal: Mathematical Problems in Engineering
 (2013)

---

## Abstract

A new algorithm for iterative blind image restoration is presented in this paper. The method extends blind equalization found in the signal case to the image. A neural network blind equalization algorithm is derived and used in conjunction with Zigzag coding to restore the original image. As a result, the effect of PSF can be removed by using the proposed algorithm, which contributes to eliminate intersymbol interference (ISI). In order to obtain the estimation of the original image, what is proposed in this method is to optimize constant modulus blind equalization cost function applied to grayscale CT image by using conjugate gradient method. Analysis of convergence performance of the algorithm verifies the feasibility of this method theoretically; meanwhile, simulation results and performance evaluations of recent image quality metrics are provided to assess the effectiveness of the proposed method.


---

## Body

## 1. Introduction

As one of the important methods in medical image diagnosis, CT image can achieve a high performance of visualizing and measuring microstructure of apparatus and tissue on detecting small lesions. However, CT has an issue that the recorded image represents a noisy and blurred version of the original scene, which is also common on many other applications such as astronomical imaging [1], sonar imaging [2], remote imaging [3], microscopy imaging [4], and medical ultrasound imaging [5, 6]. On one hand, this issue is caused by one of the facts that CT scanners cannot resolve many important temporal details, where part of the images was degraded by the underlying point spread function. One of the effective strategies to tackle this issue is digital image restoration, which is aimed at image resolution enhancement. On the other hand, the underlying point spread function (PSF) of the CT scanner is often unavailable in practice. Therefore, we develop a deblurring approach for resolution improvement of CT image without prior knowledge, or only based on partial and poor knowledge of the characteristics of the original image and the noise. In this paper, we will address the only problem by utilizing the degraded image only in order to obtain an estimation of the original scene and present a novel blind image restoration algorithm.Various methods have been proposed in the previous literatures to address the image restoration problem. These image restoration methods can be divided into two main classes [7]. The first class contains methods that separate blur identification as a disjoint procedure from restoration, such as maximum likelihood [8], generalized cross-validation [9], zero sheet separation [10], Bayesian estimation [11], maximum a posteriori [12], and expectation maximization [13]. The second class consists of methods that combine blur identification and restoration in one procedure, such as the iterative blind deconvolution techniques [14], the nonnegativity support constraints recursive inverse filtering [15, 16], simulated annealing [17], and total variation blind image deconvolution [18].The neural network approach for image restoration in both types is a relatively active topic. Artificial neural network has been studied for many years in the hope of achieving human-like performance via dense interconnections of simple computational elements. Based on our present understanding of biological nervous systems, neural networks have their greatest potential in areas such as signal processing and image recognition, in which many hypotheses are pursued in parallel and high computation rates and adoption are required, but the current best systems are still far from equaling human performance. Cheema et al. [19] presented an image restoration algorithm to identify noncausal blur function. The noisy and blurred images are modeled as continuous associative networks, whereas autoassociative part determines the image model coefficients and the heteroassociative part determines the blur function of the system. The neural network model combining an adaptive auto-associative network with a random Gaussian process is proposed to restore the blurred image and blur function simultaneously. In the literature [20], a nonlinear restoration of diffraction-limited images concurrently with quantization was accomplished in the process of image compression utilizing vector quantization neural network. Here, neural network is trained on image pairs consisting of a lossless compression named hierarchical vector quantization. Igor Aizenberg et al. [21] proposed a multilayer neural network with a traditional feedforward architecture image restoration algorithm based on multivalued neurons. A new image-reconstruction algorithm using the cellular neural network was presented to solve the Navier-Stokes equation and offer a robust method for estimating the background signal within the gene-spot region in [22]. Wu et al. [23] proposed the modified Hopfield neural network model for grey image restoration, which avoids the shortcomings of Zhou’s model, improves convergence speed, and possesses superior edge preserving performance.Blind equalization algorithm is to estimate the unknown system parameters and structure based on the system output but without prior knowledge of the inputting signal and the blur. Zhang et al. [24] proposed several blind equalization algorithms based on neural network, which present better performances such as quick convergence speed and small steady error in eliminating intersignal interface. The process of medical CT image degradation on constructing CT diagnosis image in medical image applications is equivalent to the formation process of inter-signal interface in the digital communication. Therefore, we develop a blind neural network approach for blind restoration of medical CT images.The neural network approach for blind image restoration proposed in this paper belongs to the second class. Preliminary results of blind equalization algorithm were first found in the signal case and then extended to the image. Secondly, a neural network blind equalization, which makes use of the similarity between the image degradation process and ISI, is derived and utilized in conjunction with Zigzag coding to restore the original image. We proposed the way of adopting Zigzag coding to transform the degradation image into a one-dimensional signal sequence. Thirdly, a one-dimensional signal sequence CMA cost function is also established and optimized by the gradient descent method to obtain the optimal estimation of the transformed signal. Meanwhile, a neural network blind equalization algorithm is adopted to eliminate the impact of point spread function. Compared to the existing algorithm, the novel method avoids two-dimensional matrix inverse iteration operation, reduces the complexity of the algorithm, and effectively improves restoration as well. Eventually, simulation results verify the effectiveness of the algorithm.The remainder of this paper is organized as follows. In Section2, the image and degradation models are reviewed, the formation of Zigzag coding is introduced, and the structure of feedforward neural network is revisited. The neural network blind equalization algorithm is derived and used in conjunction with Zigzag coding to restore the original image. Alternating minimization of the cost function is reviewed in Section 3. The convergence performance of the proposed algorithm is analyzed in Section 4. Simulation results obtained with simulated noisy blurred images are given in Section 5, and concluding remarks are given in Section 6.


## 2. Preliminary Knowledge

### 2.1. Degradation Model

In most cases, a linear blur and an additive noise process can be used to model the degradation process, which is commonly given by(1)g(i,j)=f(i,j)*h(i,j)+n(i,j)=∑k=0M∑l=0Nf(k,l)h(i-k,j-l)+n(i,j),
in whichg(i,j),f(i,j) and n(i,j), are images represent the degraded image, the original image, and additive noise, respectively; h(i,j) is the PSF of the blurring operator, and * denotes the mathematical operation of convolution.The purpose of blind image restoration is to estimate the original image without prior knowledge, or based on partial and poor knowledge of the characteristics off(i,j) and h(i,j), to obtain the estimation f^(i,j) of the original.


### 2.2. Zigzag Coding

In order to transform image into a 1-dimensional signal sequence, zigzag coding process is described with each element of image vector scanned by a simple zigzag graph. A zigzag array is a square arrangement of the first N2 integers, where the numbers increase sequentially as you zigzag along the antidiagonals of the array. The scrambling of matrix element is implemented by the above-mentioned course, and this process is called zigzag coding. For a graphical representation, the general structure of a zigzag coding is depicted in Figure 1.Zigzag coding.
(a)
The original data matrix
(b)
The sequence after Zigzag codingIn order to utilize blind equalization technology to complete medical CT image blind restoration, firstly, two-dimensional medical degradation CT images should be transformed into one-dimensional signal sequence by zigzag coding discussed previously.


### 2.3. Feedforward Neural Network

There exist several different neural network architectures available for medical imaging applications, but the most common one of them is the feedforward neural network. In a feedforward neural network, the neurons in each layer are only connected with the neurons in the next layer. These connections are unidirectional, which means that signals or information being processed can only pass through the network in a single direction, from the input layer through the hidden layer to the output layer. The most usual feedforward NN is composed of 3 layers: an input layer, a hidden layer, and an output layer. The structure of the described neural network is illustrated in Figure2 [25].Figure 2
Three-layer feedforward neural network.The above-mentioned three-layer feedforward neural network structure can be addressed to eliminate the effect of PSF and obtain the estimation of the original image.wlk(n) denotes the weight between the input layer and the hidden layer, l describes the index of the input neuron (l=0,1,…,L-1), wk(n) denotes the weight between the hidden layer and the output layer, and k describes the index of the hidden neuron (k=0,1,…,K).Suppose that the input of the input layer is given by(2)G(n)=[g(n),g(n-1),…,g(n-L+1)]T.For the sake of notational simplicity, we denote the input of the hidden layer byuk(n), define Ik(n) as the output of the hidden layer, describe v(n) as the output of the output layer, and utilize f~(n) as the output of neural network. State equations of feedforward neural network are represented as
(3)uk(n)=∑l=0L-1wlk(n)g(n-l),Ik(n)=q[uk(n)],v(n)=∑k=0Kwk(n)Ik(n),f~(n)=q[v(n)],
where q(·) denotes the transfer function not only between the hidden layer and the output layer, but also between the input layer and the hidden layer.As seen,L input units are included in the input layer, which is decided by the number of image elements. The number of neurons in the hidden layer is usually decided by experiments. Generally, a range of different numbers is tried in the hidden layer, and the number that achieves the best training results is selected. The number of neurons in the output layer is one to produce the estimation of the image. The algorithm works by iteratively altering the connection weight values for neurons based on the cost function. The actual modification of weights is carried out using a gradient descent algorithm, where the weights are modified after any iteration.


## 2.1. Degradation Model

In most cases, a linear blur and an additive noise process can be used to model the degradation process, which is commonly given by(1)g(i,j)=f(i,j)*h(i,j)+n(i,j)=∑k=0M∑l=0Nf(k,l)h(i-k,j-l)+n(i,j),
in whichg(i,j),f(i,j) and n(i,j), are images represent the degraded image, the original image, and additive noise, respectively; h(i,j) is the PSF of the blurring operator, and * denotes the mathematical operation of convolution.The purpose of blind image restoration is to estimate the original image without prior knowledge, or based on partial and poor knowledge of the characteristics off(i,j) and h(i,j), to obtain the estimation f^(i,j) of the original.


## 2.2. Zigzag Coding

In order to transform image into a 1-dimensional signal sequence, zigzag coding process is described with each element of image vector scanned by a simple zigzag graph. A zigzag array is a square arrangement of the first N2 integers, where the numbers increase sequentially as you zigzag along the antidiagonals of the array. The scrambling of matrix element is implemented by the above-mentioned course, and this process is called zigzag coding. For a graphical representation, the general structure of a zigzag coding is depicted in Figure 1.Zigzag coding.
(a)
The original data matrix
(b)
The sequence after Zigzag codingIn order to utilize blind equalization technology to complete medical CT image blind restoration, firstly, two-dimensional medical degradation CT images should be transformed into one-dimensional signal sequence by zigzag coding discussed previously.


## 2.3. Feedforward Neural Network

There exist several different neural network architectures available for medical imaging applications, but the most common one of them is the feedforward neural network. In a feedforward neural network, the neurons in each layer are only connected with the neurons in the next layer. These connections are unidirectional, which means that signals or information being processed can only pass through the network in a single direction, from the input layer through the hidden layer to the output layer. The most usual feedforward NN is composed of 3 layers: an input layer, a hidden layer, and an output layer. The structure of the described neural network is illustrated in Figure2 [25].Figure 2
Three-layer feedforward neural network.The above-mentioned three-layer feedforward neural network structure can be addressed to eliminate the effect of PSF and obtain the estimation of the original image.wlk(n) denotes the weight between the input layer and the hidden layer, l describes the index of the input neuron (l=0,1,…,L-1), wk(n) denotes the weight between the hidden layer and the output layer, and k describes the index of the hidden neuron (k=0,1,…,K).Suppose that the input of the input layer is given by(2)G(n)=[g(n),g(n-1),…,g(n-L+1)]T.For the sake of notational simplicity, we denote the input of the hidden layer byuk(n), define Ik(n) as the output of the hidden layer, describe v(n) as the output of the output layer, and utilize f~(n) as the output of neural network. State equations of feedforward neural network are represented as
(3)uk(n)=∑l=0L-1wlk(n)g(n-l),Ik(n)=q[uk(n)],v(n)=∑k=0Kwk(n)Ik(n),f~(n)=q[v(n)],
where q(·) denotes the transfer function not only between the hidden layer and the output layer, but also between the input layer and the hidden layer.As seen,L input units are included in the input layer, which is decided by the number of image elements. The number of neurons in the hidden layer is usually decided by experiments. Generally, a range of different numbers is tried in the hidden layer, and the number that achieves the best training results is selected. The number of neurons in the output layer is one to produce the estimation of the image. The algorithm works by iteratively altering the connection weight values for neurons based on the cost function. The actual modification of weights is carried out using a gradient descent algorithm, where the weights are modified after any iteration.


## 3. Feedforward Neural Network Image Blind Equalization Algorithm

In this section, the feedforward neural network image blind equalization algorithm applied to image restoration is shown in Figure3.Figure 3
Block diagram that describes the flow of the proposed algorithm.In Figure3, we denote 1D sequence transformed from the degraded image via zigzag coding by g(n). f~(n),f^(n),  and f^ij are the output of neural network blind equalizer, the output of the judgment, and the estimator of the image, respectively.Generally speaking, medical gray CT images are independently distributed source sequences [26]. Vural and Sethares [27] proposed a new method based on nonlinear adaptive filtering for blind deconvolution of noisy blurred images and essentially a 2D extension of the CMA. The method can either be used to initialize an adaptive blind deconvolution method or be used by itself. Conversely, a 1-D CMA cost function was utilized for the image restoration. The cost function of the observed image takes the form of
(4)J(n)=E[(|f~(n)|2-R2)2],
where R2 is a constant scalar depending on medical CT image.The proposed algorithm in this paper is implemented by iteratively altering the weights of neural network based on the CMA cost function. The actual modification of weights is carried out by using a gradient descent minimization algorithm, and the modified weights are present in the network after any iteration.In the wide application of neural network, the choice of transfer function has direct influence on the performance of neural network. There are several most commonly used transfer functions, for instance, the threshold function, the sigmoid function, the hyperbolic tangent function, and so on. In order to improve identification of neural network conveniently applied in the image restoration, the bipolar sigmoid activation function with smooth, gradual, and monotone properties, being conducive to the effective discriminant of the input signal sequence, is selected and utilized in the neural network. The form of transfer function is given by(5)q(x)=x+αex-e-xex+e-x,
where α represents the scale factor that controls classification effect of neural network, and the value of α is usually decided by experiments.The derivative ofJ(n) with respect to neural network parameters is needed to implement the gradient descent minimization. The derivative of J(n) with respect to W(n) can be evaluated, which is given by
(6)W(n+1)=W(n)-μ∂J(n)∂W(n)=W(n)-2μ[f~2(n)-R2]f~(n)∂f~(n)∂W(n).A three-layer feedforward neural network contains different connection weights so that we can obtain different weight iterative formulas.We denote the weight between the output layer and hidden layer bywk(n); hence, wk(n) is updated according to
(7)wk(n+1)=wk(n)-2μk[f~2(n)-R2]f~(n)q′[v(n)]Ik(n)=wk(n)-2μk[f~2(n)-R2]f~(n)×(1+4α(ev(n)+e-v(n))2)Ik(n),
where μk is a scalar parameter.w
l
k
(
n
) describes the weight between the input layer and the hidden layer, and then the updating equation is given by
(8)∂f~(n)∂wlk(n)=f′[v(n)]∂v(n)∂wlk(n)=wk(n)q′[v(n)]q′[uk(n)]g(n-k)=wk(n)(1+4α(ev(n)+e-v(n))2)×(1+4α(euk(n)+e-uk(n))2)g(n-k),
where μlk represents a scalar factor that controls the variation of the weight.Equations (7) and (8) constitute the proposed algorithm for blind deconvolution of noisy blurred images. Any iteration of the algorithm corresponds to processing a pixel in the blurred image. When convergence occurs, f~(n) provides an estimate of image sequence.


## 4. Performance Analysis

In order to prove the performance of convergence, we define an error function that is illustrated as(9)erf(W(n))=12∑n=1N(f~(n)-f^(n))2.Given some hypothesis conditions,(A1)
|p(x)|, |p′(x)|, and |p′′(x)| possess boundary continuity for x∈ℜ;(A2)
there exists a bounded setD⊂ℜ, and it makes all the weights of the network meet {W(n)}n=1∞⊂D;(A3)
the setD0={W(n)∈D:∂erf(W(n))/∂W(n)=0} only contains a finite number of points.Theorem 1.
On the premise of fulfilling learning rate requirements,W(n+1) iteratively obtained by the gradient descent algorithm and starting from any initial weight can satisfy the following:(1)
erf(W(n+1))≤erf(W(n)),(2)
limn→∞∥∂erf(W(n))/∂W(n)∥=0,(3)
considering network weight matrix, in the case of assumptions (A3) stated, there must be a pointW*∈D0, and limn→∞W(n)=W*.Here, conclusion (1) ensures monotone of error function when the neural network is utilized to optimize the cost function. Conclusion (2) reflects the convergence property of error function. In other words, the network weights start from arbitrary point of the space, and the norm of gradient of error function will eventually converge to 0. Conclusion (3) indicated that, in the case of existing limited extreme points of the error surface, the weights of the network will eventually converge to the global optimal solution.Proof.
For the sake of certified simplicity, we denote(10)φq,1n=∑k=1K∥∑n=1NΔW(n)∥q,φq,1n=∑k=1K∑n=1N∥ΔW(n)∥q.
Whether assumptions (A1) and (A2) are established, there must exist a constantγ satisfying (11) and (12) [28]:
(11)1μφq,1n≥γφ2,2n,(12)erf(W(n+1))≤erf(W(n))-1μφq,1n+γφ2,2n,(13)ςn=1μφq,1n-γφ2,2n.
(11) and (12) ensure that conclusion (1) was deduced.
From (12), we have drawn
(14)0≤erf(W(n+1))≤erf(W(n))-ςn≤erf(W(N))-∑n=1Nςn,
∑
n
=
1
N
ς
n
≤
erf
(
W
(
N
)
), when N→∞, then
(15)∑n=1∞ςn≤erf(W(N))<∞.
Whether assumptions (A1) and (A2) were established, there must be a constantc1 satisfying (16) and a constant c2 satisfying (17):
(16)∑n=1∞1n∥∂erf(W(n))∂W(n)∥2≤c1∑n=1∞(1μφ2,1n)<∞,(17)∑k=1K∑n=1N∥ΔW(n)∥≤c2.
The mean value theorem was, respectively, adopted forp(x) and p′(x), and there exists a constant c3 satisfying the following equation:
(18)|∥∂erf(W(n+1))∂W∥-∥∂erf(W(n))∂W∥|≤c3∑k=1K∥dk∥,
where dk=Wk(n+1)-Wk(n).
From (17) and (18), we can obtain
(19)limn→∞∥∂erf(Wk(n))∂Wk(n)∥=0.
Resembling (18), there is a constant c4 satisfying the following equation:
(20)∥∂erf(Wk+l(n+1))∂W-∂erf(Wk(n))∂W∥≤c4l.
Using (16) and (17), we have
(21)limn→∞∥∂erf(Wk+l(n))∂W∥=0.
Therefore, conclusion (2) was deduced from the premises.
From (18), we have drawn
(22)limn→∞∥Wk(n+1)-Wk(n)∥=0,k=1,2,…,K.
As mentioned perviously(23)∥W(n+1)-W(n)∥≤∑k=1K∥Wk(n+1)-Wk(n)∥.
Thus,(24)limn→∞∥W(n+1)-W(n)∥=0.
To prove this, a lemma was introduced [28].Lemma 2.
E
:
ℜ
M
N
+
M
+
1
→
ℜ is a uniformly differentiable function with a set D⊂ℜMN+M+1. The mathematical set D0={W∈D∣∂E(W)/∂W=0} only contains limited points. The sequence of {Wm}m=1∞⊂D satisfies the following conditions:
(25)limm→∞∥Wm+1-Wm∥=0,limm→∞∥∂E(Wm)∂W∥=0.
Then, there exists a pointW*⊂D0 if satisfying the following condition:
(26)limm→∞Wm=W*.
Becauseerf(W(n)) is a uniformly differentiable function, from (24) and the lemma, we can see that there exists W*∈D0 that satisfies
(27)limn→∞W(n)=W*.
Hence, it is not difficult to conclude the above.


## 5. Experimental Result

We illustrate the performance of the proposed method on handling noisy degraded medical CT images in the first experiment. Ten images used in this experiment are shown in Figure4. Each blurred image is generated by applying a Gaussian blurring kernel with standard deviation 0.001 to the original image first and then followed by Gaussian i.i.d. noise at a blurred signal-to-noise ratio (BSNR) [29] of 20 dB. An 11-5-1 network is adopted for the problem that we effectively overcome the effect of point spread function and restore the image with functions in (5) as transfer function. We set all of the step size to 0.0001 in the first test. The network is trained with random initial weights selected from the interval [01], and the training is terminated when the RMSE per epoch reaches 0.01. It is usually necessary to complete the training process for all images, respectively, and all of the training processes need about 75 iterations, respectively, in this experiment. The ISNR values range from 0.39 dB to 0.97 dB. On a more theoretical level, the choice standard of CT images that may have an influence on the performance of the proposed method is another important topic for further discussion.A set of images used for synthetic experiments.The following experiments display the comparison of performance between our proposed method and other methods. The sectional CT image of nasal pharynx chronic inflammation is utilized to illustrate the effectiveness of the proposed algorithm. In a second experiment, the original images of size256×256 shown in Figure 5(a) were degraded by a 25×25 Gaussian blur with a standard deviation of 0.002, followed by a 20 dB additive noise to form the noisy blurred images shown in Figure 5(b). In this experiment, we chose to use conjugate gradient to optimize an 11-5-1 feedforward neural network adopted in the simulation. The value of the step size between the input layer and hidden layer is μ1=5×10-7, and the value between the output layer and hidden layer is μ2=1×10-7. The rest of network training is similar to the first experiment. Note that the value of R2 depends on the grey level of image and has been manually fixed, R2=39320.0 [27].(a) Original image. (b) Noise blurred image.
(a)
(b)We compare the results of the proposed algorithm with iterative blind deconvolution algorithm, dispersion minimization algorithm, and reduction dimension constant module algorithm. The number of iterations of IBD is 100 and the restored image is shown in Figure6(a). The restored images of dispersion minimization algorithm and reduction dimension constant module algorithm are depicted in Figures 6(b) and 6(c), respectively. Figure 6(d) shows the result of the proposed algorithm. The restored image proposed in this paper is closer to the original image than the other ones. Overall, these results show that the proposed method has better performance on preserving the image characteristics in the restoration process.Restored image. (a) IBD algorithm. (b) Dispersion minimization algorithm. (c). Reduction dimension constant module algorithm. (d) The proposed algorithm.
(a)
(b)
(c)
(d)To quantitatively evaluate the restored images, the metric of the improvement signal-to-noise ratio (ISNR) [30] is employed. The performance comparison between various methods is tabulated in Table 1. Comparing with the original image in Figure 5(a), it is clear that the proposed algorithm can provide restored images with very high visual quality. ISNR values of various methods, whose ideal values are +∞, are presented in row 2 of Table 1. The larger the value of ISNR is, the higher the image quality is. It is clear shown in Table 1 that the proposed method performs better than the other approaches.Table 1
The comparison of performance.
Method
The proposed algorithm
Dispersion minimization algorithm
Reduction dimension constant module algorithm
Iterative blind deconvolution algorithm
ISNR
1.0622
0.9736
0.9986
0.7488In the third experiment, the original image shown in Figure7 was degraded with 10×10 Gaussian blur with a standard deviation of 0.05 followed by different additive noises to form the noisy blurred image in Figures 8(a) and 8(b). In this experiment, we chose to utilize the same network structure as the first one. Here, the step size factor between the input layer and hidden layer is μ1=1×10-9, and the one between the output layer and hidden layer is μ2=2×10-8. The rest of simulation conditions and network training are similar to the second experiment.Figure 7
The original CT image.(a) Noise blurred image at 20 dB BSNR. (b) Noise blurred image at 27 dB BSNR. (c) Restored image by the proposed algorithm for noise blurred image at 20 dB BSNR. (d) Restored image by the proposed algorithm for noise blurred image at 27 dB BSNR.
(a)
(b)
(c)
(d)The performance of the proposed method compared with the performance of other three methods including dispersion minimization algorithm, reduction dimension constant module algorithm, and iterative blind deconvolution algorithm is presented in Table2. It is also clear seen in Table 2 that the proposed method performs better than some methods having been put out.Table 2
The comparison of performance.
Noise BSNR
The proposed algorithm
Dispersion minimization algorithm
Reduction dimension constant module algorithm
Iterative blind deconvolution algorithm
20 dB
0.9064
0.8362
0.8485
0.8182
27 dB
0.9065
0.8762
0.8614
0.8082The proposed algorithm makes use of Zigzag coding to transform the degraded image into a signal sequence, and then the neural network blind equalization algorithm completes the elimination of point spread function. Even though by contrast the proposed algorithm is computationally complex, we can see that the method yielded, in almost all cases, a significant improvement in image quality. An illustrative example shows that the method has its practicability and maneuverability. Moreover, the improved hardware remedies repair the defect of the proposed algorithm on high computational complexity.


## 6. Conclusions

In this work, the neural network blind equalization for image restoration has been extended to a 2D case. Using blind equalization to overcome the effect of PSF is equivalent to eliminating ISI. We propose to utilize Zigzag coding to transform degraded image into 1-dimensional signal sequence, construct constant modulus cost function applied to grayscale CT image, and optimize the cost function to address blind image restoration. Experimental results have showed that the proposed method performs quite well in terms of both visual inspection and quantitative evaluation such as improvement peak signal to noise ratio. In addition, several issues will be further explored. We will study the sensitivity of the presented method towards the selection of parameters. We will also use real-life images to further evaluate the performance of the proposed method.



---

*Source: 743546-2013-03-19.xml*