Structure Matching Algorithm of Fingerprint Minutiae

Based on Core Point

Weiwei Zhang, Sen Wang, Yangsheng Wang

National Laboratory of Pattern Recognition, Institute of Automation,
Chinese Academy of Sciences, Beijing, 100080, China
{wwzhang, swang, wys}@nlpr.ia.ac.cn

Abstract: Fingerprint matching algorithm is a key issue of the fingerprint recognition, there already
exist many study about fingerprint matching algorithms. According to dependence on core point,
fingerprint matching algorithms can be grouped into two categories: core-based match algorithms
and structure-based match algorithms. Most of the structure-based matching algorithms are time
consuming, therefore they are not suitable for online application. Meanwhile, core-based matching
algorithm is more efficient than the structure-based matching algorithm, but it highly depends on core
point detection precision. In this paper, we present a new core-based structure matching algorithm
which both considers efficient and precision. Firstly we use core point detection algorithm to find the
core point and define some local minutiae structures around core point. Through matching these local
minutiae structures, we can get some corresponding points of the two fingerprint images. Secondly,
we use the corresponding points to match the global feature of fingerprints, where a match table is
constructed to prevent one to many false minutiae match. Finally, we promote the global match
distance and global match distance variance to help make the final decision. Experimental result
shows that the performance of the proposed algorithm is good.

Keywords: Fingerprint recognition, core point, matching algorithm, structure matching

1. Introduction

Fingerprint-based personal identification has been used for a very long time owning to their
uniqueness and immutability. Today, fingerprints are the most widely used biometrics features in
automatic verification and identification systems. Most automatic fingerprint identification systems
(AFIS) are based on local ridge features, such as ridge endings and ridge bifurcations [1].
The key issue of the fingerprint recognition is the minutiae matching algorithm. Although there
exist a lot of matching algorithms in literature, most of them are not suitable for on line application
because of the following difficulties:
1. The alignment of two minutiae features vectors. After the feature extraction of fingerprint, we get
a minutia feature vector. And we need alignment the feature vectors before matching them. According
to usage of core point, the alignment methods can be divided into two groups: core-based alignment
and structure-based alignment methods.
2. Due to the noise of the fingerprint image, the preprocessing algorithm can not remove all of the
noise from feature vector. Therefore, the match algorithm should robust to noise.

1
 3. The geometric distortion of the fingerprint image may greatly affect the match algorithm, and
there still is no effective method to deal with this nonlinear distortion.
Moreover, the on-line system requires the matching speed as fast as possible, together with small
size template. In order to solve the difficulties mentioned above, there are a lot of researches dealing
with some of them in the literature.
In [12], Z. Chen proposed a topology-based matching algorithm of fingerprint authentication. In
their algorithm, they constructed a structure for minutiae in a pre-specified neighborhood, and then
used a tree matching algorithm to match two fingerprint templates. Their algorithm is invariant to
translation, rotation and does not depend on core point. Whereas, their algorithm will be greatly
affected by noise. When noise increases, the performance of their algorithm degrades rapidly.
Furthermore, they constructed a structure for each minutia, this lead to a large size template. Andrew
K Hrechak proposed a structural matching algorithm [11], which used the local structure of the
minutia to describe the characteristics of the minutiae. And in [13] some improvements for this
approach are proposed. Both of those two methods just used the local structure information of the
fingerprint. However the local structures from the same finger may have less similarity due to noise,
and they need to build the local structure during the feature extraction stage, which will lead to a large
size template. Therefore their algorithm is not suitable for the on-line application. In [1], Jain
proposed an alignment-based elastic matching algorithm in which the ridge link to the minutiae is
used to alignment the feature vectors. In order to do this alignment, they save ten sample points of the
ridge which link the minutiae. This also leads to a large size template.
In [5], Xudong. J proposed a matching algorithm which is based on local and global structures.
First they used the k-nearest neighborhood minutiae of each minutia form the local minutia structure,
and defined a similarity level to measure the similarity of two local structures. Then they used the
most similar minutiae pair as the corresponding point to alignment the feature vectors, and matched
the global feature vectors. This method has some advantages in processing speed and robustness to
rotation. However, they need to extract the minutiae type and ridge line count between each minutiae
and its k-nearest neighborhood exactly, therefore the performance of their algorithm will be greatly
affected by the noise. In [6], Nalini K. Ratha proposed a fingerprint authentication algorithm using
local structural information. Firstly, they obtained a minimum set of matched node pairs by matching
their neighborhood structures. Then they included more pairs in the later matching stage by
comparing distances with respect to matched pairs obtained in the first phase. Their methods are
robustness in large fingerprint database, but their processing speed is low, therefore this method is not
suitable for the online application.
When considering an on line application, none of the above mentioned method is suitable for this
type application because of the template size and the system efficiency. In this paper, we propose a
new core-based structure matching algorithm which considers both efficiency and precision. Firstly,
we use core detection algorithm to get the core position, and then define some local structure for the
minutiae near the core point. Through matching those local structures, we can get some corresponding
points of the two fingerprints. Secondly, we use the corresponding points in the first stage to match
the global feature of the fingerprint. Finally, we use the global matching distance to help the final
decision making. The core point detection method is present in Section 2. In Section 3, the method of
local structure matching is presented. The global feature matching algorithm and final decision
making algorithm is presented in Section 4. In Section 5, experimental results of the algorithm are
shown. Finally, the conclusions are given in Section 6.

