Decoding Substitution Ciphers by Means of Word Matching with Application to OCR.
Identifieur interne : 000113 ( Ncbi/Curation ); précédent : 000112; suivant : 000114Decoding Substitution Ciphers by Means of Word Matching with Application to OCR.
Auteurs : G. Nagy [États-Unis] ; S. Seth ; K. EinspahrSource :
- IEEE transactions on pattern analysis and machine intelligence [ 0162-8828 ] ; 1987.
Abstract
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.
PubMed: 21869433
Links toward previous steps (curation, corpus...)
- to stream PubMed, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000089
- to stream PubMed, to step Curation: Pour aller vers cette notice dans l'étape Curation :000089
- to stream PubMed, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000089
- to stream Ncbi, to step Merge: Pour aller vers cette notice dans l'étape Curation :000113
Links to Exploration step
pubmed:21869433Le document en format XML
<record><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></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></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Ncbi/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000113 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Ncbi/Curation/biblio.hfd -nk 000113 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Ncbi
|étape= Curation
|type= RBID
|clé= pubmed:21869433
|texte= Decoding Substitution Ciphers by Means of Word Matching with Application to OCR.
}}
Pour générer des pages wiki
HfdIndexSelect -h $EXPLOR_AREA/Data/Ncbi/Curation/RBID.i -Sk "pubmed:21869433" \
| HfdSelect -Kh $EXPLOR_AREA/Data/Ncbi/Curation/biblio.hfd \
| NlmPubMed2Wicri -a OcrV1
| This area was generated with Dilib version V0.6.32. |  |