Novel Image Restoration Approach Based on

A
Point Location in High-dimensional Space Geometry
WANG Shoujue, CAO Yu, HUANG Yi
Lab Neural Network,
Institute of semiconductors of Chinese
Academy of Sciences,
Beijing, 100083, China
E-mail: wsjue@red.semi.ac.cn

Abstract- The goal of image restoration is to restore the solution;

original clear image from the existing blurred image without
distortion as possible. A novel approach based on point location
in high-dimensional space geometry method is proposed, which
is quite different from the thought ways of existing traditional
image restoration approaches. It is based on the
high-dimensional space geometry method, which derives from
the fact of the Principle of Homology-Continuity (PHC). Begin
with the original blurred image, we get two further blurred
images. Through the regressive deducing curve fitted by these
three images, the fist iterative deblured image could be
obtained. This iterative "blurring-debluring-blurring" process
is performed till reach the deblured image. Experiments have
proved the availability of the proposed approach and achieved
not only common image restoration but also blind image
restoration which represents the majority of real problems.
Keywords- image restoration, high-dimensional space
geometry, PHC, PSF
I. INTRODUCTION
Inage restoration is an important branch in many image
processing applications. It is often considered as one part of
image pretreatment in many fields, such as restoration of
astronomical images with speckle, remote sensing images,
and medical imaging photos, etc. The goal of image
restoration is to reconstruct the original clear image from the
existing blurred image without distortion as possible. A good
many reports have proposed their achievements on it, among
which deconvolution El] is the major method. In most
situations of deconvolution methods, the blurred model is
assumed to be known prior to the deconvolution procedure,
including a variety of well known techniques such as inverse
filtering, Wiener filtering, and other constrained adaptive
restoration algorithm ['].
However, as we have all known, deconvolution approach
couldn't solve its inherent aspects as follows:
A. ill-conditioned problem. A small perturbation of the
given data produce large deviations in the resulting
B. the solution may not be unique. Since only partial
information about the imaging process is used to
formulate an optimality criterion, many different
estimates of the true image and point spread function
(PSF) may lead to an optimal solution.
In many practical situations, the degradation model is
often unknown or cannot be accurately modeled. That means
we still face a great deal of difficulty in getting
pre-knowledge from the existing blurred image to restore the
true image.
In- the past decade, with Neural Network research
increasing into image processing, many approaches based on
neural network occurred [2], such as modified Hopfield
network [3], fuzzy-logic adaptive neural networks ['¾, etc.
This list of approaches usually takes advantage of combining
several theorems so that it could get good results in some
extent. However, it lacks of theoretic guidance on choosing
the optimized network and could hardly remain the
smoothness and feature of the image.
In literatures [5], [6] and correlative reports [7 8 15]
Academician Wang Shoujue provides high-dimensional
space geometry method and theory. Based on this theory, we
apply it into pattern recognition [9, 10] including recognition
of omnidirectionally oriented rigid objects [1], human-face
personal identification [11, 12], continuous speech research [13],
etc., having obtained better results than traditional pattern
recognition methods. This article provides a novel approach
based on point location in high-dimensional space geometry
method which is applicable to both common image
restoration and blind image restoration [14]. Begin with the
blurred image, we get two further blurred images. Through
the regressive deducing curve fitted by these three images,
the first iterative deblured image could be obtained. This
iterative "blurring-debluring-blurring" process is performed
till the deblured image can satisfy the requirement.
After problem formulation in section II, we give the
basic idea of high-dimensional space geometry method
which derives from the fact of PHC [5] and the algorithm in
section HI. The experiments and results will be given in

0-7803-9422-4/05/$20.00 C2005 IEEE

301
section IV ,which strongly proved the validity and x2 +y2<R2
practicability of the approach. h(x y)={7R2
0 else
II PROBLEM FORMULATION
Obviously, this type of PSF expresses the blur caused by
A. Degradation model defocused lens system with a circular aperture. The
corresponding frequency zeros are concentric circles about
A universal degradation is illustrated as Fig. 1 as follows, the origin that are nearly periodic in R.
in which f(x,y) denotes a true image, h(x,y) may be a linear
shift-invariant blur, also known as the point spread 3) Gauss blur PSF
function(PSF), Ti (x,y) is additive noise, g(x,y) represents
the observed image or the called blurred image. _a(x2+y2) (x ,y) EC
h(xqy) ~
O else
ri (x, y) Where K is the unitary constant, a is a positive constant, C
is a circular support of h(x,y). This type of PSF expresses
f (x, y) g (x, y) the most common blur caused by complicated reasons such
h(x,y) < ) as diffraction and scattered light distortion of imaging
systems and optical measuring systems.
Figure 2 shows the original image and blurred images
corresponding to different blurred causes.
Fig. I Scheme ofuniversal degradation model

In our discussion and also real imaging restoration Original Image Motion Blurred Image
applications, we make following assumptions about the
image system:
1) There is no additive noise present in the imaging
system, that is:

g(x,y) = f(x,y) * h(x,y)

2) The true image f(x,y) and PSF h(x,y) have finite
support. Defocused Blurred Image Gaussian Blurred Image