2. Core point detection

2
 In the early work, we developed a fast multi-resolution based core point detection algorithm [7]. It
mainly involves two steps: Firstly, we use the low resolution direction field to localize a singular area
which includes the core point. Secondly, we use high resolution direction field of singular area to
precisely localize the core point. Using this multi-resolution method, we can localize the core point in
block levels fast and precisely.
Due to various image qualities, our algorithm can not localize the core point in pixel level;
therefore, we can not directly use the core point as the reference point for the matching algorithm. But
in most cases, the core point detection is very precise, which will locate the singular point within 8*8
pixels. If we use this reference information, we can greatly reduce the search space, thus improving
the efficiency of the matching algorithm. According to this idea, we develop a core based matching
algorithm in this paper, which uses the core point to select some minutiae points, and uses those
minutiae points to construct a lot of local structures. Local and global matching is based on those local
structures.

(a) Core Point (b) Delta Point

Figure 1, Direction field near the singular soint

We choose core point as the reference point for the following three reasons: Firstly, there exists rich
minutia information in close around core point region than others, which will help to construct
uniquely local structure. Secondly, due to our early work, we can easily localize the core point, the
details of the core point detection algorithm are found in [7]. Finally, owning to the guidance of core
point, we only need to construct local structure for a small amount of minutiae. This will greatly
reduce the template size and improve the efficient of our matching algorithm.

3. Local structure matching

Usually, when an expert recognizes a fingerprint, he would first finds correspond of fingerprint
features and then correlates the features based on minutia type, position, orientation and location
relative to other features. Usually, we want to let the computer do as the human expert does. That is,
firstly we use the local structure of the fingerprint to find some corresponding point pairs through
structure matching, and then we match the global feature vector of the two fingerprints based on those
corresponding point pairs.
As we know, local structure of the fingerprint minutiae has some properties which help us to match
the fingerprint:
1) Local structures in a small area from the same fingerprint are similar in minutiae type, distance
and angle.
2) Local structures in a small area from different fingerprints are often different in minutiae type,
distance, angle and topology information.
3) Fingerprints which come from the same finger often have many similar local structures.

3
 4) Fingerprints which come from different fingers often have less similar local structures than those
from the same one.
Usually there are 30~60 minutiae in one fingerprint. If we construct local structure for every
minutia, the template size will be very large, and large template will decrease the system’s efficiency.
In our algorithm, we only select the minutia near the core point of the fingerprint, the selection rule is:
M − Core < R (1)
where M and Core denote the minutia and core point respectively, | | denote the distance function, R is
a constant which is determined by experiment. Usually, 10~15 minutiae are enough for the local
structure. Therefore, reader can adjust the R according to the minutiae count.

3.1 Definition of local structure

In this section, we present the local structure definition of minutiae that are used in our match
algorithm. Usually, there are two ways to construct local structure.
The first one is use all of the minutiae around a minutia within a constant distance to construct a
local structure. The problem of this method is how to decide the constant distance. As we know, if the
distance is too small, very few minutiae will be included for the local structure. This will lead to false
match with the noise influence. But with a large distance, the structure will be seriously affected by
the elastic distortion. The second method is use the k-nearest neighborhood of minutiae to construct a
local structure.

α
γ

(a) four-nearest neighbor local structure (b) local structure in the thinned fingerprint
Figure2. Example of local structure

In our matching algorithm, the second method is used to construct a local structure. An example
of local structure is shown in Figure 2, which demonstrate an example of four-nearest neighbor local
structure. We call the line that connects the center minutia and the neighbor minutia as edge, and
construct local structure uses the follow information:
1) The distance between the center minutiae and the neighbor minutiae, as D shown in Figure 2
2) The angle α between center minutiae’s orientation and neighbor minutiae’s orientation in Figure
2.
3) The angle β between the minutiae orientation and the edge. As shown in Figure 2.
4) The angle γ between the neighboring two edges, as shown in Figure 2.
It is known that the elastic distortion of fingerprint in a local small area always similar. Therefore,
we can regard that the distances between the center minutia and the neighbor minutia are invariable to

4
translation and rotation. It is apparently that the angles α , β , γ are invariable to translation, rotation.
Therefore, we can use those four features to match the local structure.

3.2 The local structure matching algorithm

In this section, we introduce the local structure matching algorithm which is used to find
corresponding point pairs of the two fingerprints.
There are two methods to match the local structure: The first one is to compute the matching cost
of the two local structures. Then select the center minutia of the matching pair which has the minimal
cost as the correspondence pairs. The second one is to compute the matching edge of the local
structure. We can compare the edges from the two local structures. If the edges are similar in distance,
angle etc, we say those two edges are matched. Moreover, if two edges of one local structure are
matched with the other two edges of the other local structure, the angles should be similar. Through
matching all edges of the local structure, we can get the matching edge count, and set the match score
of the two local structures as the matching edge count.
Through experiment we find that the second method is both efficient and robust to noise, therefore
we select the second as our local structure matching algorithm.
Now we describe our local structure matching algorithm in details. For each edge of the two local
structures we compute:
1) The relative distance difference Rd of the two edges, with D1 and D2 being the distances of two
edge’s from different local structures as.
Rd = D1 − D2 / min(D1 , D2 ) (2)
The min() function means to select the minimal of the two values.
2) The angle difference.
Da = α 1 − α 2 (3)
Dβ = β 1 − β 2
If Rd , D α , D β are below a given threshold, we say the two edges are matching.
3) If two edges of the template match the other two edges of the input image, let St1 and St 2 denote
the local structures of the two fingerprints, E11 , E12 , E 21 , E 22 be edges of those two local structures.
And
E11 , E12 ∈ St1
E 21 , E 22 ∈ St 2
Moreover, let γ 1andγ 2 denotes the angles between E11 , E12 and E 21 , E 22 respectively. Then we
compute the difference between those two angles:
Dγ = γ 1 − γ 2 (4)
If Dγ is below a given threshold, we say that both of those two edges are really a match, and
increase the match score of the two local structures with two.
After those steps, we will get a match score of the two local structures. In order to avoid one edge
from a local structure matching more than one edge with the other local structure, we set a flag with
the compared edge, and use the edge which hasn’t be matched to start the new edge match.

3.3 The confirmation of the matched structures

After the local structure matching stage, we have obtained some similar structures. We will use
the center minutiae of those structures in the global matching stage. But before we do the global

5
matching, we need to confirm the correctness of those matched local structures in order to decrease
the false matching rate. As we know, the minutiae from the same finger holds stable relationship with
core point, this is to say, the center points of those local structures are very similar in angle, position
and distance with the core point. According to this hypothesis, we come to the following confirmation
method of the matched local structure.
Let S1 and S 2 be the center points of the two matched local structure in different fingerprint
image respectively, and C1 , C2 be their core points. We compute:
D1 = S1 − C1 α 1 = Os1 − Oc1
, (5)
D2 = S 2 − C 2 α 2 = Os2 − Oc2
where O denotes the orientation of the core point and minutia, D denotes the distance between the
minutiae and core point.
If D1 − D2 < TD and α 1 − α 2 < Tα (6)
then we say that those two local structures are real matched. Here we used the orientation estimation
method given in [8]. This step just confirms the correctness of matched local structures, the threshold
can be a little loose to decrease the FRR in some sense.

4. Global matching algorithm

