文獻翻譯--指紋識別系統(tǒng)

1、fingerprint recognition systemabstractfingerprint recognition system consist of image preprocessing, features extraction and features matching that runs effectively and accurately on personal computer. the image preprocessing includes noise removal, histogram equalization, global thresholding and ri

2、dgeline thinning which are necessary for the features extraction. extracted features are then stored in a file for fingerprint matching. matching algorithm presented here is a simple, fast and accurate. experimental results for matching are accurate, reliable and fast for implementation using a pers

3、onal computer and fingerprint reader. the proposed fingerprint algorithm can provide an effective way of automated identification and can be extended to other security or identification applications. further the algorithm can be implanted on a fpga platform for a real time personal automated identif

4、ication system.keywords:biometric recognition;histogram equalization;ridge thinning;ridge ending;ridge bifurcation.1. introductionfingerprint recognition systems are termed under the umbrella of biometrics. biometric recognition refers to the distinctive physiological (e.g. fingerprint, face, iris,

5、retina) and behavioral(e.g. signature, gait) characteristics, called biometric identifiers or simply biometrics, for automatically recognizing individuals. in 1893, it was discovered that no two individuals have same fingerprints. after this discovery fingerprints were used in criminal identificatio

6、n and till now fingerprints are extensively used in various identification applications in various fields of life. fingerprints are graphical flow-like ridges present on human fingers. they are fully formed at about seventh month of fetus development and fingerprint configuration do not change throu

7、ghoutthe life except due to accidents such as bruises or cut on fingertips.because of immutability and uniqueness, the use of fingerprints for identification has always been of great interest to pattern recognition researchers and law enforcement agencies. conventionally, fingerprint recognition has

8、 been conducted via either statistical or syntactic approaches. in statistical approach a fingerprints features are extracted and stored in an n-dimensional feature vector and decision making process is determined by some similarity measures. in syntactic approach, a pattern is represented as a stri

9、ng, tree 1, or graph 2 of fingerprint features or pattern primitives and their relations. the decision making process is then simply a syntax analysis or parsing process.this paper suggests the statistical approach. experimental results prove the effectiveness of this method on a computer platform,

10、hence making it suitable for security applications with a relatively small database. the preprocessing of fingerprints is carried out using modified basic filtering methods which are substantially good enough for the purpose of our applications with reasonable computational time. block diagram for t

11、he complete process is shown in figure.1.2. image preprocessingfor the proper and true extraction of minutiae, image quality is improved and image preprocessing is necessary for the features extraction because we cannot extract the required points from the original image. first of all, any sort of n

12、oise present in the image is removed. order statistics filters are used to remove the type of noise which occurs normally at image acquisition. afterwards the following image preprocessing techniques are applied to enhance the fingerprint images for matching.2.1 histogram equalizationthis method is

13、used where the unwanted part of the image is made lighter in intensity so as toemphasize the desired the desired part. figure 2(a) shows the original image and figure 2(b) histogram equalization in which the discontinuities in the small areas are removed. for the histogram equalization, let the inpu

14、t and the output level for an arbitrary pixel be i and l, respectively. then the accumulation of histogram from 0 to i ( 0 i 255,0 k 255) is given bywhere h(k) is the number of pixel with gray level k, i.e. histogram of an area, and c(i) is alsoknown as cumulative frequency. 2.2 dynamic thresholding

15、basic purpose of thresholding is to extract the required object form the background. thresholding is simply the mapping of all data points having gray level more that average gray level. the results of thresholding are shown in figure 3.2.3 ridgeline thinningbefore the features can be extracted, the

16、 fingerprints have to be thinned or skeletonised so that all ridges are one pixel thick. when a pixel is decided as a boundary pixel, it is deleted directly form the image 3-5 or flagged and not deleted until the entire image been scanned 6-7. there are deficiencies in both cases. in the former, del

17、etion of each boundary pixel will change the object in the image and hence affect the object symmetrically. to overcome this problem, some thinning algorithms use several passes in one thinning iteration. each pass is an operation to remove boundary pixels from a given direction. pavlidis 8 and fieg

18、in and ben-yosef 9 have developed effective algorithms using this method. however, both the time complexity and memory requirement will increase. in the latter, as the pixels are only flagged, the state of the bitmap at the end of the last iteration will used when deciding which pixel to delete. how

19、ever, if this flag map is not used to decide whether a current pixel is to be deleted, the information generated from processing the previous pixels in current iteration will be lost. in certain situations the final skeleton may be badly distorted. for example, a line with two pixels may be complete

20、ly deleted. recently, zhou, quek and ng 10 have proposed an algorithm that solves the problem described earlier and is found to perform satisfactorily while providing a reasonable computational time. the thinning effect is illustrated in figure 43. features extractionthe two basic features extracted

21、 from the image are ridge endings and ridge bifurcation. forfingerprint images used in automated identification, ridge endings and bifurcation are referred to as minutiae. to determine the location of these features in the fingerprint image, a 3x3 window mask is used (figure 5). m is the detected po

22、int and x1 x8 are its neighboring points in a clockwise direction. if xn is a black pixel, then its response r (n) will be 1 or otherwise it will be 0. if m is an ending, the response of the matrix will bewhere r(9)=r(1). for m to be a bifurcation,for example, if a bifurcation is encountered during

23、extraction, mask will contain the pixelinformation such as r(1) = r(3)= r(4) = r(6) = r(7) = 0, r(2) = r(5) = r(8) = r(9) = 1, andfor all the minutiae detected in the interpolated thinned image, the coordinates and their minutiae type is save as feature file. at the end of feature extraction, a feat

24、ure record of the fingerprint is formed.4. matchingfingerprint matching is the central part of this paper. the proposed technique is based on structural model of fingerprints 11. one of the major breakthroughs of this method is its ability to mach fingerprints that are shifted, rotated and stretched

25、. this is achieved by a different matching approach. as it is clear that this algorithm matches the two fingerprint images captured at different time. this matching is based on the minutiae identification and minutiae type matching. matching procedure is complex due to two main reasons;1) the minuti

26、ae of the fingerprint captured may have different coordinates2) the shape of the fingerprint captured at different time may be different due to stretching.an automated fingerprint identification system that is robust must have following criteria:1) size of features file must be small2) algorithm mus

27、t be fast and robust3) algorithm must be rotationally invariant4) algorithm must be relatively stretch invariantto achieve these criteria, the structural matching method described by hrechak and mchugh 11 is adopted as the basis of our recognition algorithm, with changes made to the algorithm, to pr

28、ovide more reliable and improving overall matching speed. this matching represents the local identification approach, in which local identified features, their type and orientation is saved in features file, is correlated with the other images extracted features file. the model is shown in figure 6.

29、for each extracted features on the fingerprint, a neighborhood of some specified radius r about the central feature is defined and then euclidean distance and relative angles between the central point and the other point is noted with the points type. since the distance among the pointremains the sa

30、me throughout the life. so this technique works well for the rotated and shifted images.5. conclusiona fingerprint recognition algorithm that is fast, accurate and reliable has been successfully implemented. this algorithm can be modified, introducing the ridgeline count, and then could beused in on

31、line and real time automated identification and recognition system.references1 moayer, b., and fu, k.s.: a tree system approach for fingerprint pattern recognition, ieee trans., 1986,pamt-8, (3), pp. 376-3872 isenor, d.k., and zaky, s.g.: fingerprint identification using graph matching, pattern reco

32、gnit., 1986,19, (2) pp. 113-1223 tamura, h.: a comparison of line thinning algorithms from digital geometry viewpoint. proceedings of fourth international joint conference on pattern recognition, kyoto, nov. 1978, pp. 715-7194 hilditch, c.j.: linear skeleton from square cupboards, machine intel., 19

33、69, 4, pp.403-4205 naccache, n.j., and shinchal, r.: an investigation into the skeletonization approach of hilditch,pattern recognit., 1984, 17, (3), pp. 279-2846 jang, b.k., and chin, p.t.: analysis of thinning algorithms using mathematical morphology, ieee trans.,pattern anal. machine intel., 1990

34、, 12, (6), pp. 541-5517 xu, w., and wang, c.: cgt: a fast thinning algorithm implemented on sequential computer, ieee trans.,1987, smc-17, (5), pp. 847-8518 pavlidis, t.: algorithm for graphical and image processing, comput. graph. image process., 1982, 20,pp133-1579 feigin, g., and ben yosef, n.: l