B. Point Spread Function (PSF)

Although the causes of blurring might be complex and
manifold, merely numerable types of point spread function
could express the common blurred causes. There are three
types ofrepresentative PSF as follows.
1) linear motion blur PSF
0
h(x y)-' = Y$0
y 0-
-c<
-d!!
X!
<x5d
Fig.2 Blurred images corresponding to different blurred models (PSF)

This type of PSF expresses the blur caused by the motion In the following section IV, the experiment exactly on the
of imaging system relative to the object at constant speed image restoration with the type of defocused blur PSF is
during the image capture process. mainly discussed. We will show the process and results as
well.
2) Defocused lens blur PSF
III IMAGE RESTORATION BASED ON HIGH-DIMENSIONAL SPACE
GEOMETRY METHOD

A. Basic idea of high-dimensional space geometry

302
method
High-dimensional space geometry method is primely set
up with its application to pattern recognition. The basic idea
of this theory is the Principle of Homology-Continuity
(PHC). It is extracted from a rule of nature recognition:
If there exist two "homologous" within the same class but
not completely equal objects in everything being recognized
in the nature (including object, image, voice, language,
condition, etc.), the difference between them is gradual or
non-quantified, at least one gradual process must exist
between them and the objects in this gradual changing
process belong to the same class.
This rule is called the Principle of Homology-Continuity
(PHC) of homologous and con-generic things. The principle
could be simply expressed by the following. If x, y E A and
£ > 0 are given, there exists set B:
B={il =X,X2, ,Xn1,Xn =I
d(Xm, im+1) < , b'm E [Ln-1],m E N} c A
Where A is defined as a point set including all samples in image
it, d (Im xm+i) is defined as the distance between
Xm and Xm+i.
B. Image restoration based onpoint location in
high-dimensional space geometry method
Based on high-dimensional space geometry method, the
image restoration can be looked as a process of a series
homologous point locating which are spreading in
high-dimensional space. Within certain short distance, the
change of neighboring points is gradual. The unknown point
could be found by the information of known point and their
intrinsic relation.
Begin with the point in high-dimensional space
corresponding to the blurred image, we get two points
corresponding to the further blurred images. As a matter of
convenience and speediness, we get the two blurred images
along the blurring trend. Based on the point movement in
high-dimension space, through the regressive deducing
curve fitted by these three points corresponding to the three
blurred images, the deblured point corresponding to the
deblured image could be obtained. This
"blurring-debluring-blurring" process is performed
iteratively till the deblured image can satisfy the
requirement.
We can see intuitionally the primary idea of the approach
from Fig.3.
Further blurred orebure
= mg
imageAl1, B1I
| Further blurred 1< Deblured image l
| image A2, B2 X
|Final deblured image |
Fig.3 Scheme of the primary idea of the "bluring-debluring-blurring"
restoring process
C. Algorithm
We define the blurred point (note here: according to the
basic idea of the algorithm, an image corresponds to a point
in high-dimensional space, therefore, we called "image" as
"point" for the convenience of description) as Si, the two
further blurred image obtained from the blurring trend as Ai
and Bi respectively, the deblured image as Ci, the actual
as C. Thus we get the following equation based on the
given approach:
Ci = (1- kil ki2)Si+ kijAj + ki2Bi
-
Si+, = Ci
i= 1,2,...
Where kil, ki2 are coefficients of further blurred point Ai
and Bi respectively; i is the iterative number. According to
the subsection B in the above, we get the Ai and Bi along the
trend of assumed blurring trend with the information from
the observational blurred image in convenience. That is, if
we have observed the blur might be caused by the motion of
imaging system relative to the object, we get the two blurred
images by further motion blurring.
From the above expression, we can easily see the implied
mathematical meaning. Note that the coefficient of Si is
(1-kil-ki2). This constraint guarantees that the deblured point
Ci should be in the plane determined by Si, Ai and Bi. During
each iteration, Ci is the least square solution to the current
iterative equation. The solution is unique determined. That is
to say, a couple of (A, B, S) affirmatively exists so as to
make the frobenius
2i =Z[Si(x,y)-C]2 =min
i=l i=l
In fact, there surely exists
1I SI -C112 >11S2 -C112>11 S3 -C112.... 20
303
 3) Choosing proper coefficients kil, k12;
S2 4) Obtaining the ith iteration of Ci from:
S3 Ci = (1 - kil - ki2)Si + kilA + ki2B.
2 5) Replace Si+, with Ci, return to step 3, let i=i+l;
4
6) Observing the output clear image, stop the procedure
S, till the deblured image could satisfy the required vision
-..A
effect.

Si IV EXPERIMENTS AND RESULTS

Experiments have proved the validity and practicability of

Fig.4 Scheme of the proposed iterative restoration algorithm this new method. One of experiment results are shown in
below Fig.5.
The first row is the restoration from the original blurred
Namely, this algorithm is convergent. With the ongoing image to deblured image of the first iteration. From the
iteration, the error will possibly reduce. Thus, the clear observed original image, we got the two further blurred
image will be achieved. Figure 4 embodies the convergence imagesAj, B1 which were generated from the original
of this iterative algorithm. blurred image by further defocused blurring. The second row
The algorithm procedure is described as following steps: was deduced by analogy. From this figure the iterative
1) Definitions: restoring process can be easily seen.
Si, blurred image;
Ai, one further blurred image;
Bi, the other further blurred image;
Ci, the ith iterative clear image;
i, iteration number.