In Section 3, we match the local structure around the core point, however, just matching the local
structure is not enough for making verification decision, because the local structures usually tend to be
similar among different fingerprints. Therefore in this section, we match the global feature based on
the local structure match result. From the local structure matching results, we select the two structures
which have the maximum match score, and use the center minutia of the two structures as the
corresponding point pair of the two fingerprints. After that, we normalize the global feature based on
the corresponding point pairs.
Let
P = (( x1p , y1p ,θ 1p ) T ,..., ( x mp , y mp ,θ mp ) T )
denote the minutiae feature vector of the template and
Q = (( x1q , y1q ,θ 1q ) T ,..., ( x nq , y nq ,θ nq ) T )
denote the minutiae feature vector of the input image. If we denote the reference point as ( x r , y r ,θ r ) ,
we have the normalization formulation:
⎛ (x − xr )2 + ( y − y r )2 ⎞
⎛ ri ⎞ ⎜ i i ⎟
⎜ ⎟ ⎜ ⎛ yi − y r ⎞ ⎟
⎜θ i ⎟ = ⎜ arctan⎜⎜ ⎟
r ⎟ ⎟ (7)
⎜o ⎟ ⎜ ⎝ xi − x ⎠ ⎟
⎝ i⎠ ⎜ θi −θ r ⎟
⎝ ⎠
where ( xi , y i ,θ i ) denotes the minutiae from both the template and input image. After the
normalization, we match the minutiae vectors through an elastic box, as suggested by Jain [1].
In order to avoid one to many false minutia matching, we construct a match table M for each
matched minutia pair Pi , Q j and we compute the “distance” of those match minutia pairs. Let
∆d = ri − r j

6
 ∆α = abs (θ i − θ j ) + abs (oi − o j ) (8)
And save this “distance” into the match table,
M (i , j ) = ∆ d + ∆ α
After the entire global match finishes, we search the match table with the search rule as follows:
For each row, if there is nonzero value, we get the minimum value, and set the associated column
and row to zero except this minimum value. After this operation, the matched minutiae number is the
nonzero count k in the match table. We define a match rate for two fingerprints;
R = k *k /m*n (9)
where R is the match rate, and k is the matched pair count, m, n are the minutiae count from template
and input fingerprint image.

4.2 Global matching decision

After the global matching, we need to make final decision that whether the two fingerprints are
same or not. There are many drawbacks if we just use the matched minutiae point count to make
decision. Therefore, in this paper we introduce a global distance based decision method. We find that
if we can introduce some efficient constrains, we can greatly decrease the false match risk. In order to
do that, we introduce global matching distance (GMD) and global matching distance variance
(GMDV).
Let S = {s1 , s 2 ,..., s n }， R = {r1 , r2 ,..., rn }
where S denotes the minutiae vector of the saved template, R denotes the minutiae vector of the input
template. There must exist the following relationship between the real matched minutiae if we neglect
the nonlinear distortion:
R = A* S + b
where A and b are the affine matrixes of the two fingerprints.
S* = A* S + b
where S * is the minutiae vector after affine transform under the affine matrix.
We define the global distance GMD as:
1
E = ∑ ( S * − R) (10)
n
Under the ideal case, the GMD should be zero. Due to noise and nonlinear transform, the GMD is
always a positive value. In order to tolerate those errors, we let GMD below a given threshold:
E < Tη (11)
Meanwhile，we compute the variance of the GMD，

σ=
1
n
∑ (
S* − R − E
2
) (12)

and let σ below a given threshold

σ < Tσ (13)
If the matched minutiae meet those two conditions as well as a given minimal matched minutiae
count, we regard those two fingerprints as a match.

5. Experiment result and analysis

7
 In order to evaluate our algorithm, we test our algorithm on our fingerprint image database. The
image size is 300*300 pixels. Our fingerprint image database includes two parts. Part I has 100
images per finger, and 4000 images altogether. Part II has 20 images per finger, and 4000 images
altogether too. We test the FRR on Part I, and test FAR on Part II. Our fingerprint image database
includes various type quality fingerprint images, some are shown in Figure 3.

Figure3. Example of different quality fingerprint image

We do altogether 80000 times matching. The test results are shown in Table 1. The comparison
with Jain’s algorithm [1] is also given in Table 1.

Table1. Experiment results of our algorithm compared with Jain’s algorithm

Our algorithm Jain algorithm[1]
False Accept False False Accept False Refuse
Rate Refuse Rate Rate Rate
1 5.0% 0.08% 5.0% 0.8%
2 4.0% 0.09% 4.0% 1.7%
3 3.0% 0.35% 3.0% 1.8%
4 2.0% 0.58% 2.0% 3.2%
5 1.0% 0.80% 1.0% 5.6%

