Bayesian subsequence matching and segmentation
Identifieur interne : 001509 ( Istex/Corpus ); précédent : 001508; suivant : 001510Bayesian subsequence matching and segmentation
Auteurs : George Nagy ; Yihong XuSource :
- Pattern Recognition Letters [ 0167-8655 ] ; 1997.
Abstract
A segmentation method for labeled sequences (signals, text) based on matching the subsequences associated with the underlying symbols has been demonstrated.
Url:
DOI: 10.1016/S0167-8655(97)00100-1
Links to Exploration step
ISTEX:C040C93015950735FF7730032728951C653B82ADLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Bayesian subsequence matching and segmentation</title><author><name sortKey="Nagy, George" sort="Nagy, George" uniqKey="Nagy G" first="George" last="Nagy">George Nagy</name><affiliation><mods:affiliation>Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA</mods:affiliation></affiliation></author><author><name sortKey="Xu, Yihong" sort="Xu, Yihong" uniqKey="Xu Y" first="Yihong" last="Xu">Yihong Xu</name><affiliation><mods:affiliation>Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C040C93015950735FF7730032728951C653B82AD</idno><date when="1997" year="1997">1997</date><idno type="doi">10.1016/S0167-8655(97)00100-1</idno><idno type="url">https://api.istex.fr/document/C040C93015950735FF7730032728951C653B82AD/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001509</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Bayesian subsequence matching and segmentation</title><author><name sortKey="Nagy, George" sort="Nagy, George" uniqKey="Nagy G" first="George" last="Nagy">George Nagy</name><affiliation><mods:affiliation>Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA</mods:affiliation></affiliation></author><author><name sortKey="Xu, Yihong" sort="Xu, Yihong" uniqKey="Xu Y" first="Yihong" last="Xu">Yihong Xu</name><affiliation><mods:affiliation>Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Pattern Recognition Letters</title><title level="j" type="abbrev">PATREC</title><idno type="ISSN">0167-8655</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1997">1997</date><biblScope unit="volume">18</biblScope><biblScope unit="issue">11–13</biblScope><biblScope unit="page" from="1117">1117</biblScope><biblScope unit="page" to="1124">1124</biblScope></imprint><idno type="ISSN">0167-8655</idno></series><idno type="istex">C040C93015950735FF7730032728951C653B82AD</idno><idno type="DOI">10.1016/S0167-8655(97)00100-1</idno><idno type="PII">S0167-8655(97)00100-1</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0167-8655</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">A segmentation method for labeled sequences (signals, text) based on matching the subsequences associated with the underlying symbols has been demonstrated.</div></front></TEI><istex><corpusName>elsevier</corpusName><author><json:item><name>George Nagy</name><affiliations><json:string>Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA</json:string></affiliations></json:item><json:item><name>Yihong Xu</name><affiliations><json:string>Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>Optical character recognition</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Segmentation</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Document image analaysis</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Adaptive classification</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Map conversion</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Template matching</value></json:item></subject><language><json:string>eng</json:string></language><abstract>A segmentation method for labeled sequences (signals, text) based on matching the subsequences associated with the underlying symbols has been demonstrated.</abstract><qualityIndicators><score>3.719</score><pdfVersion>1.2</pdfVersion><pdfPageSize>540 x 712 pts</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>6</keywordCount><abstractCharCount>156</abstractCharCount><pdfWordCount>3467</pdfWordCount><pdfCharCount>19566</pdfCharCount><pdfPageCount>8</pdfPageCount><abstractWordCount>21</abstractWordCount></qualityIndicators><title>Bayesian subsequence matching and segmentation</title><pii><json:string>S0167-8655(97)00100-1</json:string></pii><genre><json:string>research-article</json:string></genre><host><volume>18</volume><pii><json:string>S0167-8655(00)X0038-4</json:string></pii><pages><last>1124</last><first>1117</first></pages><issn><json:string>0167-8655</json:string></issn><issue>11–13</issue><genre><json:string>Journal</json:string></genre><language><json:string>unknown</json:string></language><title>Pattern Recognition Letters</title><publicationDate>1997</publicationDate></host><categories><wos><json:string>COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE</json:string></wos></categories><publicationDate>1997</publicationDate><copyrightDate>1997</copyrightDate><doi><json:string>10.1016/S0167-8655(97)00100-1</json:string></doi><id>C040C93015950735FF7730032728951C653B82AD</id><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/C040C93015950735FF7730032728951C653B82AD/fulltext/pdf</uri></json:item><json:item><original>true</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/C040C93015950735FF7730032728951C653B82AD/fulltext/txt</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/C040C93015950735FF7730032728951C653B82AD/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/C040C93015950735FF7730032728951C653B82AD/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a">Bayesian subsequence matching and segmentation</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>ELSEVIER</publisher><availability><p>ELSEVIER</p></availability><date>1997</date></publicationStmt><notesStmt><note type="content">Fig. 1: From top to bottom: labeled ideal pulse trains; noisy pulse trains; location probabilities estimated from the left and from the right; resulting segmentation left boundaries and right boundaries: longer tick marks indicate collocated boundaries.</note><note type="content">Fig. 2: Left, rectified street name images extracted from the black layer of a digitized map; right, segmentation results for a single street name: left edge of characters (above) and right edge (below), longer tick marks indicate collocated boundaries.</note><note type="content">Fig. 3: Histograms of similarities for pairs of elements corresponding to matching symbols (left) and non-matching symbols (right).</note><note type="content">Fig. 4: Match regions W+ and no-match regions W− at given locations x and y in two sequences X and Y. The similarity si is computed between aligned elements.</note><note type="content">Fig. 5: Example of multiple linear regression for estimating the lengths of the subsequences corresponding to 7 symbols (including intercharacter space) in 22 words.</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a">Bayesian subsequence matching and segmentation</title><author><persName><forename type="first">George</forename><surname>Nagy</surname></persName><affiliation>Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA</affiliation></author><author><persName><forename type="first">Yihong</forename><surname>Xu</surname></persName><affiliation>Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA</affiliation></author></analytic><monogr><title level="j">Pattern Recognition Letters</title><title level="j" type="abbrev">PATREC</title><idno type="pISSN">0167-8655</idno><idno type="PII">S0167-8655(00)X0038-4</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1997"></date><biblScope unit="volume">18</biblScope><biblScope unit="issue">11–13</biblScope><biblScope unit="page" from="1117">1117</biblScope><biblScope unit="page" to="1124">1124</biblScope></imprint></monogr><idno type="istex">C040C93015950735FF7730032728951C653B82AD</idno><idno type="DOI">10.1016/S0167-8655(97)00100-1</idno><idno type="PII">S0167-8655(97)00100-1</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1997</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>A segmentation method for labeled sequences (signals, text) based on matching the subsequences associated with the underlying symbols has been demonstrated.</p></abstract><textClass><keywords scheme="keyword"><list><head>Keywords</head><item><term>Optical character recognition</term></item><item><term>Segmentation</term></item><item><term>Document image analaysis</term></item><item><term>Adaptive classification</term></item><item><term>Map conversion</term></item><item><term>Template matching</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1997">Published</change></revisionDesc></teiHeader></istex:fulltextTEI></fulltext><metadata><istex:metadataXml wicri:clean="Elsevier, elements deleted: ce:floats; body; tail"><istex:xmlDeclaration>version="1.0" encoding="utf-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//ES//DTD journal article DTD version 4.5.2//EN//XML" URI="art452.dtd" name="istex:docType"><istex:entity SYSTEM="gr1" NDATA="IMAGE" name="gr1"></istex:entity><istex:entity SYSTEM="gr2" NDATA="IMAGE" name="gr2"></istex:entity><istex:entity SYSTEM="gr3" NDATA="IMAGE" name="gr3"></istex:entity><istex:entity SYSTEM="gr4" NDATA="IMAGE" name="gr4"></istex:entity><istex:entity SYSTEM="gr5" NDATA="IMAGE" name="gr5"></istex:entity></istex:docType><istex:document><converted-article version="4.5.2" docsubtype="fla"><item-info><jid>PATREC</jid><aid>2198</aid><ce:pii>S0167-8655(97)00100-1</ce:pii><ce:doi>10.1016/S0167-8655(97)00100-1</ce:doi><ce:copyright year="1997" type="full-transfer">Elsevier Science B.V.</ce:copyright></item-info><head><ce:title>Bayesian subsequence matching and segmentation</ce:title><ce:author-group><ce:author><ce:given-name>George</ce:given-name><ce:surname>Nagy</ce:surname><ce:cross-ref refid="CORR1">*</ce:cross-ref></ce:author><ce:author><ce:given-name>Yihong</ce:given-name><ce:surname>Xu</ce:surname></ce:author><ce:affiliation><ce:textfn>Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA</ce:textfn></ce:affiliation><ce:correspondence id="CORR1"><ce:label>*</ce:label><ce:text>Corresponding author. E-mail: nagy@ecse.rpi.edu.</ce:text></ce:correspondence></ce:author-group><ce:abstract><ce:section-title>Abstract</ce:section-title><ce:abstract-sec><ce:simple-para>A segmentation method for labeled sequences (signals, text) based on matching the subsequences associated with the underlying symbols has been demonstrated.</ce:simple-para></ce:abstract-sec></ce:abstract><ce:keywords><ce:section-title>Keywords</ce:section-title><ce:keyword><ce:text>Optical character recognition</ce:text></ce:keyword><ce:keyword><ce:text>Segmentation</ce:text></ce:keyword><ce:keyword><ce:text>Document image analaysis</ce:text></ce:keyword><ce:keyword><ce:text>Adaptive classification</ce:text></ce:keyword><ce:keyword><ce:text>Map conversion</ce:text></ce:keyword><ce:keyword><ce:text>Template matching</ce:text></ce:keyword></ce:keywords></head></converted-article></istex:document></istex:metadataXml><mods version="3.6"><titleInfo><title>Bayesian subsequence matching and segmentation</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Bayesian subsequence matching and segmentation</title></titleInfo><name type="personal"><namePart type="given">George</namePart><namePart type="family">Nagy</namePart><affiliation>Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA</affiliation><description>Corresponding author. E-mail: nagy@ecse.rpi.edu.</description><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Yihong</namePart><namePart type="family">Xu</namePart><affiliation>Rensselaer Polytechnic Institute, Troy, NY 12180-3590, USA</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="Full-length article"></genre><originInfo><publisher>ELSEVIER</publisher><dateIssued encoding="w3cdtf">1997</dateIssued><copyrightDate encoding="w3cdtf">1997</copyrightDate></originInfo><language><languageTerm type="code" authority="iso639-2b">eng</languageTerm><languageTerm type="code" authority="rfc3066">en</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">A segmentation method for labeled sequences (signals, text) based on matching the subsequences associated with the underlying symbols has been demonstrated.</abstract><note type="content">Fig. 1: From top to bottom: labeled ideal pulse trains; noisy pulse trains; location probabilities estimated from the left and from the right; resulting segmentation left boundaries and right boundaries: longer tick marks indicate collocated boundaries.</note><note type="content">Fig. 2: Left, rectified street name images extracted from the black layer of a digitized map; right, segmentation results for a single street name: left edge of characters (above) and right edge (below), longer tick marks indicate collocated boundaries.</note><note type="content">Fig. 3: Histograms of similarities for pairs of elements corresponding to matching symbols (left) and non-matching symbols (right).</note><note type="content">Fig. 4: Match regions W+ and no-match regions W− at given locations x and y in two sequences X and Y. The similarity si is computed between aligned elements.</note><note type="content">Fig. 5: Example of multiple linear regression for estimating the lengths of the subsequences corresponding to 7 symbols (including intercharacter space) in 22 words.</note><subject><genre>Keywords</genre><topic>Optical character recognition</topic><topic>Segmentation</topic><topic>Document image analaysis</topic><topic>Adaptive classification</topic><topic>Map conversion</topic><topic>Template matching</topic></subject><relatedItem type="host"><titleInfo><title>Pattern Recognition Letters</title></titleInfo><titleInfo type="abbreviated"><title>PATREC</title></titleInfo><genre type="Journal">journal</genre><originInfo><dateIssued encoding="w3cdtf">199711</dateIssued></originInfo><identifier type="ISSN">0167-8655</identifier><identifier type="PII">S0167-8655(00)X0038-4</identifier><part><date>199711</date><detail type="volume"><number>18</number><caption>vol.</caption></detail><detail type="issue"><number>11–13</number><caption>no.</caption></detail><extent unit="issue pages"><start>1073</start><end>1426</end></extent><extent unit="pages"><start>1117</start><end>1124</end></extent></part></relatedItem><identifier type="istex">C040C93015950735FF7730032728951C653B82AD</identifier><identifier type="DOI">10.1016/S0167-8655(97)00100-1</identifier><identifier type="PII">S0167-8655(97)00100-1</identifier><accessCondition type="use and reproduction" contentType="">© 1997Elsevier Science B.V.</accessCondition><recordInfo><recordContentSource>ELSEVIER</recordContentSource><recordOrigin>Elsevier Science B.V., ©1997</recordOrigin></recordInfo></mods></metadata><enrichments><istex:catWosTEI uri="https://api.istex.fr/document/C040C93015950735FF7730032728951C653B82AD/enrichments/catWos"><teiHeader><profileDesc><textClass><classCode scheme="WOS">COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE</classCode></textClass></profileDesc></teiHeader></istex:catWosTEI></enrichments><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001509 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001509 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:C040C93015950735FF7730032728951C653B82AD
|texte= Bayesian subsequence matching and segmentation
}}
| This area was generated with Dilib version V0.6.32. |  |