Fig.5 Scheme of the partial iterative restoration process of one experiment

2) Initialization: S1, source blurred image, i=l; Another experiment result is presented here, which is

304
from the author's defocused photo. The source blurred image image processing" (in Chinese), Information and Control, Vol.32, No.4,
and final clear image are shown directly as follows: pp.344-351, Aug 2003.
[3] Joon K p. "Image restoration using a modified Hopfield network"
[J].IEEE Transactions on Image Processing, 1992, l(l):pp.49-63.
[4] Clarke L P, Qian W. "Fuzzy-logic adaptive neural networks for nuclear
medicine image restoration" [A], The 20th Annual International
Conference on Engineering in Medicine and Biology Society[C]. 1998,
vol.3, pp: 1363-1366.
[5] WANG Shoujue, "Biomimetic Pattern Recognition" (in Chinese), Acta
Electronica Sinica, Vol.30 No.10, pp. 1417-1420, Oct 2002.
[6] Wang Shoujue, "Biomimetics Pattern Recognition", Neural Networks
Society (INNS, ENNS, JNNS) Newsletter, Vol.1, No.1, pp.3-5,
Mar.2003.
[7] Wang Shoujue and Lai Jiangliang,"Geometrical learning, descriptive
geometry, and biomimetic pattern recognition", Neurocomputing, vol 67,
n 1-4 SUPPL., pp. 9-28, August, 2005.
[8] Wang Shou-jue and Wang Bai-nan, "Analysis and Theory of
High-Dimension Space Geometry for Artificial Neural Networks", Acta
Electronica Sinica Vol.30 No.1 Jan. 2002.
Fig.6 Scheme of the result of another experiment [9] Wang Shou-jue, Chen Xu, "Biomimetic Pattem Recognition-A New
Model of Pattem Recognition Theory and Its Applications", Acta
Electronica Sinica, Vol.30, No. 10, Oct. 2002.
[10] Wang Shoujue and Zhao Xingtao, "Biomimetic Pattern Recognition
Theory and Its Applications", Chinese Journal of Electronics, Vol.13,
V CONCLUSIONS No.3, July 2004.
[11] Wang Shoujue, XUJian, Wang Xianbao, Qin Hong, "Multi-camera
Human-face Personal Identification System Based on the Biomimetic
The given paper proposed a novel approach based on Pattern Recognition" (in Chinese), Acta Electronica Sinica, Vol.3 1, No.1,
point location in high-dimensional space geometry method, pp: 1-4, Jan 2003.
which explores a completely new method to solve the [12] Wang Shoujue, Qu Yanfeng, Li Weijun, Qin Hong, "Face Recognition:
problems in image pretreatment. Quite different from the Biomimetic Pattern Recognition vs. Traditional Pattern Recognition", (in
Chinese), Acta Electronica Sinica, Vol.32, No.7, pp 1057-1061,
thought ways of existing traditional image restoration July.2004.
approaches, it is based on the point location of [13] Wenming Cao, Xiaoxia Pan, Shoujue Wang, "Continuous Speech
high-dimensional space geometry method, which derives Research Based on Two-Weight Neural Network", Advances in Neural
from the fact of the Principle of Homology-Continuity Networks - ISNN 2005: Second International Symposium on Neural
Networks, LNCS 3497, pp. 345-350, 2005.
(PHC). Begin with the blurred image, we get two further [14] Kundur.D and Hatzinakos.D, "Blind Image Deconvolution", IEEE
blurred images. Through the regressive deducing curve fitted Signal Processing Magazine, Vol.13, Issue 3, pp.43-64, May 1996.
by these three images, the clearer image could be obtained. [15] Shoujue Wang, A New Development on ANN in China - Biomimetic
This iterative "blurring-debluring-blurring" process is Pattern Recognition and Multi Weight Vector Neurons, Rough Sets,
Fuzzy Sets, Data Mining, and Granular Computing: 9th International
performed till the deblured image can satisfy the visual Conference, RSFDGrC 2003, LNA12639,pp.35-43, 2003.
requirement. This algorithm guarantees the solution to be
convergent to the final clear image. Experimental results
have proved the availability of the approach. Compared with
deconvolution methods, this method avoids the
ill-conditioned problem, while guarantees uniqueness and
convergence of the solution.
In addition, this given approach is still worthy of further
research, such as finding its potential and more detail
comparisons from other methods through experiments,
improve the algorithm and extend the method to more wider
fields.

ACKNOWLEDGMENT

National Natural Science Foundation of China

(NO.60474073) supported this work.

REFERENCES

[1] Zou Mouyan, Deconvolution and Signal Recovery (in Chinese).

Beijing:National Defence Industry Press, 2001.
[2] Xu feng, Lu jiangang, Sun Youxian, "Applications of Neural Network to

305