<?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">OPJ</journal-id><journal-title-group><journal-title>Optics and Photonics Journal</journal-title></journal-title-group><issn pub-type="epub">2160-8881</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/opj.2017.78B009</article-id><article-id pub-id-type="publisher-id">OPJ-78284</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Chemistry&amp;Materials Science</subject><subject> Engineering</subject><subject> Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  An Improved Algorithm for Pseduo-Jacobi-Fourier Moments
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Guleng</surname><given-names>Amu</given-names></name><xref ref-type="aff" rid="aff1"><sub>1</sub></xref></contrib></contrib-group><aff id="aff1"><label>1</label><addr-line>Department of Physics, Inner Mongolia Agricultural University, Huhhot, China</addr-line></aff><author-notes><corresp id="cor1">* E-mail:</corresp></author-notes><pub-date pub-type="epub"><day>10</day><month>08</month><year>2017</year></pub-date><volume>07</volume><issue>08</issue><fpage>68</fpage><lpage>74</lpage><history><date date-type="received"><day>May</day>	<month>27,</month>	<year>2017</year></date><date date-type="rev-recd"><day>Accepted:</day>	<month>August</month>	<year>7,</year>	</date><date date-type="accepted"><day>August</day>	<month>10,</month>	<year>2017</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>
 
 
  
    Image moments have been used in many research fields of the engineering. However, the related computation of invariant moments mostly adopted the polar coordinate system, which not only increase the computational load, but also cause large quantized error. To solve this problem, an improved algorithm to compute Pseudo-Jacobi-Fourier moments in the Cartesian coordinate system is proposed in this paper. The experimental results show that the reconstructed image with improved PJFM’s has more advantages than polar coordinate system, such as more information, fewer moments, less time consuming. And the recognition rate of the microscopic images of 8 helminth eggs was also higher than in polar coordinate system. 
  
 
