<?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">IJIS</journal-id><journal-title-group><journal-title>International Journal of Intelligence Science</journal-title></journal-title-group><issn pub-type="epub">2163-0283</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ijis.2015.51002</article-id><article-id pub-id-type="publisher-id">IJIS-52453</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>
 
 
  Target Image Classification through Encryption Algorithm Based on the Biological Features
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>hiwu</surname><given-names>Chen</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Qing</surname><given-names>E. Wu</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Weidong</surname><given-names>Yang</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib></contrib-group><aff id="aff2"><addr-line>School of Computer Science, Fudan University, Shanghai, China</addr-line></aff><aff id="aff1"><addr-line>College of Electric and Information Engineering, Zhengzhou University of Light Industry, Zhengzhou, China</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>wqe969699@163.com(QEW)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>22</day><month>12</month><year>2014</year></pub-date><volume>05</volume><issue>01</issue><fpage>6</fpage><lpage>12</lpage><history><date date-type="received"><day>8</day>	<month>October</month>	<year>2014</year></date><date date-type="rev-recd"><day>16</day>	<month>November</month>	<year>2014</year>	</date><date date-type="accepted"><day>1</day>	<month>December</month>	<year>2014</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>
 
 
  In order to effectively make biological image classification and identification, this paper studies the biological owned characteristics, gives an encryption algorithm, and presents a biological classification algorithm based on the encryption process. Through studying the composition characteristics of palm, this paper uses the biological classification algorithm to carry out the classification or recognition of palm, improves the accuracy and efficiency of the existing biological classification and recognition approaches, and compares it with existing main approaches of palm classification by experiments. Experimental results show that this classification approach has the better classification effect, the faster computing speed and the higher classification rate which is improved averagely by 1.46% than those of the main classification approaches.
 
</p></abstract><kwd-group><kwd>Encryption</kwd><kwd> Palm Recognition</kwd><kwd> Classification</kwd><kwd> Feature Extraction</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>The occurrence of computer has prompted the development of network and society informationization. On the other hand, the networked and informationized society demands a higher security for the information and systems [<xref ref-type="bibr" rid="scirp.52453-ref1">1</xref>] . The body biometric recognition technology is to use the biological characteristics owned by the human body to carry out an automatic identification, biology recognition technique for short, which is one of fundamental methods which are used for enhancing the security of information and systems. The palmprint recognition technology is an important part of the biology recognition ones [<xref ref-type="bibr" rid="scirp.52453-ref2">2</xref>] . Currently, the palmprint recognition technique has been widely used in police department, military branch and so on.</p><p>In 1998, the idea of automatic identification by using palm recognition was described systematically and comprehensively by Hong Kong Polytechnic University and Tsinghua University [<xref ref-type="bibr" rid="scirp.52453-ref3">3</xref>] , which summarized comprehensively the characteristic of palm and the palmprint and opened up the research areas of palmprint recognition technology. Based on high resolution palmprint images, You et al. used the point of interest in the palmprint to carry out identification [<xref ref-type="bibr" rid="scirp.52453-ref4">4</xref>] . Among algorithms of image segmentation [<xref ref-type="bibr" rid="scirp.52453-ref5">5</xref>] - [<xref ref-type="bibr" rid="scirp.52453-ref7">7</xref>] , the Fuzzy C-Means clustering [<xref ref-type="bibr" rid="scirp.52453-ref6">6</xref>] is one of algorithms that has some better features which can meet the human cognition pattern, be described concisely and clearly, and be easy to implement and so on. However, this algorithm has some disadvantages such as its performance depending on the initial clustering center, poor antinoise capability, and slow convergence and so on. From the research of traditional Markov Random Field (MRF) [<xref ref-type="bibr" rid="scirp.52453-ref7">7</xref>] , the segmentation effect of MRF to micro texture is better, but the segmentation result of macro texture has many isolated islands or small areas.</p><p>Through studying the biological characteristics of palm, this paper analyses the features of texture principal lines, papilla ridges and bifurcation points of palm. At the same time, this paper gives an encryption algorithm and presents a biological classification algorithm based on the encryption process. Moreover, this paper calculates the distance between the characteristic vector of identified palm and that of known palm, and estimates the similarity degree between the two vectors by the distance. According to the minimum distance, the classification result can be obtained. Finally, the comparison of the proposed and existing classification approaches of palm is given.</p></sec><sec id="s2"><title>2. Biological Feature Analysis</title><p>An appropriate encryption algorithm is more suitable for the features extraction of biological information, because the encryption to features of biological target is only include the characteristics of biological target, but not involve in some noises and background. Therefore, the analysis to biological feature needs to be discussed firstly in this section. Here, the features of palmprint as a biological feature example are analyzed.</p><p>The main research object to palm is the palmprint and fingerprint. The palmprint is the whole human palm excluding fingers, i.e., the part between the finger roots and the wrist. There is a plenty of texture information in this area including several obvious principal lines, irregular wrinkles, trivial papillary ridges and a number of bifurcation points [<xref ref-type="bibr" rid="scirp.52453-ref3">3</xref>] , which can be used as the features of palm and extracted by different methods to carry out an identification. In recent years, some researches on palmprint recognition had been attracted special attention, and some progress had been obtained, but further researches are to be made.</p><p>The fingerprint refers to the grain generated by the jagged lines on the skin of the finger ends [<xref ref-type="bibr" rid="scirp.52453-ref8">8</xref>] [<xref ref-type="bibr" rid="scirp.52453-ref9">9</xref>] . These lines of the skin in the pattern, break point and intersection are varied, and the morphology of the grain varies with everyone. i.e., the grain line of everyone is different each other, which is called a “feature” in information processing. By comparing a man’s fingerprint with previously saved fingerprints, his real identity can be verified. There is a plenty of texture information in fingerprint segment [<xref ref-type="bibr" rid="scirp.52453-ref8">8</xref>] [<xref ref-type="bibr" rid="scirp.52453-ref10">10</xref>] including several obvious grain lines, rotation direction, area coverage, trivial papillary ridges, a number of bifurcation points, break point and intersection, which can be used as the features of fingerprint and extracted by different methods to carry out an identification.</p><p>In palm image, the gray level of pixels in the features region and ones in the non-features region are different, as shown in the energy diagrams of <xref ref-type="fig" rid="fig1"><xref ref-type="fig" rid="fig">Figure </xref>1</xref>. From the <xref ref-type="fig" rid="fig">Figure </xref>found clearly, the texture feature in the features region is very prominent, which shows a fine feature of energy mutation, but the energy feature diagram of non- features region almost levels off and the mutation is not obvious.</p><p>There are a plenty of papillary ridges in a palm, which are analogous to the fingerprints. However, compared with fingerprints, the geometric regularity of papillary ridges is not so evident. Through a large number of observations, these papillary ridges show some certain regularity in specific region of palm exclude fingers. As shown in <xref ref-type="fig" rid="fig">Figure </xref>2, in the lower part of index finger root, middle finger root, ring finger root and little finger root, there are four convergent points called as triangular points, which are formed by the corresponding papillary ridges. Since these triangular points are innate and not susceptible to being damaged, and their positions are very fixed, a palmprint image can be divided up by the positions of these triangular points.</p><p>In comparison with most recognition approaches, the fingerprint and palmprint recognition suffers fewer disturbances because of the shape of palm and the acquirement of fingerprint or palmprint image is stable. Thus, a relatively fixed fingerprint or palmprint image can be obtained no matter in when and where, and what state. In a</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1"><xref ref-type="fig" rid="fig">Figure </xref>1</xref></label><caption><title> Energy feature of palm image</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/2-1680146x6.png"/></fig><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig">Figure </xref>2</label><caption><title> Triangular point in a palm</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/2-1680146x7.png"/></fig><p>concrete extraction, either the one of those features of fingerprint or palmprint may be extracted such as the one of principal lines and bifurcation points, or all features are extracted by high resolution acquisition equipment and fuse them together to construct a high precision palm recognition system.</p></sec><sec id="s3"><title>3. Image Encryption Algorithm Proposed to Target Feature</title><p>For carrying out encryption, an encryption algorithm is given as follows:</p><p>Assume the current inputted feature is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x8.png" xlink:type="simple"/></inline-formula>, and also inputted <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x9.png" xlink:type="simple"/></inline-formula> features are <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x10.png" xlink:type="simple"/></inline-formula> before. By the encryption algorithm, the current output information <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x11.png" xlink:type="simple"/></inline-formula> can be obtained. Their relationship can be denoted by the following formula.</p><disp-formula id="scirp.52453-formula263"><graphic  xlink:href="http://html.scirp.org/file/2-1680146x12.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x13.png" xlink:type="simple"/></inline-formula> is a binary linear convolution code algorithm, i.e., is a Boolean function composed by modular binary addition operation. Assume the length of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x14.png" xlink:type="simple"/></inline-formula> is a constant <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x15.png" xlink:type="simple"/></inline-formula> bits, and the length of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x16.png" xlink:type="simple"/></inline-formula> is a constant <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x17.png" xlink:type="simple"/></inline-formula> bits, which they are all called one section.</p><p>For each <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x18.png" xlink:type="simple"/></inline-formula> bits input, produce a <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x19.png" xlink:type="simple"/></inline-formula> bits output. The relation of any input section <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x20.png" xlink:type="simple"/></inline-formula> and any output section <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x21.png" xlink:type="simple"/></inline-formula> is a special relation of linear block encoding<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x22.png" xlink:type="simple"/></inline-formula>. There is a <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x23.png" xlink:type="simple"/></inline-formula> binary matrix denoted by <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x24.png" xlink:type="simple"/></inline-formula> which makes the following formula established.</p><disp-formula id="scirp.52453-formula264"><graphic  xlink:href="http://html.scirp.org/file/2-1680146x25.png"  xlink:type="simple"/></disp-formula><p>Therefore, for each message queue, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x26.png" xlink:type="simple"/></inline-formula>, the corresponding output queue is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x27.png" xlink:type="simple"/></inline-formula>, and satisfies the requirement of following formula:</p><disp-formula id="scirp.52453-formula265"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-1680146x28.png"  xlink:type="simple"/></disp-formula><p>Formula (1) is a convolution code model. The binary linear convolution code<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x29.png" xlink:type="simple"/></inline-formula>, which is denoted by<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x30.png" xlink:type="simple"/></inline-formula>, is a set of code word<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x31.png" xlink:type="simple"/></inline-formula>. The set can be denoted by the following formula:</p><disp-formula id="scirp.52453-formula266"><graphic  xlink:href="http://html.scirp.org/file/2-1680146x32.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x33.png" xlink:type="simple"/></inline-formula> is the matrix generated by the convolution code:</p><disp-formula id="scirp.52453-formula267"><graphic  xlink:href="http://html.scirp.org/file/2-1680146x34.png"  xlink:type="simple"/></disp-formula><p>The <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x35.png" xlink:type="simple"/></inline-formula> is a basic generated matrix of convolution code, which is a submatrix of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x36.png" xlink:type="simple"/></inline-formula>, composed by front of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x37.png" xlink:type="simple"/></inline-formula> rows and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x38.png" xlink:type="simple"/></inline-formula> columns of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x39.png" xlink:type="simple"/></inline-formula>. It can be denoted by:</p><disp-formula id="scirp.52453-formula268"><graphic  xlink:href="http://html.scirp.org/file/2-1680146x40.png"  xlink:type="simple"/></disp-formula><p>The <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x41.png" xlink:type="simple"/></inline-formula>-th row in<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x42.png" xlink:type="simple"/></inline-formula>, denoted by<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x43.png" xlink:type="simple"/></inline-formula>, describes the influence that the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x44.png" xlink:type="simple"/></inline-formula>-th input bit in all in-put section versus all out-put bits. Where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x45.png" xlink:type="simple"/></inline-formula> is the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x45.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x46.png" xlink:type="simple"/></inline-formula>-th generator of convolution code. It is obvious that the convolution code <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x45.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x46.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x47.png" xlink:type="simple"/></inline-formula> has the count of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x45.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x46.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x47.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x48.png" xlink:type="simple"/></inline-formula> generators.</p><p>Through doing some experiments, the feature extraction based on the proposed encryption algorithm can provide translation, rotation, or scale invariant properties, because the algorithm is only involve in the characteristics of biological target, but not include the position of target.</p></sec><sec id="s4"><title>4. Give Image Classification or Recognition Algorithm</title><sec id="s4_1"><title>4.1. Propose Algorithm of Classification or Recognition</title><p>According to the principal lines, triangular points, irregular wrinkles, trivial papillary ridges and a number of bifurcation points of palmprint feature, some palmprints can be classified. Or if the search fingerprints are classified according to such attributes of fingerprint as grain lines, rotation direction, area coverage, trivial papillary ridges, a number of bifurcation points, break point and intersection, with the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x49.png" xlink:type="simple"/></inline-formula> samples classified into <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x50.png" xlink:type="simple"/></inline-formula> categories<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x51.png" xlink:type="simple"/></inline-formula>, then such <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x52.png" xlink:type="simple"/></inline-formula> categories should be the sample sets of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x53.png" xlink:type="simple"/></inline-formula>, and each category identified should have <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x54.png" xlink:type="simple"/></inline-formula> samples,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x55.png" xlink:type="simple"/></inline-formula>. Assume the sample has <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x56.png" xlink:type="simple"/></inline-formula> attributes, such as the bifurcation points, break point, intersection and so on, then the indexes of sample points can form a <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x57.png" xlink:type="simple"/></inline-formula>-dimensional characteristic space, and each sample point will have only one corresponding point in the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x58.png" xlink:type="simple"/></inline-formula>-dimensional cha-</p><p>racteristic space. Moreover, for any sample to be identified<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x59.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x60.png" xlink:type="simple"/></inline-formula>represents</p><p>the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula>-th attribute of the sample<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula>. For a sample <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x63.png" xlink:type="simple"/></inline-formula> to be identified, the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x64.png" xlink:type="simple"/></inline-formula> samples that are closest to <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x65.png" xlink:type="simple"/></inline-formula> are chosen firstly according to the defined distance in the training sample data set, and the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x66.png" xlink:type="simple"/></inline-formula> samples are represented by <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x67.png" xlink:type="simple"/></inline-formula> respectively. Assume <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x68.png" xlink:type="simple"/></inline-formula> are the number of samples belonging to categories <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x68.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x69.png" xlink:type="simple"/></inline-formula> in the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x68.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x70.png" xlink:type="simple"/></inline-formula> neighbors. If <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x68.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x71.png" xlink:type="simple"/></inline-formula><sub> </sub>is the largest one, then the sample <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x68.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x72.png" xlink:type="simple"/></inline-formula> will belong to the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x68.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x73.png" xlink:type="simple"/></inline-formula> category.</p><p>Distance definition: Assume the sample <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x74.png" xlink:type="simple"/></inline-formula> and the sample <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x74.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x75.png" xlink:type="simple"/></inline-formula>, then the distance can be defined as follows:</p><disp-formula id="scirp.52453-formula269"><graphic  xlink:href="http://html.scirp.org/file/2-1680146x76.png"  xlink:type="simple"/></disp-formula><p>Assume <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x77.png" xlink:type="simple"/></inline-formula> is the distance between the sample <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x78.png" xlink:type="simple"/></inline-formula> and the center <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x79.png" xlink:type="simple"/></inline-formula><sub> </sub>of the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x80.png" xlink:type="simple"/></inline-formula>-th category, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x81.png" xlink:type="simple"/></inline-formula> is a fuzzy weighted exponent.</p><p>The center <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x82.png" xlink:type="simple"/></inline-formula> of each category can be calculated as follows:</p><disp-formula id="scirp.52453-formula270"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-1680146x83.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x84.png" xlink:type="simple"/></inline-formula> can be given by membership function and must satisfy the following conditions:</p><p>(1) The defined <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x85.png" xlink:type="simple"/></inline-formula> should be inversely proportional to<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x86.png" xlink:type="simple"/></inline-formula>, namely, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x87.png" xlink:type="simple"/></inline-formula>is a monotone decreasing function about<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x88.png" xlink:type="simple"/></inline-formula>; (2) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x89.png" xlink:type="simple"/></inline-formula>is a monotone increasing function about the fuzzy weighted exponent<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x90.png" xlink:type="simple"/></inline-formula>; (3) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x91.png" xlink:type="simple"/></inline-formula>is the degree of membership, so<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x92.png" xlink:type="simple"/></inline-formula>. Moreover, it requires that each category must contain one sample at least,</p><p>but the sample may not belong to the same category, so <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x93.png" xlink:type="simple"/></inline-formula> is true; (4) Simultaneously, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x93.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x94.png" xlink:type="simple"/></inline-formula>satisfies the equation<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x93.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x94.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x95.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x93.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x94.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x95.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x96.png" xlink:type="simple"/></inline-formula>.</p><p>For a sample <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x97.png" xlink:type="simple"/></inline-formula> to be identified, calculate the distance between <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x97.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x98.png" xlink:type="simple"/></inline-formula> and the center<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x97.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x98.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x99.png" xlink:type="simple"/></inline-formula>, select <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x97.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x98.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x99.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x100.png" xlink:type="simple"/></inline-formula> features</p><p>that is closest to<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula>, which are represented by <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x102.png" xlink:type="simple"/></inline-formula> respectively. Define an ordered pair<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x103.png" xlink:type="simple"/></inline-formula>, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x104.png" xlink:type="simple"/></inline-formula> is the category which the sample x belongs to:<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x105.png" xlink:type="simple"/></inline-formula>, in which <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x106.png" xlink:type="simple"/></inline-formula> is a set of samples to be identified, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x106.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x107.png" xlink:type="simple"/></inline-formula>is a finite set <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x106.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x107.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x108.png" xlink:type="simple"/></inline-formula> of category, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x106.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x107.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x108.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x109.png" xlink:type="simple"/></inline-formula>is the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x106.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x107.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x108.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x109.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x110.png" xlink:type="simple"/></inline-formula>-th type feature of the partition identified feature, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x106.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x107.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x108.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x109.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x110.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x111.png" xlink:type="simple"/></inline-formula> is the number of categories. Then <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x106.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x107.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x108.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x109.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x110.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x111.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x112.png" xlink:type="simple"/></inline-formula> can be calculated as follows:</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x113.png" xlink:type="simple"/></inline-formula>,</p><p>here<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x114.png" xlink:type="simple"/></inline-formula>, then the sample <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x114.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x115.png" xlink:type="simple"/></inline-formula> belongs to the category<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x114.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x115.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x116.png" xlink:type="simple"/></inline-formula>. where,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x114.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x115.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x116.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x117.png" xlink:type="simple"/></inline-formula>.</p></sec><sec id="s4_2"><title>4.2. Experiment and Analysis</title><p>Here, the Hong Kong Polytechnic University (HKPU) palmprint database is used for evaluating the classification or recognition algorithm. For each palm image, 10 times repeating experiments are carried out by the above feature classification and recognition method in simulation. Moreover, some features of palm here are used for the classification and recognition algorithm, i.e., principal line, irregular wrinkle, trivial papillary ridge, bifurcation point, triangular point features. The number of samples is different in each experiment. The literature [<xref ref-type="bibr" rid="scirp.52453-ref11">11</xref>] provided an updated survey of palmprint recognition methods, and presented a comparative study to evaluate the performance of the state-of-the-art palmprint recognition methods. According to [<xref ref-type="bibr" rid="scirp.52453-ref11">11</xref>] , the proposed classification approach compares with those currently usually used approaches such as FCM [<xref ref-type="bibr" rid="scirp.52453-ref6">6</xref>] , Median filter [<xref ref-type="bibr" rid="scirp.52453-ref9">9</xref>] , Gabor [<xref ref-type="bibr" rid="scirp.52453-ref12">12</xref>] and Fourier transform [<xref ref-type="bibr" rid="scirp.52453-ref13">13</xref>] . The experimental results show that the average correct classification rates of these approaches are 95.57%, 94.11%, 93.24%, 92.45% and 88.17% in simulation of 500 times, respectively. The simulation results are shown in <xref ref-type="fig" rid="fig">Figure </xref>3.</p><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig">Figure </xref>3</label><caption><title> Comparison of correct classification rate for the proposed and other classification approache</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/2-1680146x118.png"/></fig><p>From <xref ref-type="fig" rid="fig">Figure </xref>3 concluded, the average correct classification rate of the classification approach based on feature extraction of encryption is the highest among all referred approaches. In experiment, the average correct classification rate increases constantly with the increasing classification samples, and the curve of average correct classification rate gradually levels off as the samples increase when the number of samples reaches a certain value. Through 500 times simulation, the simulation results show that every average correct classification rate is a stable value respectively when the number of samples are enough much. Moreover, the average correct classification rate of the proposed approach based on feature encryption is the highest, and its classification effect is also the best, which is shown in <xref ref-type="table" rid="table1">Table 1</xref>.</p><p>To evaluate the comprehensive performance of these approaches, we adopt the combination of quantitative analysis and qualitative analysis method, and synthesize comparison based on some factors such as the computing speed, memory capacity, communications traffic and correct classification rate. We evaluate the merits and demerits of different classification approaches for palm. <xref ref-type="table" rid="table1">Table 1</xref> gives the results of a comprehensive comparison.</p><p>In <xref ref-type="table" rid="table1">Table 1</xref>, the computing speed is the mean time obtained by the mean computing time of 10 times repeating test of these approaches at each step in simulation environment, which the computing time is only the computing time of algorithm itself. In simulation, the computer used is the Pentium 4 and 2G memory, and the programming language is Matlab. The memory capacity and the communications traffic are estimated approximately based on the computing course and complexity of every approach. From the results of <xref ref-type="table" rid="table1">Table 1</xref> seen, the memory capacity and communications traffic are close related. The average correct classification rates are the average of two stages which are an average of 500 times simulations and then taking an average of 10 time-steps for every approach under the given simulation environment. In fact, they are the average of the correct classification rates in space and time, so they are an overall average of the correct classification rates.</p><p>On the basis of the simulation results, the classification approach based on feature extraction of encryption not only has the faster processing speed, the lower memory capacity and communications traffic, but also has better classification effect.</p></sec></sec><sec id="s5"><title>5. Conclusions</title><p>This paper firstly analyzes the features of a palm image such as wrinkles, principal ridges, papillary ridges, triangular points and so on. Then, this paper discusses the biological features of palm, presenting an encryption algorithm based on the features of palm. Moreover, this paper gives the feature extraction based on encryption algorithm, as well as the classification and recognition approach of palm image, at the same time, carrying out the simulation test. Finally, the simulation results prove the feasibility and effectiveness of all proposed algorithms or approaches in each stage.</p><p>The advantage of the presented encryption algorithm is that its calculation is small and it programming is simple. However, the combination between this algorithm and other feature extraction algorithms for image will need to be discussed in the future. Moreover, to compare with existing classification or recognition approaches, the classification approach based on feature extraction of encryption in this paper has some advantages, such as the faster processing speed, the lower memory capacity and communications traffic, as well as better recognition effect, etc., and its potential application could include fingerprint recognition, iris recognition, medical image classification, etc., lots of biological classification and recognition. However, more wide applications will be urgently studied in the further work.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Comprehensive comparison of different classification approaches for palm</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Approaches</th><th align="center" valign="middle" >Average correct classification rate <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-1680146x119.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" >Computing speed</th><th align="center" valign="middle" >Memory capacity</th><th align="center" valign="middle" >Communications traffic</th></tr></thead><tr><td align="center" valign="middle" >Proposed classification</td><td align="center" valign="middle" >0.9557</td><td align="center" valign="middle" >0.426 s</td><td align="center" valign="middle" >Low</td><td align="center" valign="middle" >Low</td></tr><tr><td align="center" valign="middle" >FCM</td><td align="center" valign="middle" >0.9411</td><td align="center" valign="middle" >0. 546 s</td><td align="center" valign="middle" >Middle</td><td align="center" valign="middle" >Middle</td></tr><tr><td align="center" valign="middle" >Median filter</td><td align="center" valign="middle" >0.9324</td><td align="center" valign="middle" >0.458 s</td><td align="center" valign="middle" >Middle</td><td align="center" valign="middle" >Middle</td></tr><tr><td align="center" valign="middle" >Gabor</td><td align="center" valign="middle" >0.9245</td><td align="center" valign="middle" >0.49 s</td><td align="center" valign="middle" >Lower</td><td align="center" valign="middle" >Lower</td></tr><tr><td align="center" valign="middle" >Fourier</td><td align="center" valign="middle" >0.8817</td><td align="center" valign="middle" >0.82 s</td><td align="center" valign="middle" >Middle</td><td align="center" valign="middle" >Middle</td></tr></tbody></table></table-wrap></sec><sec id="s6"><title>Acknowledgements</title><p>This work is supported by Project of Henan Province Science and Technology (No. 142300410247); Key Project of Henan Province Education Department (No: 14A413002, 12A520049, 14A413010); Project funded by China postdoctoral science foundation (No. 2013M531120); Aerospace support fund (No. Chinare 2014-04-07); Project of Zhengzhou Science and Technology (No. 131PPTGG411-4), and fund of ZZULI (No. 2013XJJ013), respectively.</p></sec><sec id="s7"><title>NOTES</title></sec></body><back><ref-list><title>References</title><ref id="scirp.52453-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Janarthanam, S., Ramalingam, M. and Narendran, P. (2010) Texture Analysis on Low Resolution Images Using Unsupervised Segmentation Algorithm with Multichannel Local Frequency Analysis. International Conference on Communication and Computational Intelligence (INCOCCI), 4-6 January 2010, 260-265.</mixed-citation></ref><ref id="scirp.52453-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Yue, F., Zuo, W.M. and Zhang, D.P. (2010) Survey of Palmprint Recognition Algorithms. Acta Automatica Sinica, 36, 353-365.</mixed-citation></ref><ref id="scirp.52453-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Shu, W. and Zhang, D. (1998) Automated Personal Identification by Palmprint. Optical Engineering, 37, 2359-2362. 
http://dx.doi.org/10.1117/1.601756</mixed-citation></ref><ref id="scirp.52453-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">You, J., Li, W.X., et al. (2002) Hierarchical Palmprint Identification via Multiple Feature Extraction. Pattern Recognition, 1, 847-859. http://dx.doi.org/10.1016/S0031-3203(01)00100-5</mixed-citation></ref><ref id="scirp.52453-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Xie, X.Z., Wu, J.T. and Jing, M.G. (2013) Fast Two-Stage Segmentation via Non-Local Active Contours in Multiscale Texture Feature Space. Pattern Recognition Letters, 34, 1230-1239. http://dx.doi.org/10.1016/j.patrec.2013.04.016</mixed-citation></ref><ref id="scirp.52453-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Yu, J. (2011) Texture Segmentation Based on FCM Algorithm Combined with GLCM and Space Information. International Conference on Electric Information and Control Engineering, Wuhan, 15-17 April 2011, 4569-4572. 
http://dx.doi.org/10.1109/ICEICE.2011.5778005</mixed-citation></ref><ref id="scirp.52453-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Long, Z.L. and Younan, N.H. (2013) Multiscale Texture Segmentation via a Contourlet Contextual Hidden Markov Model. Digital Signal Processing, 23, 859-869. http://dx.doi.org/10.1016/j.dsp.2012.11.009</mixed-citation></ref><ref id="scirp.52453-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Jiang, X.B., You, X.E., Yuan, Y. and Gong, M.M. (2012) A Method Using Long Digital Straight Segments for Fingerprint Recognition. Neurocomputing, 77, 28-35. http://dx.doi.org/10.1016/j.neucom.2011.07.018</mixed-citation></ref><ref id="scirp.52453-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Kizrak, A.M. and &amp;oumlzen, F. (2011) A New Median Filter Based Fingerprint Recognition Algorithm. Procedia Computer Science, 3, 859-865. http://dx.doi.org/10.1016/j.procs.2010.12.141</mixed-citation></ref><ref id="scirp.52453-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Caldwell, T. (2013) Tabletop Combines Image Display and Fingerprint Recognition. Biometric Technology Today, 2013, 1, 12-13. http://dx.doi.org/10.1016/S0969-4765(13)70180-2</mixed-citation></ref><ref id="scirp.52453-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, D., Zuo, W.M. and Yue, F. (2012) A Comparative Study of Palmprint Recognition Algorithms. ACM Computing Surveys, 44, 1-37. http://dx.doi.org/10.1145/2071389.2071391</mixed-citation></ref><ref id="scirp.52453-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Pan, X. and Ruan, Q.Q. (2009) Palmprint Recognition Using Gabor-Based Local Invariant Features. Neurocomputing, 72, 2040-2045. http://dx.doi.org/10.1016/j.neucom.2008.11.019</mixed-citation></ref><ref id="scirp.52453-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Li, W., Zhang, D. and Xu, Z. (2002) Palmprint Identification Based on Fourier Transform. Journal of Software, 13, 95-97.</mixed-citation></ref></ref-list></back></article>