OcrV1, PascalFrancis, Corpus, bibRecord, 000A85

Character recognition by signature approximation

Identifieur interne : 000A85 ( PascalFrancis/Corpus ); précédent : 000A84; suivant : 000A86

Character recognition by signature approximation

Auteurs : N. Papamarkos ; I. Spiliotis ; A. Zoumadakis

Source :

International journal of pattern recognition and artificial intelligence [ 0218-0014 ] ; 1994.

RBID : Pascal:95-0061795

Descripteurs français

Pascal (Inist)
- Reconnaissance caractère, Reconnaissance forme, Analyse signature, Classification, Critère minimax, Erreur approximation, Programmation linéaire, Fonction rationnelle, OCR, Thresholding, Rational approximation.

English descriptors

KwdEn :
- Approximation error, Character recognition, Classification, Linear programming, Minimax criterion, Pattern recognition, Rational function, Signature analysis.

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

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0218-0014`
A03		`1`		`@0 Int. j. pattern recogn. artif. intell.`
A05				`@2 8`
A06				`@2 5`
A08	`01`	`1`	`ENG`	`@1 Character recognition by signature approximation`
A09	`01`	`1`	`ENG`	`@1 Document image analysis`
A11	`01`	`1`		`@1 PAPAMARKOS (N.)`
A11	`02`	`1`		`@1 SPILIOTIS (I.)`
A11	`03`	`1`		`@1 ZOUMADAKIS (A.)`
A12	`01`	`1`		`@1 BUNKE (H.) @9 ed.`
A12	`02`	`1`		`@1 WANG (P. S. P.) @9 ed.`
A12	`03`	`1`		`@1 BAIRD (H.) @9 ed.`
A14	`01`			`@1 Democritus univ. Thrace, dep. electrical eng. @2 67100 Xanthi @3 GRC`
A15	`01`			`@1 Univ. Bern @2 Bern @3 CHE @Z 1 aut.`
A20				`@1 1171-1187`
A21				`@1 1994`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 22088 @5 354000057559550090`
A44				`@0 0000`
A45				`@0 20 ref.`
A47	`01`	`1`		`@0 95-0061795`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 International journal of pattern recognition and artificial intelligence`
A66	`01`			`@0 SGP`
C01	`01`		`ENG`	@0 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
C02	`01`	`X`		`@0 001D02C03`
C03	`01`	`X`	`FRE`	`@0 Reconnaissance caractère @5 68`
C03	`01`	`X`	`ENG`	`@0 Character recognition @5 68`
C03	`01`	`X`	`SPA`	`@0 Reconocimiento carácter @5 68`
C03	`02`	`X`	`FRE`	`@0 Reconnaissance forme @5 69`
C03	`02`	`X`	`ENG`	`@0 Pattern recognition @5 69`
C03	`02`	`X`	`GER`	`@0 Mustererkennung @5 69`
C03	`02`	`X`	`SPA`	`@0 Reconocimiento patrón @5 69`
C03	`03`	`X`	`FRE`	`@0 Analyse signature @5 70`
C03	`03`	`X`	`ENG`	`@0 Signature analysis @5 70`
C03	`03`	`X`	`SPA`	`@0 Análisis firma @5 70`
C03	`04`	`X`	`FRE`	`@0 Classification @5 71`
C03	`04`	`X`	`ENG`	`@0 Classification @5 71`
C03	`04`	`X`	`GER`	`@0 Klassifizierung @5 71`
C03	`04`	`X`	`SPA`	`@0 Clasificación @5 71`
C03	`05`	`X`	`FRE`	`@0 Critère minimax @5 72`
C03	`05`	`X`	`ENG`	`@0 Minimax criterion @5 72`
C03	`05`	`X`	`SPA`	`@0 Criterio minimax @5 72`
C03	`06`	`X`	`FRE`	`@0 Erreur approximation @5 73`
C03	`06`	`X`	`ENG`	`@0 Approximation error @5 73`
C03	`06`	`X`	`SPA`	`@0 Error aproximación @5 73`
C03	`07`	`X`	`FRE`	`@0 Programmation linéaire @5 74`
C03	`07`	`X`	`ENG`	`@0 Linear programming @5 74`
C03	`07`	`X`	`SPA`	`@0 Programación lineal @5 74`
C03	`08`	`X`	`FRE`	`@0 Fonction rationnelle @5 75`
C03	`08`	`X`	`ENG`	`@0 Rational function @5 75`
C03	`08`	`X`	`SPA`	`@0 Función racional @5 75`
C03	`09`	`X`	`FRE`	`@0 OCR @4 INC @5 90`
C03	`10`	`X`	`FRE`	`@0 Thresholding @4 INC @5 91`
C03	`11`	`X`	`FRE`	`@0 Rational approximation @4 INC @5 92`
N21				`@1 046`

Format Inist (serveur)

NO :	PASCAL 95-0061795 INIST
ET :	Character recognition by signature approximation
AU :	PAPAMARKOS (N.); SPILIOTIS (I.); ZOUMADAKIS (A.); BUNKE (H.); WANG (P. S. P.); BAIRD (H.)
AF :	Democritus univ. Thrace, dep. electrical eng./67100 Xanthi/Grèce; Univ. Bern/Bern/Suisse (1 aut.)
DT :	Publication en série; Niveau analytique
SO :	International journal of pattern recognition and artificial intelligence; ISSN 0218-0014; Singapour; Da. 1994; Vol. 8; No. 5; Pp. 1171-1187; Bibl. 20 ref.
LA :	Anglais
EA :	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
CC :	001D02C03
FD :	Reconnaissance caractère; Reconnaissance forme; Analyse signature; Classification; Critère minimax; Erreur approximation; Programmation linéaire; Fonction rationnelle; OCR; Thresholding; Rational approximation
ED :	Character recognition; Pattern recognition; Signature analysis; Classification; Minimax criterion; Approximation error; Linear programming; Rational function
GD :	Mustererkennung; Klassifizierung
SD :	Reconocimiento carácter; Reconocimiento patrón; Análisis firma; Clasificación; Criterio minimax; Error aproximación; Programación lineal; Función racional
LO :	INIST-22088.354000057559550090
ID :	95-0061795

Links to Exploration step

Pascal:95-0061795

Le 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><inist:fA14 i1="01"><s1>Democritus univ. Thrace, dep. electrical eng.</s1>
<s2>67100 Xanthi</s2>
<s3>GRC</s3>
</inist:fA14>
</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>
</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><inist:fA14 i1="01"><s1>Democritus univ. Thrace, dep. electrical eng.</s1>
<s2>67100 Xanthi</s2>
<s3>GRC</s3>
</inist:fA14>
</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>
</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>
<server><NO>PASCAL 95-0061795 INIST</NO>
<ET>Character recognition by signature approximation</ET>
<AU>PAPAMARKOS (N.); SPILIOTIS (I.); ZOUMADAKIS (A.); BUNKE (H.); WANG (P. S. P.); BAIRD (H.)</AU>
<AF>Democritus univ. Thrace, dep. electrical eng./67100 Xanthi/Grèce; Univ. Bern/Bern/Suisse (1 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>International journal of pattern recognition and artificial intelligence; ISSN 0218-0014; Singapour; Da. 1994; Vol. 8; No. 5; Pp. 1171-1187; Bibl. 20 ref.</SO>
<LA>Anglais</LA>
<EA>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</EA>
<CC>001D02C03</CC>
<FD>Reconnaissance caractère; Reconnaissance forme; Analyse signature; Classification; Critère minimax; Erreur approximation; Programmation linéaire; Fonction rationnelle; OCR; Thresholding; Rational approximation</FD>
<ED>Character recognition; Pattern recognition; Signature analysis; Classification; Minimax criterion; Approximation error; Linear programming; Rational function</ED>
<GD>Mustererkennung; Klassifizierung</GD>
<SD>Reconocimiento carácter; Reconocimiento patrón; Análisis firma; Clasificación; Criterio minimax; Error aproximación; Programación lineal; Función racional</SD>
<LO>INIST-22088.354000057559550090</LO>
<ID>95-0061795</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A85 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000A85 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    OcrV1
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:95-0061795
   |texte=   Character recognition by signature approximation
}}

This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 16:53:45 2017. Site generation: Mon Mar 11 23:15:16 2024

	Serveur d'exploration sur l'OCR
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur l'OCR

Character recognition by signature approximation

Character recognition by signature approximation

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri