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.

Decoding substitution ciphers by means of word matching with application to OCR

Identifieur interne : 003B71 ( Main/Curation ); précédent : 003B70; suivant : 003B72

Decoding substitution ciphers by means of word matching with application to OCR

Auteurs : George Nagy (informaticien) [États-Unis] ; SHARAD SETH ; K. Einspahr

Source :

RBID : Pascal:88-0220117

Descripteurs français

English descriptors


Links toward previous steps (curation, corpus...)


Links to Exploration step

Pascal:88-0220117

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">Decoding substitution ciphers by means of word matching with application to OCR</title>
<author>
<name sortKey="Nagy, G" sort="Nagy, G" uniqKey="Nagy G" first="G." last="Nagy">George Nagy (informaticien)</name>
<affiliation>
<country>États-Unis</country>
<placeName>
<settlement type="city">Troy (New York</settlement>
<region type="state">État de New York</region>
</placeName>
<orgName type="lab" n="5">Institut polytechnique Rensselaer</orgName>
</affiliation>
</author>
<author>
<name sortKey="Sharad Seth" sort="Sharad Seth" uniqKey="Sharad Seth" last="Sharad Seth">SHARAD SETH</name>
</author>
<author>
<name sortKey="Einspahr, K" sort="Einspahr, K" uniqKey="Einspahr K" first="K." last="Einspahr">K. Einspahr</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">88-0220117</idno>
<date when="1987">1987</date>
<idno type="stanalyst">PASCAL 88-0220117 INIST</idno>
<idno type="RBID">Pascal:88-0220117</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C14</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000788</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000B89</idno>
<idno type="wicri:doubleKey">0162-8828:1987:Nagy G:decoding:substitution:ciphers</idno>
<idno type="wicri:Area/Main/Merge">003D68</idno>
<idno type="wicri:source">PubMed</idno>
<idno type="RBID">pubmed:21869433</idno>
<idno type="wicri:Area/PubMed/Corpus">000089</idno>
<idno type="wicri:Area/PubMed/Curation">000089</idno>
<idno type="wicri:Area/PubMed/Checkpoint">000089</idno>
<idno type="wicri:Area/Ncbi/Merge">000113</idno>
<idno type="wicri:Area/Ncbi/Curation">000113</idno>
<idno type="wicri:Area/Ncbi/Checkpoint">000113</idno>
<idno type="wicri:doubleKey">0162-8828:1987:Nagy G:decoding:substitution:ciphers</idno>
<idno type="wicri:Area/Main/Merge">003C50</idno>
<idno type="wicri:Area/Main/Curation">003B71</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">Decoding substitution ciphers by means of word matching with application to OCR</title>
<author>
<name sortKey="Nagy, G" sort="Nagy, G" uniqKey="Nagy G" first="G." last="Nagy">George Nagy (informaticien)</name>
<affiliation>
<country>États-Unis</country>
<placeName>
<settlement type="city">Troy (New York</settlement>
<region type="state">État de New York</region>
</placeName>
<orgName type="lab" n="5">Institut polytechnique Rensselaer</orgName>
</affiliation>
</author>
<author>
<name sortKey="Sharad Seth" sort="Sharad Seth" uniqKey="Sharad Seth" last="Sharad Seth">SHARAD SETH</name>
</author>
<author>
<name sortKey="Einspahr, K" sort="Einspahr, K" uniqKey="Einspahr K" first="K." last="Einspahr">K. Einspahr</name>
</author>
</analytic>
<series>
<title level="j" type="main">IEEE transactions on pattern analysis and machine intelligence</title>
<title level="j" type="abbreviated">IEEE trans. pattern anal. mach. intell.</title>
<idno type="ISSN">0162-8828</idno>
<imprint>
<date when="1987">1987</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">IEEE transactions on pattern analysis and machine intelligence</title>
<title level="j" type="abbreviated">IEEE trans. pattern anal. mach. intell.</title>
<idno type="ISSN">0162-8828</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Character recognition</term>
<term>Cryptography</term>
<term>Dictionaries</term>
<term>English</term>
<term>Heuristic method</term>
<term>Search algorithm</term>
<term>Word processing</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Reconnaissance caractère</term>
<term>Traitement texte</term>
<term>Cryptographie</term>
<term>Algorithme recherche</term>
<term>Méthode heuristique</term>
<term>Anglais</term>
<term>Dictionnaire</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr">
<term>Cryptographie</term>
<term>Dictionnaire</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
</TEI>
<double idat="0162-8828:1987:Nagy G:decoding:substitution:ciphers">
<INIST>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">Decoding substitution ciphers by means of word matching with application to OCR</title>
<author>
<name sortKey="Nagy, G" sort="Nagy, G" uniqKey="Nagy G" first="G." last="Nagy">George Nagy (informaticien)</name>
<affiliation>
<country>États-Unis</country>
<placeName>
<settlement type="city">Troy (New York</settlement>
<region type="state">État de New York</region>
</placeName>
<orgName type="lab" n="5">Institut polytechnique Rensselaer</orgName>
</affiliation>
</author>
<author>
<name sortKey="Sharad Seth" sort="Sharad Seth" uniqKey="Sharad Seth" last="Sharad Seth">SHARAD SETH</name>
</author>
<author>
<name sortKey="Einspahr, K" sort="Einspahr, K" uniqKey="Einspahr K" first="K." last="Einspahr">K. Einspahr</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">88-0220117</idno>
<date when="1987">1987</date>
<idno type="stanalyst">PASCAL 88-0220117 INIST</idno>
<idno type="RBID">Pascal:88-0220117</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C14</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000788</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000B89</idno>
<idno type="wicri:doubleKey">0162-8828:1987:Nagy G:decoding:substitution:ciphers</idno>
<idno type="wicri:Area/Main/Merge">003D68</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">Decoding substitution ciphers by means of word matching with application to OCR</title>
<author>
<name sortKey="Nagy, G" sort="Nagy, G" uniqKey="Nagy G" first="G." last="Nagy">George Nagy (informaticien)</name>
<affiliation>
<country>États-Unis</country>
<placeName>
<settlement type="city">Troy (New York</settlement>
<region type="state">État de New York</region>
</placeName>
<orgName type="lab" n="5">Institut polytechnique Rensselaer</orgName>
</affiliation>
</author>
<author>
<name sortKey="Sharad Seth" sort="Sharad Seth" uniqKey="Sharad Seth" last="Sharad Seth">SHARAD SETH</name>
</author>
<author>
<name sortKey="Einspahr, K" sort="Einspahr, K" uniqKey="Einspahr K" first="K." last="Einspahr">K. Einspahr</name>
</author>
</analytic>
<series>
<title level="j" type="main">IEEE transactions on pattern analysis and machine intelligence</title>
<title level="j" type="abbreviated">IEEE trans. pattern anal. mach. intell.</title>
<idno type="ISSN">0162-8828</idno>
<imprint>
<date when="1987">1987</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">IEEE transactions on pattern analysis and machine intelligence</title>
<title level="j" type="abbreviated">IEEE trans. pattern anal. mach. intell.</title>
<idno type="ISSN">0162-8828</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Character recognition</term>
<term>Cryptography</term>
<term>Dictionaries</term>
<term>English</term>
<term>Heuristic method</term>
<term>Search algorithm</term>
<term>Word processing</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Reconnaissance caractère</term>
<term>Traitement texte</term>
<term>Cryptographie</term>
<term>Algorithme recherche</term>
<term>Méthode heuristique</term>
<term>Anglais</term>
<term>Dictionnaire</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr">
<term>Cryptographie</term>
<term>Dictionnaire</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
</TEI>
</INIST>
<PubMed>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Decoding Substitution Ciphers by Means of Word Matching with Application to OCR.</title>
<author>
<name sortKey="Nagy, G" sort="Nagy, G" uniqKey="Nagy G" first="G" last="Nagy">G. Nagy</name>
<affiliation wicri:level="2">
<nlm:affiliation>Department of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY 12180.</nlm:affiliation>
<country xml:lang="fr">États-Unis</country>
<placeName>
<region type="state">État de New York</region>
</placeName>
<wicri:cityArea>Department of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute, Troy</wicri:cityArea>
</affiliation>
</author>
<author>
<name sortKey="Seth, S" sort="Seth, S" uniqKey="Seth S" first="S" last="Seth">S. Seth</name>
</author>
<author>
<name sortKey="Einspahr, K" sort="Einspahr, K" uniqKey="Einspahr K" first="K" last="Einspahr">K. Einspahr</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">PubMed</idno>
<date when="1987">1987</date>
<idno type="RBID">pubmed:21869433</idno>
<idno type="pmid">21869433</idno>
<idno type="wicri:Area/PubMed/Corpus">000089</idno>
<idno type="wicri:Area/PubMed/Curation">000089</idno>
<idno type="wicri:Area/PubMed/Checkpoint">000089</idno>
<idno type="wicri:Area/Ncbi/Merge">000113</idno>
<idno type="wicri:Area/Ncbi/Curation">000113</idno>
<idno type="wicri:Area/Ncbi/Checkpoint">000113</idno>
<idno type="wicri:doubleKey">0162-8828:1987:Nagy G:decoding:substitution:ciphers</idno>
<idno type="wicri:Area/Main/Merge">003C50</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Decoding Substitution Ciphers by Means of Word Matching with Application to OCR.</title>
<author>
<name sortKey="Nagy, G" sort="Nagy, G" uniqKey="Nagy G" first="G" last="Nagy">G. Nagy</name>
<affiliation wicri:level="2">
<nlm:affiliation>Department of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY 12180.</nlm:affiliation>
<country xml:lang="fr">États-Unis</country>
<placeName>
<region type="state">État de New York</region>
</placeName>
<wicri:cityArea>Department of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute, Troy</wicri:cityArea>
</affiliation>
</author>
<author>
<name sortKey="Seth, S" sort="Seth, S" uniqKey="Seth S" first="S" last="Seth">S. Seth</name>
</author>
<author>
<name sortKey="Einspahr, K" sort="Einspahr, K" uniqKey="Einspahr K" first="K" last="Einspahr">K. Einspahr</name>
</author>
</analytic>
<series>
<title level="j">IEEE transactions on pattern analysis and machine intelligence</title>
<idno type="ISSN">0162-8828</idno>
<imprint>
<date when="1987" type="published">1987</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass></textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">A substitution cipher consists of a block of natural language text where each letter of the alphabet has been replaced by a distinct symbol. As a problem in cryptography, the substitution cipher is of limited interest, but it has an important application in optical character recognition. Recent advances render it quite feasible to scan documents with a fairly complex layout and to classify (cluster) the printed characters into distinct groups according to their shape. However, given the immense variety of type styles and forms in current use, it is not possible to assign alphabetical identities to characters of arbitrary size and typeface. This gap can be bridged by solving the equivalent of a substitution cipher problem, thereby opening up the possibility of automatic translation of a scanned document into a standard character code, such as ASCII. Earlier methods relying on letter n-gram frequencies require a substantial amount of ciphertext for accurate n-gram estimates. A dictionary-based approach solves the problem using relatively small ciphertext samples and a dictionary of fewer than 500 words. Our heuristic backtrack algorithm typically visits only a few hundred among the 26! possible nodes on sample texts ranging from 100 to 600 words.</div>
</front>
</TEI>
</PubMed>
</double>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003B71 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 003B71 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    OcrV1
   |flux=    Main
   |étape=   Curation
   |type=    RBID
   |clé=     Pascal:88-0220117
   |texte=   Decoding substitution ciphers by means of word matching with application to OCR
}}

Wicri

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