<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JSIP</journal-id><journal-title-group><journal-title>Journal of Signal and Information Processing</journal-title></journal-title-group><issn pub-type="epub">2159-4465</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jsip.2016.71007</article-id><article-id pub-id-type="publisher-id">JSIP-64018</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject></subj-group></article-categories><title-group><article-title>
 
 
  Identity Verification of Individuals Based on Retinal Features Using Gabor Filters and SVM
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>ohamed</surname><given-names>A. El-Sayed</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>M.</surname><given-names>Hassaballah</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Mohammed</surname><given-names>A. Abdel-Latif</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of Mathematics, Faculty of Science, Fayoum University, Fayoum, Egypt</addr-line></aff><aff id="aff2"><addr-line>Department of Mathematics, Faculty of Science, South Valley University, Qena, Egypt</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>drmasayed@yahoo.com(OAE)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>15</day><month>02</month><year>2016</year></pub-date><volume>07</volume><issue>01</issue><fpage>49</fpage><lpage>59</lpage><history><date date-type="received"><day>23</day>	<month>October</month>	<year>2015</year></date><date date-type="rev-recd"><day>accepted</day>	<month>26</month>	<year>February</year>	</date><date date-type="accepted"><day>29</day>	<month>February</month>	<year>2016</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  Authentication reliability of individuals is a demanding service and growing in many areas, not only in the military barracks or police services but also in applications of community and civilian, such as financial transactions. In this paper, we propose a human verification method depends on extraction a set of retinal features points. Each set of feature points is representing landmarks in the tree of retinal vessel. Extraction and matching of the pattern based on Gabor filters and SVM are described. The validity of the proposed method is verified with experimental results obtained on three different commonly available databases, namely STARE, DRIVE and VARIA. We note that the proposed retinal verification method gives 92.6%, 100% and 98.2% recognition rates for the previous databases, respectively. Furthermore, for the authentication task, the proposed method gives a moderate accuracy of retinal vessel images from these databases.
 
</p></abstract><kwd-group><kwd>Image Preprocessing</kwd><kwd> Gabor Filter</kwd><kwd> SVM</kwd><kwd> Authentication</kwd><kwd> Identification</kwd><kwd> Verification</kwd><kwd>  Retinal Features</kwd><kwd> Feature Extraction</kwd><kwd> Query Image</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Accurate and reliable identification and verification play a significant role for systems of security and modern progress of reliable authoritative systems. Some biometric patterns of a user for recognition and identification are hand geometry, palm print, handwriting, gait, face, voice, palm vein, iris, key-stroking and retina as shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>. Though, there are systems with highly accurate depend on the exiting biometrics, but all of these can simply be faked. Moreover, each sample of patterns has its strengths and feebleness and the selection relies on the application [<xref ref-type="bibr" rid="scirp.64018-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.64018-ref2">2</xref>] . Among these samples, digital retinal image has high rate accuracy for Identification and verification. Recognition of retinal images is powerful against cheat and has a minimal rate of false acceptance and rate of false rejection. Retina of human involves blood-vessels pattern, which is unique and characterize in each person and can be applied in a biometric system [<xref ref-type="bibr" rid="scirp.64018-ref3">3</xref>] [<xref ref-type="bibr" rid="scirp.64018-ref4">4</xref>] .</p><p>Biometric recognition oftentimes creates use of a comparator unit which can be executed in two distinct manners, namely user verification (also called authentication) and user identification [<xref ref-type="bibr" rid="scirp.64018-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.64018-ref5">5</xref>] . The former performs authentication based on “are you who you claimed to be” mode. This mainly involves a straight forward one to one comparison, whereby the final verdict is a binary “accept” or “reject” decision. Commonly the identifiers are the format of smart cards or IDs of individual. On the other hand, the latter performs an exhaustive one to many searches on the entire user database to solve the “who are you” question. In this context, the main objective of a person identification task is to find the closest matching identity if exists. Identification is often required by several surveillance and forensics applications [<xref ref-type="bibr" rid="scirp.64018-ref6">6</xref>] [<xref ref-type="bibr" rid="scirp.64018-ref7">7</xref>] .</p><p>Vertebrate retina is a light sensitive tissue lines the inner layer of the eye. We have reached optics to the analysis of visual images on the retina, where the same function as the camera during the filming of movies. Upon the arrival of light to the retina begins a series of chemical and electrical events that lead to the presence of nerve impulses that are sent to various visual centers of the brain where transport through the optic nerve. The retina is the distinctive style of the form of the blood vessels; it is not easy to be repeated between persons, as well as the change becomes rare. Even patterns of the right eye and the left eye of a same person are different. Also, the retina in the eyes of identical twins are unique, different and remains unchanged over a lifetime (In case if the person is infected with the eye such as retinal detachment, glaucoma, pterygium, retinitis, cataracts, eyestrain… etc.) [<xref ref-type="bibr" rid="scirp.64018-ref8">8</xref>] .</p><p>The uniqueness and importance of blood vessels and its pattern in human retina were revealed by two eye specialists Carleton and Goldstein during researching on diseases which infect eye [<xref ref-type="bibr" rid="scirp.64018-ref9">9</xref>] . They detected that each eye of individual has a single pattern of vascular that can be applied for authentication of persons. Paul Tower [<xref ref-type="bibr" rid="scirp.64018-ref10">10</xref>] discovered that identical twins have unique and distinctive patterns. It is almost impossible to forge a human retina as it is existing at behind of the eye and is not exposed to outer environment [<xref ref-type="bibr" rid="scirp.64018-ref3">3</xref>] . The Uniqueness and stability makes the recognition of retina is a notable solution to security and protection in the nearer future. Woodward et al. [<xref ref-type="bibr" rid="scirp.64018-ref11">11</xref>] present many technical solutions to catching images of retinal and their applied in biometrics advanced in identity assurance in the information age.</p><p>The applications for the biometric identification and verification of identities were examined initially using fundus cameras commonly used in ophthalmological applications [<xref ref-type="bibr" rid="scirp.64018-ref12">12</xref>] . In order to scan retina, the person must</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Some biometric patterns for identification and verification</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/7-3400432x6.png"/></fig><p>position his/her eye very close to the lens of camera. During scanning process, one must remain still and must remove glasses to avoid signal interference. Once the scanner is activated, the green light moves in a complete circle and vascular pattern of retinal is captured [<xref ref-type="bibr" rid="scirp.64018-ref3">3</xref>] .</p><p>EyeDentify Company proposed the first system of identification based on commercial retina scanner called EyeDentification 7.5 [<xref ref-type="bibr" rid="scirp.64018-ref13">13</xref>] . Zana and Klein [<xref ref-type="bibr" rid="scirp.64018-ref14">14</xref>] were used evaluation of curvature to locate retinal vessel patterns in a noisy region. Morphological open operations are used to improve the segmentation results for next dealing of out coming binary digital images [<xref ref-type="bibr" rid="scirp.64018-ref15">15</xref>] .</p><p>A coefficient of cross correlation was defined in [<xref ref-type="bibr" rid="scirp.64018-ref16">16</xref>] based retinal identification, where the image captured is registered and the matching step is performed by correlating the pattern of vascular. In a retinal authentication system proposed by Bevilacqua et al. [<xref ref-type="bibr" rid="scirp.64018-ref17">17</xref>] , the accumulation matrix is utilized for detecting vascular bifurcation and cross over point. Akram et al. [<xref ref-type="bibr" rid="scirp.64018-ref18">18</xref>] presented a retina recognition method in which they represented feature points by bifurcations and endings vessel. For generating a feature vector, relative angles and distances between a candidate feature point and its four closet feature points are computed. In fact, most of the existing approaches in this direction either focused on extraction of feature points or on reliable extraction of vascular pattern.</p><p>The area of optical disk in the digital retinal image was found based on a fuzzy circular Hough transform by Ortega et al. [<xref ref-type="bibr" rid="scirp.64018-ref19">19</xref>] . In [<xref ref-type="bibr" rid="scirp.64018-ref19">19</xref>] , a pattern was defined using the optic disc as reference structure and using multi-scale analysis to compute a feature vector around it. The dataset used consists of 60 images that were rotated 5 times each. While, Fatima et al. [<xref ref-type="bibr" rid="scirp.64018-ref20">20</xref>] presented a technique known as windowing technique for filtration of false feature points which occur due to false vascular structures. This technique detects and eliminates the false points that are present. Support vector machine (SVM) has been a promising method for data classification and Verification [<xref ref-type="bibr" rid="scirp.64018-ref21">21</xref>] . Its success in practice is drawn by its solid mathematical foundation which conveys the following two salient properties: 1) Margin maximization; the classification boundary function of SVM maximizes the margin, which in machine learning theory, corresponds to maximizing the generalization performance given a set of training data; 2) Nonlinear transformation of the feature space using the kernel trick; SVM handles a nonlinear classification efficiently using the kernel trick which implicitly transforms the input space into another high dimensional feature space.</p><p>SVMs are a group of related methods of supervised learning applied for verification and classification. A classification issue commonly includes with training and testing data that involves of some data instances. In the training set, every instance includes one value from among target values and various characteristics. The main goal of SVM is to generate a pattern that prophesies target value of data instances in the testing set that are specified only the characteristics [<xref ref-type="bibr" rid="scirp.64018-ref22">22</xref>] -[<xref ref-type="bibr" rid="scirp.64018-ref25">25</xref>] . Example of supervised learning is classification operation through SVM. Known identifiers help show whether the system is executing in a correct path or not. This notification indicates to a desirable answer, supporting the accuracy of the system, or be used to help the system learn to perform correctly. Identification step in SVM classification are closely connected to the known classes. This is named feature extraction or feature selection. SVM classification and feature extraction with each other have an employ even when prediction of anonymous models is not needed. They can be applied to distinguish key sets which are interested in any operation identify the classes [<xref ref-type="bibr" rid="scirp.64018-ref25">25</xref>] .</p><p>The rest of this paper is organized as follows. In Section 2, the proposed system of authentication is offered, particularly the preprocessing, the feature point selection and the stages of matching. Section 3 describes the analysis of preprocessing technique. In Section 4, the feature extraction stage using Gabor filter is presented. Section 5 describes the feature extraction and classification using SVM, while Section 6 discusses the experimental results. Finally, conclusions are presented in Section 7.</p></sec><sec id="s2"><title>2. The Proposed System of Authentication Based on Retinal Images</title><p>Technology of retinal recognition holds and analyzes the samples of the thin nerves of retinal vessel which are on the backwards of the eyeball. The system treats light which enter to the pupil of eye. Acquisition of input retinal images is in real-time because of the pattern of retinal image is visible only when the individual is alive. It hides when a person is dead. So deception or cheating is unallowable in the vessel patterns recognition. A powerful performance of retinal recognition must be stable with modifies in size, location and directions of the retinal vessel patterns. The proposal system of individual authentication contains four main phases: enhancement of image, extraction of feature using Gabor filter, construction of feature vectors database and SVM matching as illustrated in <xref ref-type="fig" rid="fig2">Figure 2</xref>.</p><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> The flowchart of the proposed authentication method</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/7-3400432x7.png"/></fig></sec><sec id="s3"><title>3. Preprocessing Technique</title><p>In automatic verification, it is not necessary to process the surrounding background and noisy regions in the retina digital image because of taken a more processing time at all phases. Cutting and cropping out the area that includes the feature of retinal image reduces the number of processes on the image [<xref ref-type="bibr" rid="scirp.64018-ref26">26</xref>] . While, the preprocessing step is an important operation to extract accurately the region of interest (ROI). The ROI of retinal image is may be optic disc region, macula region, fovea region or blood vessels. The proposed method can be applied to any one. The following steps summarize the preprocessing stage in the proposed method:</p><p>1) Read the input image I. (See <xref ref-type="fig" rid="fig3">Figure 3</xref>). In this steps the green channel is selected where this channel produces the superior contrast among vessels in retina image and different features, and the retina itself.</p><p>2) Create morphological a flat, disk-shaped structuring element <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x8.png" xlink:type="simple"/></inline-formula> with a radius of 3 pixels.</p><p>3) Create the matrix f, by remove snowflakes having a radius less than 3 pixels from <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x9.png" xlink:type="simple"/></inline-formula> by opening it with the disk-shaped structuring element <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x10.png" xlink:type="simple"/></inline-formula> created in step 2 (See <xref ref-type="fig" rid="fig4">Figure 4</xref>(a)).</p><p>4) Convert the matrix f to double precision to <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x11.png" xlink:type="simple"/></inline-formula> matrix.</p><p>5) Creates a two-dimensional average filter <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x12.png" xlink:type="simple"/></inline-formula> of [3 3] vector. Then, filters the 2D array <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x13.png" xlink:type="simple"/></inline-formula> with the 2D filter<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x14.png" xlink:type="simple"/></inline-formula>. The result <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x15.png" xlink:type="simple"/></inline-formula> has the same size and class as<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x16.png" xlink:type="simple"/></inline-formula>. The output is <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x17.png" xlink:type="simple"/></inline-formula> as shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>(b).</p><p>6) Creates a two-dimensional Gaussian filter <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x18.png" xlink:type="simple"/></inline-formula> using:</p><disp-formula id="scirp.64018-formula98"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/7-3400432x19.png"  xlink:type="simple"/></disp-formula><p>and</p><disp-formula id="scirp.64018-formula99"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/7-3400432x20.png"  xlink:type="simple"/></disp-formula><p>returns a rotationally symmetric Gaussian low-pass filter of vector [9 9] with standard deviation <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x21.png" xlink:type="simple"/></inline-formula> using convolution, filters the 2D array<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x22.png" xlink:type="simple"/></inline-formula>, with the 2D filter<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x23.png" xlink:type="simple"/></inline-formula>, The output is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x24.png" xlink:type="simple"/></inline-formula>.</p><p>7) Creates a two-dimensional average filter <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x25.png" xlink:type="simple"/></inline-formula> of vector [69 69]. filters the 2D array<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x26.png" xlink:type="simple"/></inline-formula>, with the 2D filter<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x27.png" xlink:type="simple"/></inline-formula>. The result <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x28.png" xlink:type="simple"/></inline-formula> has the same size and class as<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x29.png" xlink:type="simple"/></inline-formula>. The output is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x30.png" xlink:type="simple"/></inline-formula>.</p><p>8) Calculate the difference matrix, it returns a matrix <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x31.png" xlink:type="simple"/></inline-formula> includes values in [0.0, 1.1], where zero value is represent black or non-intensity, and 1.0 is represent full intensity or white, according to the following relation (See <xref ref-type="fig" rid="fig5">Figure 5</xref>(a).)</p><disp-formula id="scirp.64018-formula100"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/7-3400432x32.png"  xlink:type="simple"/></disp-formula><p>9) Convert the matrix <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x33.png" xlink:type="simple"/></inline-formula> to grayscale image, sets the values of 0 and 255 to 0.0 and 1.0 in<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x34.png" xlink:type="simple"/></inline-formula>. See <xref ref-type="fig" rid="fig5">Figure 5</xref>(b).</p><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Original retina image, RGB channels and their histograms</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/7-3400432x35.png"/></fig></sec><sec id="s4"><title>4. Feature Selection Based on Gabor Filter</title><p>The recurrence and representations of direction in Gabor wavelets (candidate/filters) are identical to those of the persons optical system and they have been establish to be especially suitable for texture representation and recognition [<xref ref-type="bibr" rid="scirp.64018-ref27">27</xref>] . Gabor filters have been to a large degree utilized in applications of pattern analyses [<xref ref-type="bibr" rid="scirp.64018-ref27">27</xref>] -[<xref ref-type="bibr" rid="scirp.64018-ref29">29</xref>] . The most significant characteristic of Gabor filters is their stability to lightness, revolution, translation and scale. Moreover, they can fight photometric sensations, such as image noise and changes of illumination. In the zone of spatial, a 2-D Gabor filter is a function of Gaussian kernel modified by a wave of complex sinusoidal plane, given by</p><disp-formula id="scirp.64018-formula101"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/7-3400432x36.png"  xlink:type="simple"/></disp-formula><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Remove snowflakes, and average filter <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x38.png" xlink:type="simple"/></inline-formula> with<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x39.png" xlink:type="simple"/></inline-formula></title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/7-3400432x37.png"/></fig><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> The difference matrix, and its grayscale values</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/7-3400432x40.png"/></fig><p>and</p><disp-formula id="scirp.64018-formula102"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/7-3400432x41.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x42.png" xlink:type="simple"/></inline-formula> is the wavelength of the sine of the angle factor, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x43.png" xlink:type="simple"/></inline-formula>clarifies the direction of the straight to the parallel lines of a Gabor function, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x44.png" xlink:type="simple"/></inline-formula>is the offset of phase, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x45.png" xlink:type="simple"/></inline-formula>represents the standard deviation of the Gaussian wrapper and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x45.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x46.png" xlink:type="simple"/></inline-formula> defines the ratio of spatial aspect which allocates the elliptic shape of the Gabor function support. The suggested method uses forty Gabor filters, contains eight directions and five scales as illustrated in <xref ref-type="fig" rid="fig6">Figure 6</xref>. And <xref ref-type="fig" rid="fig7">Figure 7</xref> show the outcomes of step of retinal feature selection after implementing Gabor filters on the retinal image together with real parts of the result images. We note that the pixels of adjacent in the retinal image are very correlated, and we can separate the redundancy of information and remove it by sampling of the resulting features images [<xref ref-type="bibr" rid="scirp.64018-ref28">28</xref>] .</p></sec><sec id="s5"><title>5. Feature Selection and Classification Using SVM</title><p>The proposed supervised method for features evaluation is a linear SVM [<xref ref-type="bibr" rid="scirp.64018-ref30">30</xref>] . Let S be a set of N training samples<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x47.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x47.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x48.png" xlink:type="simple"/></inline-formula>is the feature vector of a given pixel i and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x47.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x49.png" xlink:type="simple"/></inline-formula> its corresponds to the label (in our case, +1 represents the blood vessel feature class, and −1 any otherwise). The SVM specifies the optimal case of separating hyper plane for which the threshold of separation between classes in the d-dimensional feature space is maximized. This is achieved by optimizing the following expression:</p><disp-formula id="scirp.64018-formula103"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/7-3400432x50.png"  xlink:type="simple"/></disp-formula><p>subject to the linear constraints</p><disp-formula id="scirp.64018-formula104"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/7-3400432x51.png"  xlink:type="simple"/></disp-formula><fig id="fig6"  position="float"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Eight orientations and five scales using Gabor wavelets</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/7-3400432x52.png"/></fig><fig id="fig7"  position="float"><label><xref ref-type="fig" rid="fig7">Figure 7</xref></label><caption><title> Results of feature extraction after applying filters</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/7-3400432x53.png"/></fig><p>where w is the weight vector, b is a bias term which is also learned from training data, each <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x54.png" xlink:type="simple"/></inline-formula> is a slack variable, and the parameter <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x55.png" xlink:type="simple"/></inline-formula> controls the trade-off between the minimization of classification errors on the training set (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x56.png" xlink:type="simple"/></inline-formula>) and the maximization of the margin (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/7-3400432x57.png" xlink:type="simple"/></inline-formula>). Once the model is learned, the function sign of decision specifies the class of a new point x:</p><disp-formula id="scirp.64018-formula105"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/7-3400432x58.png"  xlink:type="simple"/></disp-formula><p>The variances in various recurrences and directions in the retinal image is extracted by Gabor filters. The vector size of the resulting feature of image size (120 &#215; 120) is calculated by multiply the number of orientations and scales (8 &#215; 5) divided by (4 &#215; 4) which represent the row and column down sampling factors, i.e. the vector size in this case (120 &#215; 120) &#215; (8 &#215; 5)/(4 &#215; 4) = 36,000. The size of feature vector can be reduced using reduction dimensionality methods for increasing the robustness of the extracted features. The Principal components analysis (PCA) (PCA), general discriminant analysis (GDA) or linear discriminant analysis (LDA) can be applied to reduce the dimensionality of feature vector. The details for these methods are presented in [<xref ref-type="bibr" rid="scirp.64018-ref27">27</xref>] . In LDA-based methods, the features number relies on the classes number in the problem of classification. The features number can be nearly equal to the number of classes. In this work, it is obtained a significant reduction of the features number of dimensionality up to 199 instead of 36,000 using LDA method.</p></sec><sec id="s6"><title>6. Experimental Results and Discussion</title><sec id="s6_1"><title>6.1. Dataset</title><p>There is database a commonly obtainable namely DRIVE acronym for “Digital Retinal Images for Vessel Extraction”. It contains of 40 color photographs of eye fundus. The photographs were acquired from the population of diabetic retinopathy screening consists of 453 categories among 31 and 86 years of age in the Netherlands. Each image has been common practice JPEG compressed format. The second database of retinal images database were used, namely VARIA database. It is a collection of retinal images applied for authentication objectives. The VARIA database contains 233 images, taken from 139 different person. The images have been captured with a TopCon non-mydriatic camera NW-100 sample and are optic disc centered with a resolution of 768 &#215; 584 [<xref ref-type="bibr" rid="scirp.64018-ref31">31</xref>] .</p><p>The third database, originally collected by Hoover et al. [<xref ref-type="bibr" rid="scirp.64018-ref32">32</xref>] , is the structured analysis of the retina (STARE). It consists of a total of twenty eye fundus color images where ten of them contain pathology. The images were captured using a TopCon TRV-50 fundus camera with FOV equal to thirty-five degree. Each image resolution is 700 &#215; 605 pixels with eight bits per color channel and it’s available in PPM format. The set of twenty images are not divided into separated training and testing sets. <xref ref-type="fig" rid="fig8">Figure 8</xref> shows examples of retinal images from the DRIVE, VARIA and STARE database. In the STARE database we can see same difficulties as the DRIVE data set, but the STARE contains ore abnormal images.</p></sec><sec id="s6_2"><title>6.2. Results</title><p>The proposed method is implemented and executed on MATLAB stand and has been examined on above-men- tioned retinal datasets. We used the following performance measures in our analysis to determine the accuracy of proposed method, Equal Error Rate (EER), False Acceptance Rate (FAR), Genuine Acceptance Rate (GAR), and False Rejection Rate (FRR). FAR means the accepting imposter rate, it is a measure of the number of cheaters users accept falsely in the system as “genuine” users. FRR represents the rate of rejecting genuine user, it is a measure of the number of falsely rejected many genuine users by the system as “imposters”. GAR represents the rate of accepting genuine user, it is the ratio of the extracted features of every user to other image patterns of the same user. After complete the comparisons, if the value of similarity rate is greater than the value of fixed threshold, then the user is accepted as a genuine. While if the user is rejected, it means that a real user is not acceptable. i.e. it implies that falsely rejected. This locates false rejection rate FRR. We can find the measurement of these inaccuracy ratio by mapping a chain of impostor scores and genuine scores into chart based on their score and frequency. In order to get False Acceptance Rate (FAR), We compare vector features of every user to other vector features of all users in the data base.</p><p>During the processing of comparison, if the score of matching is greater than the fixed threshold, then it means that an imposter is acceptable. At fixed thresholds, whole the comparisons are achieve on the vector database to calculate FRR, FAR and GAR. The system repeats this experiment with each new value of the threshold. The input retina images in DRIVE images database have a good quality, so the proposed retinal authentication method produced 100% rate of recognition and 0% EER with a good separation of inter-class space between genuine users and quacks. The system was obtained 98.2% rate of recognition and 0.013% EER in the VARIA database. Since most of input retina images in STARE images database were diseased ones, the system obtained 92.6% rate of recognition and an EER of 0.12%. <xref ref-type="fig" rid="fig9">Figure 9</xref> and <xref ref-type="fig" rid="fig1">Figure 1</xref>0 shows the separated distance between the two classes is greater in DRIVE database compared to VARIA and STARE databases. <xref ref-type="table" rid="table1"><xref ref-type="table" rid="table">Table </xref>1</xref> offers the values acquired for the Verification Rate and EER measures for the above standard databases.</p><p>The performance and accuracy of proposed retinal authentication method were presented through ROC curve. The ROC curves were created by changing the threshold on the categorization image. The optimal value of the threshold is picked to obtain maximization of the accuracy. The relation between FAR and GAR of the above</p><fig id="fig8"  position="float"><label><xref ref-type="fig" rid="fig8">Figure 8</xref></label><caption><title> Samples of three databases used in the experiments</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/7-3400432x59.png"/></fig><fig id="fig9"  position="float"><label><xref ref-type="fig" rid="fig9">Figure 9</xref></label><caption><title> ROC drawn between verification rate (GAR), and false acceptance rate (FAR)</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/7-3400432x60.png"/></fig><fig id="fig10"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>0</label><caption><title> ROC drawn between equal error rate (EER), and false acceptance rate (FAR)</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/7-3400432x61.png"/></fig><table-wrap id="table1" ><label><xref ref-type="table" rid="table1"><xref ref-type="table" rid="table">Table </xref>1</xref></label><caption><title> Performance analysis of the proposed method for different databases</title></caption><table><tbody><thead><tr><th align="center" valign="middle"  rowspan="2"  ><xref ref-type="table" rid="table">Table </xref>Head</th><th align="center" valign="middle"  colspan="3"  >Database</th></tr></thead><tr><td align="center" valign="middle" >DRIVE</td><td align="center" valign="middle" >AVRIA</td><td align="center" valign="middle" >STARE</td></tr><tr><td align="center" valign="middle" >Images No.</td><td align="center" valign="middle" >40</td><td align="center" valign="middle" >233</td><td align="center" valign="middle" >30</td></tr><tr><td align="center" valign="middle" >Comparisons</td><td align="center" valign="middle" >80</td><td align="center" valign="middle" >463</td><td align="center" valign="middle" >60</td></tr><tr><td align="center" valign="middle" >Verification Rate %</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >98.2</td><td align="center" valign="middle" >92.6</td></tr><tr><td align="center" valign="middle" >EER %</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0.013</td><td align="center" valign="middle" >0.12</td></tr></tbody></table></table-wrap><p>databases is shown in <xref ref-type="fig" rid="fig9">Figure 9</xref>. FRR and FAR are equal but The EER is get from the curve of ROC represent between FRR and FAR, see <xref ref-type="fig" rid="fig1">Figure 1</xref>0.</p></sec></sec><sec id="s7"><title>7. Conclusion</title><p>A simple and efficient method of authentication is introduced in this paper based on identification of retinal features. This method includes blood-vessel segmentation, creation of feature pattern and then matching of these features. Three commonly databases, DRIVE, VARIA and STARE are used in experiments to calculate the performance analysis. The method is stable to multiple and rotary shift of digital retina images. It gets rates of recognition of 100%, 98.2% and 92.6% for the DRIVE, VARIA and STARE digital datasets respectively. This preserves larger rate of recognition even for huge datasets holding noise of images. Moreover, the proposed method can be used to other images in which it is of benefit to find the vascular consisting of a blood vessel.</p></sec><sec id="s8"><title>Cite this paper</title><p>Mohamed A.El-Sayed,M.Hassaballah,Mohammed A.Abdel-Latif,11, (2016) Identity Verification of Individuals Based on Retinal Features Using Gabor Filters and SVM. Journal of Signal and Information Processing,07,49-59. doi: 10.4236/jsip.2016.71007</p></sec></body><back><ref-list><title>References</title><ref id="scirp.64018-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Luo, H., Xin, F., Pan, J.-S., Chu, S.-C. and Tsai, P.-W. (2010) A Survey of Vein Recognition Techniques. Information Technology Journal, 9, 1142-1149. http://dx.doi.org/10.3923/itj.2010.1142.1149</mixed-citation></ref><ref id="scirp.64018-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Prabhakar, S., Pankanti, S. and Jain, A.K. (2003) Biometric Recognition: Security and Privacy Concerns. IEEE Security and Privacy, 1, 33-42. http://dx.doi.org/10.1109/MSECP.2003.1193209</mixed-citation></ref><ref id="scirp.64018-ref3"><label>3</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Das</surname><given-names> R. </given-names></name>,<etal>et al</etal>. (<year>2007</year>)<article-title>Retinal Recognition Biometric Technology in Practice</article-title><source> Keesing Journal of Documents &amp; Identity</source><volume> 22</volume>,<fpage> 11</fpage>-<lpage>14</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.64018-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">El-Sayed, M.A., Bahgat, S.F. and Abdel-Khalek, S. (2013) New Approach for Identity Verification System Using the Vital Features Based on Entropy. International Journal of Computer Science Issues (IJCSI), 10, 11-17.</mixed-citation></ref><ref id="scirp.64018-ref5"><label>5</label><mixed-citation publication-type="book" xlink:type="simple">Jain, A.K., Flynn, P.J. and Ross, A.A., Eds. (2007) Handbook of Biometrics. Springer-Verlag, Heidelberg.</mixed-citation></ref><ref id="scirp.64018-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Jain, A.K., Ross, A. and Prabhakar, S. (2004) An Introduction to Biometric Recognition. IEEE Transactions on Circuits and Systems for Video Technology, 14, 4-20. http://dx.doi.org/10.1109/TCSVT.2003.818349</mixed-citation></ref><ref id="scirp.64018-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Rhodes, K.A. (2003) Information Security: Challenges in Using Biometrics. United States General Accounting Office, Technical Report # GAO-03-1137T.</mixed-citation></ref><ref id="scirp.64018-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Haykin, S. (2003) Neural Networks—A Comprehensive Foundation. 2nd Edition, Pearson Education, New Delhi.</mixed-citation></ref><ref id="scirp.64018-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Simon, C. and Goldstein, I. (1935) A New Scientific Method of Identification. New York State Journal of Medicine, 35, 901-906.</mixed-citation></ref><ref id="scirp.64018-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Tower, P. (1955) The Fundus Oculi in Monozygotic Twins: Report of Six Pairs of Identical Twins. Archives of Ophthalmology, 54, 225-239. http://dx.doi.org/10.1001/archopht.1955.00930020231010</mixed-citation></ref><ref id="scirp.64018-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Woodward, J.D., Orlans, N.M. and Higgins, P.T. (2003) Biometrics: Identity Assurance in the Information Age. Osborne McGraw-Hill, New York.</mixed-citation></ref><ref id="scirp.64018-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Jain, A.K., Bolle, R.M. and Pankanti, S. (2005) Biometrics: Personal Identification in Networked Society. Kluwer Academic Publishers, Dordrecht.</mixed-citation></ref><ref id="scirp.64018-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Farzin, H., Abrishami-Moghaddam, H. and Moin, M.-S. (2008) A Novel Retinal Identification System. EURASIP Journal on Advances in Signal Processing, 2008, Article ID: 280635. http://dx.doi.org/10.1155/2008/280635</mixed-citation></ref><ref id="scirp.64018-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Zana, F. and Klein, J.C. (2001) Segmentation of Vessel-Like Patterns Using Mathematical Morphology and Curvature Evaluation. IEEE Transactions on Image Processing, 10, 1010-1019. http://dx.doi.org/10.1109/83.931095</mixed-citation></ref><ref id="scirp.64018-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, Y., Hsu, W. and Lee, M.L. (2009) Detection of Retinal Blood Vessels Based on Nonlinear Projections. Journal of Signal Processing Systems, 55, 103-112. http://dx.doi.org/10.1007/s11265-008-0179-5</mixed-citation></ref><ref id="scirp.64018-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Fukuta, K., Nakagawa, T., Hayashi, Y., Hatanaka, Y., Hara, T. and Fujita, H. (2011) Personal Identification Based on Blood Vessels of Retinal Fundus Images. Proceedings of SPIE, 6914.</mixed-citation></ref><ref id="scirp.64018-ref17"><label>17</label><mixed-citation publication-type="book" xlink:type="simple">Bevilacqua, V., Cariello, L., Columbo, D., Daleno, D., Fabiano, M.D., Giannini, M., Mastronardi, G. and Castellano, M. (2008) Retinal Fundus Biometric Analysis for Personal Identifications. In: Huang, D.-S., Wunsch II, D.C., Levine, D.S. and Jo, K.-H., Eds., Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, Lecture Notes in Computer Science, Vol. 5227, Springer, Berlin, 1229-1237. http://dx.doi.org/10.1007/978-3-540-85984-0_147</mixed-citation></ref><ref id="scirp.64018-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Akram, M.U., Tariq, A. and Khan, S.A. (2011) Retinal Recognition: Personal Identification Using Blood Vessels. 6th International Conference on Internet Technology and Secured Transactions, Abu Dhabi, 11-14 December 2011, 180-184.</mixed-citation></ref><ref id="scirp.64018-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Ortega, M., Penedo, M.G., Rouco, J., Barreira, N. and Carreira, M.J. (2009) Retinal Verification Using a Feature Points-Based Biometric Pattern. EURASIP Journal on Advances in Signal Processing, 2009, Article ID: 235746. http://dx.doi.org/10.1155/2009/235746</mixed-citation></ref><ref id="scirp.64018-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Fatima, J., Syed, A.M. and Usman Akram, M. (2013) Feature Point Validation for Improved Retina Recognition. IEEE Workshop on Biometric Measurements and Systems for Security and Medical Applications (BIOMS), Napoli, 9 September 2013, 13-16. http://dx.doi.org/10.1109/BIOMS.2013.6656142</mixed-citation></ref><ref id="scirp.64018-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Yu, H., Han, J. and Chang, K.C. (2002) PEBL: Positive-Example Based Learning for Web Page Classification Using SVM. Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’02), Edmonton, 23-25 July 2002, 239-248. http://dx.doi.org/10.1145/775047.775083</mixed-citation></ref><ref id="scirp.64018-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Cristianini, N. and Shawe-Taylor, J. (2000) An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods. Cambridge University Press, Cambridge. http://dx.doi.org/10.1017/CBO9780511801389</mixed-citation></ref><ref id="scirp.64018-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Jonsson, K., Kittler, J., Li, Y.P. and Matas, J. (2002) Support Vector Machines for Face Authentication. Image and Vision Computing, 20, 369-375. http://dx.doi.org/10.1016/S0262-8856(02)00009-4</mixed-citation></ref><ref id="scirp.64018-ref24"><label>24</label><mixed-citation publication-type="other" xlink:type="simple">Statnikov, A., Aliferis, C.F., Hardin, D.P. and Guyon, I. (2011) A Gentle Introduction to Support Vector Machines in Biomedicine: Theory and Methods. World Scientific Publishing Co Pte Ltd, Hackensack. http://dx.doi.org/10.1142/7922</mixed-citation></ref><ref id="scirp.64018-ref25"><label>25</label><mixed-citation publication-type="other" xlink:type="simple">Tomar, D. and Agarwal, S. (2015) Twin Support Vector Machine: A Review from 2007 to 2014. Egyptian Informatics Journal, 16, 55-69. http://dx.doi.org/10.1016/j.eij.2014.12.003</mixed-citation></ref><ref id="scirp.64018-ref26"><label>26</label><mixed-citation publication-type="other" xlink:type="simple">Akram, M.U., Nasir, S., Anjum, M.A. and Javed, M.Y. (2009) Background and Noise Extraction from Colored Retinal Images. IEEE World Congress on Computer Science and Information Engineering, Los Angeles, 31 March-2 April 2009, 573-577. http://dx.doi.org/10.1109/csie.2009.753</mixed-citation></ref><ref id="scirp.64018-ref27"><label>27</label><mixed-citation publication-type="other" xlink:type="simple">Shen, L.L., Bai, L. and Fairhurst, M. (2007) Gabor Wavelets and General Discriminant Analysis for Face Identification and Verification. Image and Vision Computing, 25, 553-563. http://dx.doi.org/10.1016/j.imavis.2006.05.002</mixed-citation></ref><ref id="scirp.64018-ref28"><label>28</label><mixed-citation publication-type="other" xlink:type="simple">Liu, C. and Wechsler, H. (2002) Gabor Feature Based Classification Using the Enhanced Fisher Linear Discriminant Model for Face Recognition. IEEE Transactions on Image Processing, 11, 467-476. http://dx.doi.org/10.1109/TIP.2002.999679</mixed-citation></ref><ref id="scirp.64018-ref29"><label>29</label><mixed-citation publication-type="other" xlink:type="simple">Meshgini, S., Zadeh, A.A. and Arabi, H.S. (2013) Face Recognition Using Gabor Based Direct Linear Discriminant Analysis and Support Vector Machine. Computers &amp; Electrical Engineering, 39, 727-745. http://dx.doi.org/10.1016/j.compeleceng.2012.12.011</mixed-citation></ref><ref id="scirp.64018-ref30"><label>30</label><mixed-citation publication-type="other" xlink:type="simple">Haghighat, M.B.A. and Namjoo, E. (2011) Evaluating the Informativity of Features in Dimensionality Reduction Methods. 5th International Conference on Application of Information and Communication Technologies, AICT, Baku, 12-14 October 2011, 1-5. http://dx.doi.org/10.1109/icaict.2011.6110938</mixed-citation></ref><ref id="scirp.64018-ref31"><label>31</label><mixed-citation publication-type="other" xlink:type="simple">Ortega, M., Penedo, M.G., Rouco, J., Barreira, N. and Carreira, M.J. (2009) Personal Verification Based on Extraction and Characterization of Retinal Feature Points. Journal of Visual Languages and Computing, 20, 80-90. http://dx.doi.org/10.1016/j.jvlc.2009.01.006</mixed-citation></ref><ref id="scirp.64018-ref32"><label>32</label><mixed-citation publication-type="other" xlink:type="simple">Yan Lam, B.S. and Yan, H. (2008) A Novel Vessel Segmentation Algorithm for Pathological Retina Images Based on the Divergence of Vector Fields. IEEE Transactions on Medical Imaging, 27, 237-246.</mixed-citation></ref></ref-list></back></article>