From the table we can see that, our algorithm has better performance with our live fingerprint
database. Moreover, the average template size is 256 Bytes which only include the position and
orientation of the minutiae points (6 Byte per minutia), and the total time consuming of our matching
algorithm is 0.004 seconds on PIII 450M Hz. From the test result we can see that our algorithm has
both better performance and efficiency, therefore is more suitable for online application.
The reason leading to the verification failed is the poor quality fingerprint image as shown in
Figure 3. Those types of fingerprint images are confusing even to manual verification. If we add some
strict image quality estimate algorithm, the performance can be greatly improved, therefore the future
work of our system is to develop some strict image quality estimate algorithm as well as improve the
minutiae extraction precision. Meanwhile, in order to totally verify the performance of our algorithm,
we need to test our algorithm in the standard fingerprint database such as NIST, FVC2002. Therefore
our future work should test and improve the performance according to those standard fingerprint
databases.

6. Conclusion
In this paper, we propose a core based structure matching algorithm of fingerprint, which uses the
minutiae near core point of the fingerprint to construct some local structures. Through matching the

8
local structures, we can get corresponding minutiae. The global match is carried out based on those
corresponding minutiae. Final decisions are making based on global distance and matching minutiae
point rate. Experiment results show that the performance and efficiency are significant improved with
our algorithm.

7. References
[1] Anil Jain, Lin Hong and Ruud Boole On-Line Fingerprint Verification, IEEE Trans. PAMI, Vol. 19, NO. 4, 1997,
302-314
[2] Ratha, N.K.; Bolle, R.M.; Pandit, V.D.; Vaish, V., Robust Fingerprint Authentication Using Local Structure
Similarith, Proceeding of fifth IEEE workshop on applications of computer vision, IEEE Press, 2000, pp 29 -34.
[3] Andres Almansa, Laurent Cohen, Fingerprint Image Matching by Minimization of a Thin-Plate Energy Using a
two-step Algorithm with Auxiliary Vairables, Proceeding of fifth IEEE workshop on applications of computer
vision, IEEE Press, 2000, pp 35 -40,
[4] Zsolt Miklos Kovacs-Vajna, A Fingerprint Verification System Based on Triangular Matching and Dynamic
Time Warping, IEEE Trans. PAMI, Vol. 22, NO. 11, 2000, pp1266-1276.
[5] A.J.Willis, L..Myers, A Cost-effective Fingerprint Recognition System for Use with Low-quality Prints and
Damaged Fingerprint. Pattern Recognition, Vol . 34, 2001, pp 255-270
[6] V.s. Srinivasan, N.N. Murthy, Detection of Singular Point in Fingerprint Images, Pattern Recognition, Vol. 25,
NO. 2, 1992, pp 139-153.
[7] Weiwei Zhang, Singular Point Detection in Fingerprint Image, Proceeding of Fifth Asian Conference on
Computer Vision, Melbourne, Australia January 22-25, 2002,pp793~796.
[8] Asker M. Bazen, Sabih H.Gerez, Extraction of Singular Points from Directional Fields of Fingerprints,
Proceeding of CTIT Workshop on Mobile communications, University of Twente, Enschede, The Netherlands,
February 2001, pages 41-44.
[9] Shih-Hsu Chang, Fang-Hsuan Cheng, Fast Algorithm for Point Pattern Matching: Invariant to Translations,
Rotations and Scale Changes, Pattern Recognition, VOL. 30, NO. 2, 1997, pp311-320.
[10] D.K.Isenor, S.G.Zaky, Fingerprint Identification Using Graph matching, Pattern Recognition, Vol. 19, NO.
2, 1986, pp 113-122
[11] Andrew K. Hrechak, James A. Mchugh, Automated Fingerprint Recognition Using Structural Matching,
Pattern Recognition, Vol. 23, NO. 8, 1990, pp 839-904.
[12] Z. Chen, CH.Kou, A Toplogy-Based Matching Algorithm for Fingerprint Authentication, Proceeding of
IEEE International Carnahan Conference on Security Technology, October 1, Taipei, Taiwan, ROC, IEEE Press.
1991, pp.82-85.
[13] A. Wahab, Novel Approach to Automated Fingerprint Recognition, IEE Proc.-Visual Image Signal Process.,
Vol. 145, No. 3, June 1998, pp.160-166
[14] Kou Chin Fan, Cheng W. Liu and Yuan Kai Wang, A Randomized Approach with Geometric Constraints to
Fingerprint Verification, Pattern Recognition, Vol. 33, 2000, pp.1793-1830.
[15] Weiwei Zhang Yangsheng Wang, Core-Based Structure Matching Algorithm of Fingerprint Verification,
Proceeding of International Conference on Pattern Recognition, Vol.1, Quebec City, Canada, IEEE Press, 2002,
pp70~74.
[16] Yangsheng Wang，Weiwei Zhang, Topology based Fingerprint Minutiae Matching Algorithm，Chinese
Patent apply No. 02116254.9，2002，3

9
 基于中心点的指纹细节结构匹配算法
张伟伟 王森 王阳生
模式识别国家重点实验室，北京100080
{wwzhang, swang, wys}@nlpr.ia.ac.cn

摘要：指纹细节匹配算法是自动指纹识别系统（AFIS）中一项关键的任务，目前存在大量的研究和算法。依据算法是否依赖
中心点，指纹细节点匹配算法可以分为两类：基于中心点的匹配算法和非中心点匹配算法。大多数非中心点匹配算法都非常
耗时，因此不适合在线应用。而基于中心点方法的效率相对较高，但是这类算法极度依赖于中心点的定位精度。在本文中，
我们提出了一种全新的基于中心点的指纹细节结构匹配算法，该算法综合了基于中心点匹配算法和非中心点匹配算法的优
点，同时又避免了二者的缺点。首先我们利用中心点检测算法获得中心点的位置，然后在中心区域定义了一些局部的结构，
同时利用这些局部结构寻找指纹细节的对应点，并通过对应点和中心点的相对关系来确认这些对应细节点。其次利用这些细
节对应点匹配全局的细节信息，最后，利用匹配细节的全局距离和距离方差来判决最终匹配结果。实验结果表明，算法的匹
配效果非常好，同时匹配效率较高，非常适合在线指纹识别系统的应用。
关键词：指纹识别，中心点，匹配，结构匹配

作者简介：
张伟伟，男，中科院自动化所模式识别国家重点实验室博士研究生，专业为模式识别与智能系统。2000年3
月获硕士学位，专业为自动控制。研究兴趣包括数字图像处理，数字信号处理，模式识别，指纹识别。
Weiwei Zhang received his M.S. degree in Automation form Beijing University of Aeronautics and Astronautics in
2000.He is currently a Ph.D. candidate in National Laboratory of Pattern Recognition, Institute of Automation,
Chinese Academy of Science, Beijing, China. His research interests include digital signal processing, pattern
recognition, fingerprint recognition.

王森，男，中科院自动化研究所模式识别国家重点实验室硕士研究生，专业为模式识别与智能系统。2000
年7月获学士学位，专业为应用电子技术。研究兴趣包括模式识别，计算机视觉，数字图象处理。
Sen Wang received his B.E. in Automation from Shandong University. He is currently a M.S. candidate in National
Lab of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China. His Research
area include pattern recognition, computer vision and digital image processing.

王阳生，中科院自动化研究所研究员，博士生导师，北京邮电大学教授，华中科技大学教授，中科模识科
技有限公司总经理， 1984年获华中理工大学硕士学位。1989年获华中理工大学博士学位，同时进入英国爱
丁堡大学做博士后。1990年加入Brunel 大学，任高级研究员。1999年加入Nortel Networks, 任高级分析员，
2000年返回中国，加入中科院自动化研究所模式识别国家重点实验室，任研究员。研究兴趣包括生物特征
识别，机器人，计算机视觉，模式识别。
Yangsheng Wang received his M. Sc.(1984) and Ph.D.(1989) in Electronic Engineering from Huazhong University
of Science and Technology. In October 1989, he joined the University of Edinburgh and did his Post-Doctor
research. From 1990, he worked in Brunel University as a senior researcher. From 1999 he worked as a senior
researcher in Nortel Networks (UK).In 2000, he returned to China and joined the National Laboratory of Pattern
Recognition, Institute of Automation, Chinese Academy of Science, Beijing, China. He is currently Professor of
National Laboratory of Pattern Recognition. Dr. Wang has published widely on image processing, computer vision
and pattern recognition. Dr. Wang is also the professor of Beijing University of Posts and Telecommunications,
Huazhong University of Science and Technology, and CEO Beijing Pattek Co. His research interests include
Biometrics, Robotics, Computer Vision and Pattern Recognition.

10