35、ine thinning algorithm, proc. spie int. soc. opt. eng., 1984, 397, pp.108-11210zhou, r.w., quek, c., and ng, g.s.: novel single-pass thinning algorithm, pattern recognit. lett., 1995,16, (12), pp.1267-127511hrechak, a.k., and mchugh, j.a.: automated fingerprint recognition using structural matching,

36、pattern recognit., 1990, 23, (8), pp. 893-90412gounzalez, r.c., and wood, r.e.: digital image processing (pearson education, 2002) 指紋識別系統(tǒng)摘要指紋識別系統(tǒng)包括圖像預處理、特征提取和在個人計算機上進行有效、準確地匹配的功能。圖像預處理包括去除噪聲、直方圖均衡、全局閾值和脊線細化這些必要的特征提取。提取的特征，然后存儲在指紋匹配的文件里。這里提出的匹配算法是一種簡單、快速、準確的算法。匹配實驗結果準確、可靠、快速，使用一臺個人電腦和指紋識別器實施。提出的指紋算法可

37、以提供一個有效的自動識別方式，并可以擴展到其他安全或者識別應用。該算法可以進一步植入一個fpga平臺上的個人實時自動識別系統(tǒng)。關鍵詞：生物特征識別；直方圖均衡化；山脊細化；脊的結局；脊分岔1、引言指紋識別系統(tǒng)被稱為處在生物識別技術的保護傘下。生物識別是指獨特的生理（如指紋、人臉、虹膜、視網膜）和行為（如簽名、步態(tài)）特點，被稱為生物識別或簡單的生物識別技術，自動識別的個人。在1893年，它被發(fā)現，任何兩個人都不會有相同的指紋。在這個發(fā)現之后指紋被應用在刑事鑒定中，直到現在指紋被廣泛應用于各種智能識別應用在生活的各個領域。指紋是人類手指上的圖形流的山脊。他們在胎兒發(fā)育和指紋配置的大約七個月就完全形

38、成，整個生命中都不會改變，除非由于事故，如瘀傷或指傷。由于不變性和唯一性，指紋識別應用一直是模式識別研究人員和執(zhí)法機構的極大興趣。傳統(tǒng)上，指紋識別已經通過任何統(tǒng)計或句法的方法進行。統(tǒng)計方法的指紋特征是提取并存儲在一個n維的特征向量和決策過程中由一些相似的措施決定。在句法方法，一個模式表示為一個字符串，樹1，或圖2的指紋特征或模式基元及其相互關系。然后決策過程就是簡單地句法分析或解析過程。本文提出的統(tǒng)計方法。計算機平臺上的實驗結果證明該方法的有效性，因此適合安全應用于一個相對嬌較小的數據庫。指紋的預處理進行了修改基本的過濾方法，足夠合理的計算時間與我們的應用程序的目的。完整的過程方框圖在圖1中表

39、示圖像捕捉圖像預處理特征提取匹配存儲特征點圖1 框圖2、圖像預處理為正確和真實的細節(jié)提取，圖像質量得到改善，圖像預處理，特征提取是必要的，因為我們不能從原始圖像中提取所需的點。首先，任何類型的圖像中的噪聲目前被刪除。順序統(tǒng)計濾波器用于消除噪聲的類型，通常發(fā)生在圖像采集之后，下面的圖像預處理技術應用于提高匹配的指紋圖像。2、1 直方圖均衡化使用這種方法使圖像不必要的部分強度輕，以便強調需要所需的部分。圖2（a）顯示原始圖像和圖2（b）顯示直方圖均衡化的圖像，其中不連續(xù)的小區(qū)域被刪除。直方圖均衡化，讓任意像素的輸入和輸出電平分別是i和i。然后從0到i（0 i 255,0 k 255）直方圖的累積由

40、 (1) 求得其中h(k)為k層灰色的像素數，即一個區(qū)域的直方圖，c(i)也被成為累積概率。 圖2(a) 原始圖像 圖2(b) 直方圖均衡的圖像2、2 動態(tài)閾值閾值的基本目的是提出所需的對象窗體背景。閾值僅僅是灰色的水平，平均灰度水平的所有數據點的映射。閾值的結果如圖3所示。圖3 動態(tài)閾值結果2、3 山脊細化在特征可以被提取之前，指紋必須變薄或鏤空，所以，所有的山脊是一個像素厚。當一個像素作為一個邊界像素決定，它直接刪除圖像3-5或標記，但不會刪除，直到整個圖像被掃描6-7。在這兩種情況下是有缺陷的。在前者，每個邊界像素的缺失會改變圖像中的對象，因而影響對稱對象。為了克服這個問題，一些細化算法

41、使用幾個通行證在一個細化迭代里。每通是一個操作刪除從一個給定方向的邊界像素。pavlidis 8 and fiegin and ben-yosef 9已經使用這種方法制定了有效的算法。然而，無論是時間復雜度和內存需求將會增加。在后者，像素只有標記，在最后一次迭代結束時的位圖的狀態(tài)將決定刪除哪一個像素時使用。但是，如果不使用這個標志圖來決定是否要刪除當前圖像，從以前的像素在當前迭代處理產生的信息將丟失。在某些情況下，最終的骨架可能會被嚴重扭曲。例如，有兩個像素的線，可以完全刪除。最近，zhou, quek and ng 10提出了一種算法，解決了前面所述的問題，并且圓滿的執(zhí)行，同時提供了一個合理

42、的計算時間。細化效果如圖4所示 a b 圖4 山脊細化a 細化前 b細化后3、特征提取從圖像中提取的兩個基本特征是脊末梢和脊分岔。對于自動識別所使用的指紋圖像，神經末梢和分岔被稱為脊的特征點。為了確定這些特征點在指紋圖像的位置，使用了一個3x3的矩陣窗口(圖 5)。m是監(jiān)測點，x1 x8是在順時針方向的臨近點。如果xn是一個黑色像素，那么與r (n)對應的就是1，否則就是0。如果m是一個結尾，矩陣響應為 （2）其中r(9)=r(1)。m是一個分支， （3）例如，如果在提取的過程中遇到了一個分支，掩碼將包含的像素信息如r(1) = r(3)= r(4) = r(6) = r(7) = 0, r(

43、2) = r(5) = r(8) = r(9) = 1,結果 插值細化圖像中檢測到的所有細節(jié)，坐標和他們的特征點類型被保存為特征文件。在特征提取的最后，指紋特征記錄正在形成。x1x2x3x8mx4x7x6x5 圖5 3 x 3掩膜特征提取4、匹配指紋匹配時本文的核心內容。提出的技術是基于指紋的結構模型11。這種方法的重大突破之一是它對于移動、旋轉和伸展的指紋相匹配的能力。這是通過不同的匹配方法實現的。因為它是清晰的，該算法匹配兩個在不同時間捕獲的指紋圖像。這種匹配是在特征點識別和特征點類型匹配的基礎上的。匹配程序是復雜的，由于兩個主要原因：1) 捕獲指紋的特征點可能有不同坐標2) 在不同的時間

44、捕獲的指紋形狀由于伸展可能會不同強大的指紋自動識別系統(tǒng)必須具備下列條件：1) 特征文件的尺寸一定要小2) 算法必須快速和強大3) 算法必須是旋轉不變的4) 算法必須相對伸展不變?yōu)榱诉_到這些條件，由hrechak 和mchugh 11描述的結構匹配方法采用我們書別算法的基礎上，通過算法所做的更改，以提供更可靠，提高整體匹配速度。此匹配代表局部的識別方法，它們的類型和方位這些局部標識的特征保存在特征文件，與其他圖像的特征文件有關。模型如圖6所示。 圖6 局部特征的結構模型對于每個提取的指紋特征，臨近的一些特定的半徑為r的重要特征被定義，然后通過點的類型指出中央點和其他點之間的歐幾里得距離和相對角度。由于點之間的距離在整個生命期間保持不變。因此這項技術可以很好的用于轉移和旋轉的圖像。5、結論一個快速、準確和可靠的指紋識別算法已經成功實施。該算法可以修改，引入山脊計數，然后可以應用于網上實時自動識別和識別系統(tǒng)。參考文獻1 moayer, b., and fu, k.s.: a tree system approach for fingerprint pattern