Character recognition by signature approximation
Identifieur interne : 000914 ( PascalFrancis/Curation ); précédent : 000913; suivant : 000915Character recognition by signature approximation
Auteurs : N. Papamarkos [Grèce] ; I. Spiliotis ; A. ZoumadakisSource :
- International journal of pattern recognition and artificial intelligence [ 0218-0014 ] ; 1994.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Classification.
English descriptors
- KwdEn :
Abstract
This paper describes a new method for character recognition of typewritten text. The proposed approach is based on the approximation of character signatures by rational functions. Specifically, after the preprocessing operation, a separation procedure is applied to each character and its one-dimensional signatures are derived. These signatures are then approximated by rational functions via a linear programming technique and according to the minimax criterion. The values of the approximation errors for each signature are specified as character features. Through this technique only six powerful features are derived for each character. The classification technique employed is simple, adapted to the features selected and is based on features' similarities in combination with the minimum Euclidean distance classifier
pA |
|
---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000A85
Links to Exploration step
Pascal:95-0061795Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Character recognition by signature approximation</title>
<author><name sortKey="Papamarkos, N" sort="Papamarkos, N" uniqKey="Papamarkos N" first="N." last="Papamarkos">N. Papamarkos</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Democritus univ. Thrace, dep. electrical eng.</s1>
<s2>67100 Xanthi</s2>
<s3>GRC</s3>
</inist:fA14>
<country>Grèce</country>
</affiliation>
</author>
<author><name sortKey="Spiliotis, I" sort="Spiliotis, I" uniqKey="Spiliotis I" first="I." last="Spiliotis">I. Spiliotis</name>
</author>
<author><name sortKey="Zoumadakis, A" sort="Zoumadakis, A" uniqKey="Zoumadakis A" first="A." last="Zoumadakis">A. Zoumadakis</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">95-0061795</idno>
<date when="1994">1994</date>
<idno type="stanalyst">PASCAL 95-0061795 INIST</idno>
<idno type="RBID">Pascal:95-0061795</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000A85</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000914</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Character recognition by signature approximation</title>
<author><name sortKey="Papamarkos, N" sort="Papamarkos, N" uniqKey="Papamarkos N" first="N." last="Papamarkos">N. Papamarkos</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Democritus univ. Thrace, dep. electrical eng.</s1>
<s2>67100 Xanthi</s2>
<s3>GRC</s3>
</inist:fA14>
<country>Grèce</country>
</affiliation>
</author>
<author><name sortKey="Spiliotis, I" sort="Spiliotis, I" uniqKey="Spiliotis I" first="I." last="Spiliotis">I. Spiliotis</name>
</author>
<author><name sortKey="Zoumadakis, A" sort="Zoumadakis, A" uniqKey="Zoumadakis A" first="A." last="Zoumadakis">A. Zoumadakis</name>
</author>
</analytic>
<series><title level="j" type="main">International journal of pattern recognition and artificial intelligence</title>
<title level="j" type="abbreviated">Int. j. pattern recogn. artif. intell.</title>
<idno type="ISSN">0218-0014</idno>
<imprint><date when="1994">1994</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">International journal of pattern recognition and artificial intelligence</title>
<title level="j" type="abbreviated">Int. j. pattern recogn. artif. intell.</title>
<idno type="ISSN">0218-0014</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Approximation error</term>
<term>Character recognition</term>
<term>Classification</term>
<term>Linear programming</term>
<term>Minimax criterion</term>
<term>Pattern recognition</term>
<term>Rational function</term>
<term>Signature analysis</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Reconnaissance caractère</term>
<term>Reconnaissance forme</term>
<term>Analyse signature</term>
<term>Classification</term>
<term>Critère minimax</term>
<term>Erreur approximation</term>
<term>Programmation linéaire</term>
<term>Fonction rationnelle</term>
<term>OCR</term>
<term>Thresholding</term>
<term>Rational approximation</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Classification</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper describes a new method for character recognition of typewritten text. The proposed approach is based on the approximation of character signatures by rational functions. Specifically, after the preprocessing operation, a separation procedure is applied to each character and its one-dimensional signatures are derived. These signatures are then approximated by rational functions via a linear programming technique and according to the minimax criterion. The values of the approximation errors for each signature are specified as character features. Through this technique only six powerful features are derived for each character. The classification technique employed is simple, adapted to the features selected and is based on features' similarities in combination with the minimum Euclidean distance classifier</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0218-0014</s0>
</fA01>
<fA03 i2="1"><s0>Int. j. pattern recogn. artif. intell.</s0>
</fA03>
<fA05><s2>8</s2>
</fA05>
<fA06><s2>5</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Character recognition by signature approximation</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Document image analysis</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>PAPAMARKOS (N.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>SPILIOTIS (I.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>ZOUMADAKIS (A.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BUNKE (H.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>WANG (P. S. P.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>BAIRD (H.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Democritus univ. Thrace, dep. electrical eng.</s1>
<s2>67100 Xanthi</s2>
<s3>GRC</s3>
</fA14>
<fA15 i1="01"><s1>Univ. Bern</s1>
<s2>Bern</s2>
<s3>CHE</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA20><s1>1171-1187</s1>
</fA20>
<fA21><s1>1994</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>22088</s2>
<s5>354000057559550090</s5>
</fA43>
<fA44><s0>0000</s0>
</fA44>
<fA45><s0>20 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>95-0061795</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>International journal of pattern recognition and artificial intelligence</s0>
</fA64>
<fA66 i1="01"><s0>SGP</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>This paper describes a new method for character recognition of typewritten text. The proposed approach is based on the approximation of character signatures by rational functions. Specifically, after the preprocessing operation, a separation procedure is applied to each character and its one-dimensional signatures are derived. These signatures are then approximated by rational functions via a linear programming technique and according to the minimax criterion. The values of the approximation errors for each signature are specified as character features. Through this technique only six powerful features are derived for each character. The classification technique employed is simple, adapted to the features selected and is based on features' similarities in combination with the minimum Euclidean distance classifier</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Reconnaissance caractère</s0>
<s5>68</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Character recognition</s0>
<s5>68</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Reconocimiento carácter</s0>
<s5>68</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Reconnaissance forme</s0>
<s5>69</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Pattern recognition</s0>
<s5>69</s5>
</fC03>
<fC03 i1="02" i2="X" l="GER"><s0>Mustererkennung</s0>
<s5>69</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Reconocimiento patrón</s0>
<s5>69</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Analyse signature</s0>
<s5>70</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Signature analysis</s0>
<s5>70</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Análisis firma</s0>
<s5>70</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Classification</s0>
<s5>71</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Classification</s0>
<s5>71</s5>
</fC03>
<fC03 i1="04" i2="X" l="GER"><s0>Klassifizierung</s0>
<s5>71</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Clasificación</s0>
<s5>71</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Critère minimax</s0>
<s5>72</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Minimax criterion</s0>
<s5>72</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Criterio minimax</s0>
<s5>72</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Erreur approximation</s0>
<s5>73</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Approximation error</s0>
<s5>73</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Error aproximación</s0>
<s5>73</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Programmation linéaire</s0>
<s5>74</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Linear programming</s0>
<s5>74</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Programación lineal</s0>
<s5>74</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Fonction rationnelle</s0>
<s5>75</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Rational function</s0>
<s5>75</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Función racional</s0>
<s5>75</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>OCR</s0>
<s4>INC</s4>
<s5>90</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Thresholding</s0>
<s4>INC</s4>
<s5>91</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Rational approximation</s0>
<s4>INC</s4>
<s5>92</s5>
</fC03>
<fN21><s1>046</s1>
</fN21>
</pA>
</standard>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000914 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000914 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= OcrV1 |flux= PascalFrancis |étape= Curation |type= RBID |clé= Pascal:95-0061795 |texte= Character recognition by signature approximation }}
This area was generated with Dilib version V0.6.32. |