</p></abstract><kwd-group><kwd>Invariant Moments</kwd><kwd> Cartesian Coordinate System</kwd><kwd> Image Reconstruction</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Image moments, because of their powerful description of the image content, have been used in many research fields of the engineering, such as image pro- cessing [<xref ref-type="bibr" rid="scirp.78284-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.78284-ref2">2</xref>], pattern recognition and machine vision [<xref ref-type="bibr" rid="scirp.78284-ref3">3</xref>]. The first introduction of image moments for classification purposes was performed by Hu [<xref ref-type="bibr" rid="scirp.78284-ref4">4</xref>], and then developed into other families, such as Legendre [<xref ref-type="bibr" rid="scirp.78284-ref5">5</xref>], Zernike [<xref ref-type="bibr" rid="scirp.78284-ref6">6</xref>], Pseudo- Zernike [<xref ref-type="bibr" rid="scirp.78284-ref7">7</xref>], Fourier-Mellin [<xref ref-type="bibr" rid="scirp.78284-ref8">8</xref>], Tchebichef [<xref ref-type="bibr" rid="scirp.78284-ref9">9</xref>], Krawtchouk [<xref ref-type="bibr" rid="scirp.78284-ref10">10</xref>], Pseudo-Jaco- bi-Fourier[<xref ref-type="bibr" rid="scirp.78284-ref11">11</xref>] moment. These moments can be used as image descriptors after an appropriate normalization procedure in order to achieve translation, scale and rotation invariance. However, the related computation for these moments mostly adopted the polar coordinate system, which not only increase the computational load, but also cause large quantized error [<xref ref-type="bibr" rid="scirp.78284-ref12">12</xref>] [<xref ref-type="bibr" rid="scirp.78284-ref13">13</xref>]. To solve this problem, an improved algorithm to compute Pseudo-Jacobi-Fourier moments in the Cartesian coordinate system is proposed in this paper. This improved algorithm is applied to classify the microscopic images of helminth eggs by using Euclidean distance classifier [<xref ref-type="bibr" rid="scirp.78284-ref14">14</xref>], and the recognition rate is 92.2%.</p></sec><sec id="s2"><title>2. Improved Algorithm for Pseduo-Jacobi-Fourier Moments</title><sec id="s2_1"><title>2.1. Definition of Pseduo-Jacobi-Fourier Moments</title><p>Bhatia and Wolf have shown [<xref ref-type="bibr" rid="scirp.78284-ref15">15</xref>] that a polynomial that is invariant in form for any rotation of axes about the origin must be of the form</p><disp-formula id="scirp.78284-formula50"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x2.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x3.png" xlink:type="simple"/></inline-formula> is a radial polynomial in <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x4.png" xlink:type="simple"/></inline-formula> of degree<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x5.png" xlink:type="simple"/></inline-formula>. We now defined a new set of orthogonal moments, Pseudo-Jacobi <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x6.png" xlink:type="simple"/></inline-formula>-Fourier Moments (PJFM’s), based on Jacobi polynomials. In the polar coordinates<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x7.png" xlink:type="simple"/></inline-formula>, radial Jacobi polynomials <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x8.png" xlink:type="simple"/></inline-formula> are expressed as</p><disp-formula id="scirp.78284-formula51"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x9.png"  xlink:type="simple"/></disp-formula><p>where the function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x10.png" xlink:type="simple"/></inline-formula> is orthogonal over the range [0,1]</p><disp-formula id="scirp.78284-formula52"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x11.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x12.png" xlink:type="simple"/></inline-formula> is Kronecker symbol, and</p><disp-formula id="scirp.78284-formula53"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x13.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.78284-formula54"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x14.png"  xlink:type="simple"/></disp-formula><p>The radial polynomials of OFMM’s, CHM’s and ZM’s belong to Jacobi polynomials with <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x15.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x16.png" xlink:type="simple"/></inline-formula> respectively. When <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x17.png" xlink:type="simple"/></inline-formula>, radial Jacobi polynomials become<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x18.png" xlink:type="simple"/></inline-formula>, so Pseudo-Jacobi polynomials <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x19.png" xlink:type="simple"/></inline-formula> are defined as</p><disp-formula id="scirp.78284-formula55"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x20.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.78284-formula56"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x21.png"  xlink:type="simple"/></disp-formula><p>So a new set of orthogonal polynomial function<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x22.png" xlink:type="simple"/></inline-formula>, which consists of radial function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x23.png" xlink:type="simple"/></inline-formula> and angular function<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x24.png" xlink:type="simple"/></inline-formula>, is obtained as</p><disp-formula id="scirp.78284-formula57"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x25.png"  xlink:type="simple"/></disp-formula><p>obviously, the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x26.png" xlink:type="simple"/></inline-formula> is orthogonal over the range [0, 1].</p><disp-formula id="scirp.78284-formula58"><label>(9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x27.png"  xlink:type="simple"/></disp-formula><p>According to the orthogonal theory, the image function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x28.png" xlink:type="simple"/></inline-formula> can be written as an infinite series expansion in terms of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x29.png" xlink:type="simple"/></inline-formula></p><disp-formula id="scirp.78284-formula59"><label>(10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x30.png"  xlink:type="simple"/></disp-formula><p>where</p><disp-formula id="scirp.78284-formula60"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x31.png"  xlink:type="simple"/></disp-formula><p>then <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x32.png" xlink:type="simple"/></inline-formula> is defined as Pseudo-Jacobi-Fourier Moments (PJFM’s), and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x33.png" xlink:type="simple"/></inline-formula> is the maximum size of the objects that can be encountered in a particular application.</p><p>Actually, most of the images are defined in the Cartesian coordinate system. When calculating PJFM’s, the images need to be converted to polar coordinates, so may cause some problems: 1) Quantization error is introduced into the calculation of PJFM’s, which increases calculating amount and additional noise; 2) In polar coordinates, the discrete points near from the origin are more than those in the Cartesian coordinate system, which lead to information redundancy; 3) Far from the origin, the scattered points in the polar coordinate system are less than those in the Cartesian coordinate system, which lead to information loss. Therefore, an improved algorithm for computing PJFM’s Cartesian coordinate system is developed in this paper.</p></sec><sec id="s2_2"><title>2.2. Improved Algorithm for Pseduo-Jacobi-Fourier Moments</title><p>When calculating PJFM’s in the Cartesian coordinates, the image should first be normalized into the unit circle, and the integral region of Equation (11) as shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p><p>Substitute Equation (6) into Equation (8)</p><disp-formula id="scirp.78284-formula61"><label>(12)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x34.png"  xlink:type="simple"/></disp-formula><p>where</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> The integral region of PJFM</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/78284x35.png"/></fig><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x36.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x37.png" xlink:type="simple"/></inline-formula> (13)</p><p>Substitute Equation (13) and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x38.png" xlink:type="simple"/></inline-formula> into Equation (12)</p><disp-formula id="scirp.78284-formula62"><label>(14)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x39.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.78284-formula63"><label>(15)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x40.png"  xlink:type="simple"/></disp-formula><p><xref ref-type="fig" rid="fig1">Figure 1</xref> shows that s1 - s2 is not the part of the image and there is no pixel over it, Equation (15) can be written as</p><disp-formula id="scirp.78284-formula64"><label>(16)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x41.png"  xlink:type="simple"/></disp-formula><p>So Equation (16) is the general formula for calculating PJFM’s in Cartesian coordinate system.</p></sec><sec id="s2_3"><title>2.3. Image Reconstruction Using Improved Algorithm</title><p>Image reconstruction can be used as an effective means to evaluate the quality of feature extraction. The more PJFM’s used to reconstruct images, the closer to the original image. An image of capital E, shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>, is reconstructed by Equation (17).</p><disp-formula id="scirp.78284-formula65"><label>(17)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x42.png"  xlink:type="simple"/></disp-formula><p>The four corners of the reconstructed image are black and some pixels have been lost in the <xref ref-type="fig" rid="fig3">Figure 3</xref>. But the black area of the four corners of the reconstructed image is shrinking with the increase of N and M, and the edge information is well preserved in the <xref ref-type="fig" rid="fig4">Figure 4</xref>. <xref ref-type="fig" rid="fig4">Figure 4</xref> also shows that E is differentiated well when N = M = 6 instead of N = M = 10 as in <xref ref-type="fig" rid="fig3">Figure 3</xref>.</p><p>As for computation time, reconstruction time in the Cartesian coordinate system is much shorter than the polar coordinates system, shown in <xref ref-type="table" rid="table1">Table 1</xref>.</p><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> The original image of E</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/78284x43.png"/></fig><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Reconstruction time comparison</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >N = M</th><th align="center" valign="middle" >1</th><th align="center" valign="middle" >5</th><th align="center" valign="middle" >10</th><th align="center" valign="middle" >15</th><th align="center" valign="middle" >20</th></tr></thead><tr><td align="center" valign="middle" >Cartesian (s)</td><td align="center" valign="middle" >0.5</td><td align="center" valign="middle" >1.3</td><td align="center" valign="middle" >3.8</td><td align="center" valign="middle" >5.6</td><td align="center" valign="middle" >7.4</td></tr><tr><td align="center" valign="middle" >Polar (s)</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >36</td><td align="center" valign="middle" >76</td><td align="center" valign="middle" >134</td><td align="center" valign="middle" >360</td></tr></tbody></table></table-wrap><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Reconstructed images in polar coordinates</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/78284x44.png"/></fig><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Reconstructed images in Cartesian coordinates</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/78284x45.png"/></fig></sec><sec id="s2_4"><title>2.4. Image Recognition Using Improved Algorithm</title><p>In order to test the feature extraction performance of the improved PJFM’s, a recognition experiment was done by using microscopic image of 8 kinds of helminth eggs, such as Fasciola hepatica (a), moniezia (b), Hairy ail nematode (c), paramphistomum (d), Nematodirus (e), Dicrocoelium chinensis (f), coccidium (g), Pancreatic Eurytrema (h).</p><p>The training sets consist of 20 different versions from each kind of helminth eggs, including 160 images. Testing sets consist of 307 untrained images from different version of 8 kinds of helminth eggs. <xref ref-type="fig" rid="fig5">Figure 5</xref> gives a multi-distorted image of the microscopic image of some helminth eggs in a testing set.</p><p>Choosing N = M = 8, the image feature extracted respectively by using Equation (16) in Cartesian coordinate system and Equation (11) in polar coordinate system, then the target objects were recognized by the minimum average distance rules . Euclidean distances are calculated by Equation (18), and the result is shown in <xref ref-type="table" rid="table2">Table 2</xref>.</p><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> Part of the image of the experimental samples: (a) Fasciola hepatica; (b) moniezia; (c) Hairy ail nematode; (d) paramphistomum; (e) Nematodirus; (f) Dicrocoelium chinensis; (g) coccidium; (h) Pancreatic Eurytrema</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/78284x46.png"/></fig><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> Recognition result of parasite egg microscopic image</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Types</th><th align="center" valign="middle" >(a)</th><th align="center" valign="middle" >(b)</th><th align="center" valign="middle" >(c)</th><th align="center" valign="middle" >(d)</th><th align="center" valign="middle" >(e)</th><th align="center" valign="middle" >(f)</th><th align="center" valign="middle" >(g)</th><th align="center" valign="middle" >(h)</th><th align="center" valign="middle" ></th></tr></thead><tr><td align="center" valign="middle" >Sample</td><td align="center" valign="middle" >18</td><td align="center" valign="middle" >18</td><td align="center" valign="middle" >54</td><td align="center" valign="middle" >49</td><td align="center" valign="middle" >44</td><td align="center" valign="middle" >39</td><td align="center" valign="middle" >20</td><td align="center" valign="middle" >65</td><td align="center" valign="middle" >307</td></tr><tr><td align="center" valign="middle"  rowspan="2"  >Cartesian (%)</td><td align="center" valign="middle" >18</td><td align="center" valign="middle" >17</td><td align="center" valign="middle" >51</td><td align="center" valign="middle" >42</td><td align="center" valign="middle" >44</td><td align="center" valign="middle" >30</td><td align="center" valign="middle" >18</td><td align="center" valign="middle" >63</td><td align="center" valign="middle" >283</td></tr><tr><td align="center" valign="middle" >100</td><td align="center" valign="middle" >94.4</td><td align="center" valign="middle" >94.4</td><td align="center" valign="middle" >85.7</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >76.9</td><td align="center" valign="middle" >90.0</td><td align="center" valign="middle" >96.9</td><td align="center" valign="middle" >92.2</td></tr><tr><td align="center" valign="middle"  rowspan="2"  >Polar (%)</td><td align="center" valign="middle" >16</td><td align="center" valign="middle" >16</td><td align="center" valign="middle" >47</td><td align="center" valign="middle" >39</td><td align="center" valign="middle" >40</td><td align="center" valign="middle" >28</td><td align="center" valign="middle" >17</td><td align="center" valign="middle" >58</td><td align="center" valign="middle" >261</td></tr><tr><td align="center" valign="middle" >88.9</td><td align="center" valign="middle" >88.9</td><td align="center" valign="middle" >87.0</td><td align="center" valign="middle" >79.6</td><td align="center" valign="middle" >90.9</td><td align="center" valign="middle" >71.8</td><td align="center" valign="middle" >85.0</td><td align="center" valign="middle" >89.2</td><td align="center" valign="middle" >85.0</td></tr></tbody></table></table-wrap><disp-formula id="scirp.78284-formula66"><label>(18)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/78284x47.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x48.png" xlink:type="simple"/></inline-formula> is the PJFM of the testing object, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/78284x49.png" xlink:type="simple"/></inline-formula> is the PJFM of the reference object of class i.</p><p>As can be seen from <xref ref-type="table" rid="table2">Table 2</xref>, the total recognition rate of the microscopic images of 8 helminth eggs was 92.2% with improved PJFM’s, 7.2% higher than PJFM’s in polar coordinate system.</p></sec></sec><sec id="s3"><title>3. Conclusion</title><p>An improved algorithm to compute Pseudo-Jacobi-Fourier moments in the Cartesian coordinate system is proposed in this paper. The experimental results show that the reconstructed image with improved PJFM’s has more advantages than polar coordinate system, such as more information, fewer moments, less time consuming. And the recognition rate of the microscopic images of 8 helminth eggs was also higher than in polar coordinate system.</p></sec><sec id="s4"><title>Acknowledgements</title><p>This work was supported by the National Natural Sciences Foundation of China [grant numbers 60967001and 31060337].</p></sec><sec id="s5"><title>Cite this paper</title><p>Amu, G. (2017) An Improved Algorithm for Pseduo-Jacobi- Fourier Moments. Optics and Photonics Journal, 7, 68-74. https://doi.org/10.4236/opj.2017.78B009</p></sec></body><back><ref-list><title>References</title><ref id="scirp.78284-ref1"><label>1</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Lafta</surname><given-names> H.L. and Abbas S.S. </given-names></name>,<etal>et al</etal>. (<year>2013</year>)<article-title>Effectiveness of Extended Invariant Moments in Fingerprint Analysis</article-title><source> Asian Journal of Computer and Information System</source><volume> 1</volume>,<fpage> 78</fpage>-<lpage>89</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.78284-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Mohammand, A. and Qusay, A.M. (2017) Efficient Image Recognition Technique Using Invariant Moments and Principle Component Analysis. Journal of Data Analysis and Information Pro-cessing, 5, 1-10.  
https://doi.org/10.4236/jdaip.2017.51001</mixed-citation></ref><ref id="scirp.78284-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Papakostas, G.A., Karras, D.A., Mertzios, B.G. and Boutalis, Y.S. (2005) An Efficient Feature Extraction Methodology for Computer Vision Applications Using Wavelet Compressed Zernike Mo-ments. International Journal on Graphics, Vision and Image Processing, Wavelets and Their Applications, SI1, 5-15.</mixed-citation></ref><ref id="scirp.78284-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Hu, M.K. (1962) Visual Pattern Recognition by Moment Invariants. IRE Transactions on Information Theory, IT-8, 179-187.</mixed-citation></ref><ref id="scirp.78284-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Mukundan, R. and Ramakrishnan, K.R. (1998) Moment Functions in Image Analysis. World Scientific Publisher, Singapore. https://doi.org/10.1142/3838</mixed-citation></ref><ref id="scirp.78284-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Papakostas, G.A., Boutalis, Y.S., Karras, D.A. and Mertzios, B.G. (2007) A New Class of Zernike Moments for Computer Vision Applications. Information Sciences, 177, 2802-2819. https://doi.org/10.1016/j.ins.2007.01.010</mixed-citation></ref><ref id="scirp.78284-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Almoosa, N.I., Bae, S.H. and Juang, B.H. (2008) Toward Robust Moment Invariants for Image Registration. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2008), 1009-1012.  
https://doi.org/10.1109/ICASSP.2008.4517783</mixed-citation></ref><ref id="scirp.78284-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Papakostas, G.A., Boutalis, Y.S., Karras, D.A. and Mertzios, B.G. (2007) Fast Numerically Stable Computation of Orthogonal Fourier-Mellin Moments. IET Computer Vision, 1, 11-16. https://doi.org/10.1049/iet-cvi:20060130</mixed-citation></ref><ref id="scirp.78284-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Ping, Z.L., Wu, R.G. and Sheng, Y.L. (2002) Describing Image with Che-byshev- Fourier Moments. J. Opt. Soc. Am., 19, 1748-1754.  
https://doi.org/10.1364/JOSAA.19.001748</mixed-citation></ref><ref id="scirp.78284-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Yap, P.T., Paramesran, R. and Ong, S.H. (2003) Image Analysis by Krawtchouk Moments. IEEE Transactions on Image Processing, 12, 1367-1377.  
https://doi.org/10.1109/TIP.2003.818019</mixed-citation></ref><ref id="scirp.78284-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Amu, G.L. and Hasi, S.R. (2004) Invariant Image Analysis by Pseu-do-Jacobi-Fourier Moments. Applied Optics, 43, 2093-2101. https://doi.org/10.1364/AO.43.002093</mixed-citation></ref><ref id="scirp.78284-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Bayraktar, B., Berna, T. and Robinson, J.P. (2007) A Numerical Recipe for Accurate Image Reconstruction from Discrete Orthogonal Mo-ments. Pattern Recognition, 40, 659-669. https://doi.org/10.1016/j.patcog.2006.03.009</mixed-citation></ref><ref id="scirp.78284-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Broumandnia, A. and Shanbehzadeh, J. (2007) Fast Zernike Wavelet Moments for Farsicharacter Recognition. Image and Vision Computing, 25, 717-726.  
https://doi.org/10.1016/j.imavis.2006.05.014</mixed-citation></ref><ref id="scirp.78284-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Juday, R.D. (1993) Optimal Realizable Filters and the Minimum Eu-clidean Distance Principle. Applied Optics, 32, 5100-5111. https://doi.org/10.1364/AO.32.005100</mixed-citation></ref><ref id="scirp.78284-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Bhatia, A.B. and Wolf, E. (1954) On the Circular Polynomials of Zernike and Related Orthogonal Sets. Pro. Cambridge Philos. Soc., 50, 40-48.  
https://doi.org/10.1017/S0305004100029066</mixed-citation></ref></ref-list></back></article>