Locating segmentation regions of connected handwritten digits
Identifieur interne : 002819 ( Istex/Corpus ); précédent : 002818; suivant : 002820Locating segmentation regions of connected handwritten digits
Auteurs : Jianming Hu ; Hong YanSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1998.
Abstract
Abstract: Segmentation of handwritten touching characters is an important research topic in Optical Character Recognition (OCR). Finding the initial candidate segmentation points is the first important step. A method is described to locate the initial candidate segmentation regions based on the boundary analysis of a character string. This method can reduce the redundant searching regions significantly. Therefore, the segmentation reliability can be increased and the segmentation time can be reduced.
Url:
DOI: 10.1007/BFb0033273
Links to Exploration step
ISTEX:E6A24C00D9D5FE1D7F884765FAE1275E9814FFADLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Locating segmentation regions of connected handwritten digits</title><author><name sortKey="Hu, Jianming" sort="Hu, Jianming" uniqKey="Hu J" first="Jianming" last="Hu">Jianming Hu</name><affiliation><mods:affiliation>Department of Electrical Engineering, The University of Sydney, 2006, NSW, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: jianming@ee.usyd.edu.au</mods:affiliation></affiliation></author><author><name sortKey="Yan, Hong" sort="Yan, Hong" uniqKey="Yan H" first="Hong" last="Yan">Hong Yan</name><affiliation><mods:affiliation>Department of Electrical Engineering, The University of Sydney, 2006, NSW, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: yan@ee.usyd.edu.au</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1007/BFb0033273</idno><idno type="url">https://api.istex.fr/document/E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002819</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Locating segmentation regions of connected handwritten digits</title><author><name sortKey="Hu, Jianming" sort="Hu, Jianming" uniqKey="Hu J" first="Jianming" last="Hu">Jianming Hu</name><affiliation><mods:affiliation>Department of Electrical Engineering, The University of Sydney, 2006, NSW, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: jianming@ee.usyd.edu.au</mods:affiliation></affiliation></author><author><name sortKey="Yan, Hong" sort="Yan, Hong" uniqKey="Yan H" first="Hong" last="Yan">Hong Yan</name><affiliation><mods:affiliation>Department of Electrical Engineering, The University of Sydney, 2006, NSW, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: yan@ee.usyd.edu.au</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1998</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD</idno><idno type="DOI">10.1007/BFb0033273</idno><idno type="ChapterID">51</idno><idno type="ChapterID">Chap51</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Segmentation of handwritten touching characters is an important research topic in Optical Character Recognition (OCR). Finding the initial candidate segmentation points is the first important step. A method is described to locate the initial candidate segmentation regions based on the boundary analysis of a character string. This method can reduce the redundant searching regions significantly. Therefore, the segmentation reliability can be increased and the segmentation time can be reduced.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Jianming Hu</name><affiliations><json:string>Department of Electrical Engineering, The University of Sydney, 2006, NSW, Australia</json:string><json:string>E-mail: jianming@ee.usyd.edu.au</json:string></affiliations></json:item><json:item><name>Hong Yan</name><affiliations><json:string>Department of Electrical Engineering, The University of Sydney, 2006, NSW, Australia</json:string><json:string>E-mail: yan@ee.usyd.edu.au</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><abstract>Abstract: Segmentation of handwritten touching characters is an important research topic in Optical Character Recognition (OCR). Finding the initial candidate segmentation points is the first important step. A method is described to locate the initial candidate segmentation regions based on the boundary analysis of a character string. This method can reduce the redundant searching regions significantly. Therefore, the segmentation reliability can be increased and the segmentation time can be reduced.</abstract><qualityIndicators><score>3.362</score><pdfVersion>1.3</pdfVersion><pdfPageSize>440 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>505</abstractCharCount><pdfWordCount>2522</pdfWordCount><pdfCharCount>13892</pdfCharCount><pdfPageCount>8</pdfPageCount><abstractWordCount>70</abstractWordCount></qualityIndicators><title>Locating segmentation regions of connected handwritten digits</title><genre.original><json:string>ReviewPaper</json:string></genre.original><chapterId><json:string>51</json:string><json:string>Chap51</json:string></chapterId><genre><json:string>conference [eBooks]</json:string></genre><serie><editor><json:item><name>G. Goos</name></json:item><json:item><name>J. Hartmanis</name></json:item><json:item><name>J. van Leeuwen</name></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>1998</copyrightDate></serie><host><editor><json:item><name>Adnan Amin</name></json:item><json:item><name>Dov Dori</name></json:item><json:item><name>Pavel Pudil</name></json:item><json:item><name>Herbert Freeman</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Pattern Recognition</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Image Processing and Computer Vision</value></json:item></subject><isbn><json:string>978-3-540-64858-1</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Advances in Pattern Recognition</title><genre.original><json:string>Proceedings</json:string></genre.original><bookId><json:string>3540648585</json:string></bookId><volume>1451</volume><pages><last>515</last><first>508</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>Book Series</json:string></genre><eisbn><json:string>978-3-540-68526-5</json:string></eisbn><copyrightDate>1998</copyrightDate><doi><json:string>10.1007/BFb0033222</json:string></doi></host><publicationDate>1998</publicationDate><copyrightDate>1998</copyrightDate><doi><json:string>10.1007/BFb0033273</json:string></doi><id>E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD</id><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Locating segmentation regions of connected handwritten digits</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>SPRINGER</p></availability><date>1998</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Locating segmentation regions of connected handwritten digits</title><author><persName><forename type="first">Jianming</forename><surname>Hu</surname></persName><email>jianming@ee.usyd.edu.au</email><affiliation>Department of Electrical Engineering, The University of Sydney, 2006, NSW, Australia</affiliation></author><author><persName><forename type="first">Hong</forename><surname>Yan</surname></persName><email>yan@ee.usyd.edu.au</email><affiliation>Department of Electrical Engineering, The University of Sydney, 2006, NSW, Australia</affiliation></author></analytic><monogr><title level="m">Advances in Pattern Recognition</title><title level="m" type="sub">Joint IAPR International Workshops SSPR'98 and SPR'98 Sydney, Australia, August 11–13, 1998 Proceedings</title><idno type="pISBN">978-3-540-64858-1</idno><idno type="eISBN">978-3-540-68526-5</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/BFb0033222</idno><idno type="BookID">3540648585</idno><idno type="BookTitleID">55368</idno><idno type="BookVolumeNumber">1451</idno><idno type="BookChapterCount">113</idno><editor><persName><forename type="first">Adnan</forename><surname>Amin</surname></persName></editor><editor><persName><forename type="first">Dov</forename><surname>Dori</surname></persName></editor><editor><persName><forename type="first">Pavel</forename><surname>Pudil</surname></persName></editor><editor><persName><forename type="first">Herbert</forename><surname>Freeman</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="1998"></date><biblScope unit="volume">1451</biblScope><biblScope unit="page" from="508">508</biblScope><biblScope unit="page" to="515">515</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">G.</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>van Leeuwen</surname></persName></editor><biblScope><date>1998</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesId">558</idno></series><idno type="istex">E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD</idno><idno type="DOI">10.1007/BFb0033273</idno><idno type="ChapterID">51</idno><idno type="ChapterID">Chap51</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1998</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: Segmentation of handwritten touching characters is an important research topic in Optical Character Recognition (OCR). Finding the initial candidate segmentation points is the first important step. A method is described to locate the initial candidate segmentation regions based on the boundary analysis of a character string. This method can reduce the redundant searching regions significantly. Therefore, the segmentation reliability can be increased and the segmentation time can be reduced.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><label>I2203X</label><label>I21017</label><label>I22021</label><item><term>Computer Science</term></item><item><term>Pattern Recognition</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Image Processing and Computer Vision</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1998">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540648585</BookID><BookTitle>Advances in Pattern Recognition</BookTitle><BookSubTitle>Joint IAPR International Workshops SSPR'98 and SPR'98 Sydney, Australia, August 11–13, 1998 Proceedings</BookSubTitle><BookVolumeNumber>1451</BookVolumeNumber><BookDOI>10.1007/BFb0033222</BookDOI><BookTitleID>55368</BookTitleID><BookPrintISBN>978-3-540-64858-1</BookPrintISBN><BookElectronicISBN>978-3-540-68526-5</BookElectronicISBN><BookChapterCount>113</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1998</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I2203X" Priority="1" Type="Secondary">Pattern Recognition</BookSubject><BookSubject Code="I21017" Priority="2" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I22021" Priority="3" Type="Secondary">Image Processing and Computer Vision</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Adnan</GivenName><FamilyName>Amin</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Dov</GivenName><FamilyName>Dori</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Pavel</GivenName><FamilyName>Pudil</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Herbert</GivenName><FamilyName>Freeman</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap51" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>51</ChapterID><ChapterDOI>10.1007/BFb0033273</ChapterDOI><ChapterSequenceNumber>51</ChapterSequenceNumber><ChapterTitle Language="En">Locating segmentation regions of connected handwritten digits</ChapterTitle><ChapterCategory>Poster Papers</ChapterCategory><ChapterFirstPage>508</ChapterFirstPage><ChapterLastPage>515</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1998</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>9</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540648585</BookID><BookTitle>Advances in Pattern Recognition</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Jianming</GivenName><FamilyName>Hu</FamilyName></AuthorName><Contact><Email>jianming@ee.usyd.edu.au</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Hong</GivenName><FamilyName>Yan</FamilyName></AuthorName><Contact><Email>yan@ee.usyd.edu.au</Email></Contact></Author><Affiliation ID="Aff1"><OrgDivision>Department of Electrical Engineering</OrgDivision><OrgName>The University of Sydney</OrgName><OrgAddress><Postcode>2006</Postcode><City>NSW</City><Country>Australia</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Segmentation of handwritten touching characters is an important research topic in Optical Character Recognition (OCR). Finding the initial candidate segmentation points is the first important step. A method is described to locate the initial candidate segmentation regions based on the boundary analysis of a character string. This method can reduce the redundant searching regions significantly. Therefore, the segmentation reliability can be increased and the segmentation time can be reduced.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Locating segmentation regions of connected handwritten digits</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Locating segmentation regions of connected handwritten digits</title></titleInfo><name type="personal"><namePart type="given">Jianming</namePart><namePart type="family">Hu</namePart><affiliation>Department of Electrical Engineering, The University of Sydney, 2006, NSW, Australia</affiliation><affiliation>E-mail: jianming@ee.usyd.edu.au</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Hong</namePart><namePart type="family">Yan</namePart><affiliation>Department of Electrical Engineering, The University of Sydney, 2006, NSW, Australia</affiliation><affiliation>E-mail: yan@ee.usyd.edu.au</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference [eBooks]" displayLabel="ReviewPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">1998</dateIssued><copyrightDate encoding="w3cdtf">1998</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: Segmentation of handwritten touching characters is an important research topic in Optical Character Recognition (OCR). Finding the initial candidate segmentation points is the first important step. A method is described to locate the initial candidate segmentation regions based on the boundary analysis of a character string. This method can reduce the redundant searching regions significantly. Therefore, the segmentation reliability can be increased and the segmentation time can be reduced.</abstract><relatedItem type="host"><titleInfo><title>Advances in Pattern Recognition</title><subTitle>Joint IAPR International Workshops SSPR'98 and SPR'98 Sydney, Australia, August 11–13, 1998 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Adnan</namePart><namePart type="family">Amin</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Dov</namePart><namePart type="family">Dori</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Pavel</namePart><namePart type="family">Pudil</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Herbert</namePart><namePart type="family">Freeman</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="Book Series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">1998</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book Subject Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book Subject Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I2203X">Pattern Recognition</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I22021">Image Processing and Computer Vision</topic></subject><identifier type="DOI">10.1007/BFb0033222</identifier><identifier type="ISBN">978-3-540-64858-1</identifier><identifier type="eISBN">978-3-540-68526-5</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">55368</identifier><identifier type="BookID">3540648585</identifier><identifier type="BookChapterCount">113</identifier><identifier type="BookVolumeNumber">1451</identifier><part><date>1998</date><detail type="volume"><number>1451</number><caption>vol.</caption></detail><extent unit="pages"><start>508</start><end>515</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1998</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">van Leeuwen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">1998</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1998</recordOrigin></recordInfo></relatedItem><identifier type="istex">E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD</identifier><identifier type="DOI">10.1007/BFb0033273</identifier><identifier type="ChapterID">51</identifier><identifier type="ChapterID">Chap51</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1998</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag, 1998</recordOrigin></recordInfo></mods></metadata><enrichments><istex:refBibTEI uri="https://api.istex.fr/document/E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD/enrichments/refBib"><teiHeader></teiHeader><text><front></front><body></body><back><listBibl><biblStruct xml:id="b0"><analytic><title level="a" type="main">A survey of methods and strategies in character segmentation</title><author><persName><forename type="first">R</forename><forename type="middle">G</forename><surname>Casey</surname></persName></author><author><persName><forename type="first">E</forename><surname>Lecolinet</surname></persName></author></analytic><monogr><title level="j">IEEE Trans. Anal. and Mach. Intetl</title><imprint><biblScope unit="volume">18</biblScope><biblScope unit="page" from="690" to="706"></biblScope><date type="published" when="1996"></date></imprint></monogr></biblStruct><biblStruct xml:id="b1"><analytic><title level="a" type="main">Character segmentation in handwritten words -an overview</title><author><persName><forename type="first">Y</forename><surname>Lu</surname></persName></author><author><persName><forename type="first">M</forename><surname>Shridhar</surname></persName></author></analytic><monogr><title level="j">Pattern Recognition</title><imprint><biblScope unit="volume">29</biblScope><biblScope unit="page" from="77" to="96"></biblScope><date type="published" when="1996"></date></imprint></monogr></biblStruct><biblStruct xml:id="b2"><analytic><title level="a" type="main">Recursive segmentation and classification of composite patterns</title><author><persName><forename type="first">R</forename><forename type="middle">G</forename><surname>Casey</surname></persName></author><author><persName><forename type="first">G</forename><surname>Nagy</surname></persName></author></analytic><monogr><title level="m">Proc. Sixth Int'l Conf. Pattern Recognition</title><meeting>. Sixth Int'l Conf. Pattern Recognition</meeting><imprint><date type="published" when="1982"></date><biblScope unit="page" from="1023" to="1026"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b3"><analytic><title level="a" type="main">Recognition of isolated and simply connected handwritten numerals</title><author><persName><forename type="first">M</forename><surname>Shridhar</surname></persName></author><author><persName><forename type="first">A</forename><surname>Badreldin</surname></persName></author></analytic><monogr><title level="j">Pattern Recognition</title><imprint><biblScope unit="volume">19</biblScope><biblScope unit="page" from="1" to="12"></biblScope><date type="published" when="1986"></date></imprint></monogr></biblStruct><biblStruct xml:id="b4"><analytic><title level="a" type="main">Cut classification for segmentation</title><author><persName><forename type="first">T</forename><forename type="middle">A</forename><surname>Bayer</surname></persName></author><author><persName><forename type="first">U</forename><forename type="middle">H G</forename><surname>Kret3el</surname></persName></author></analytic><monogr><title level="m">Proe. Int'l Document Analysis and Recognition</title><imprint><date type="published" when="1993"></date><biblScope unit="page" from="565" to="568"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b5"><analytic><title level="a" type="main">Vertex directed segmentation of handwritten numerals</title><author><persName><forename type="first">J</forename><forename type="middle">M</forename><surname>Westall</surname></persName></author><author><persName><forename type="first">M</forename><forename type="middle">S</forename><surname>Narasimha</surname></persName></author></analytic><monogr><title level="j">Pattern Recognition</title><imprint><biblScope unit="volume">26</biblScope><biblScope unit="page" from="1473" to="1486"></biblScope><date type="published" when="1993"></date></imprint></monogr></biblStruct><biblStruct xml:id="b6"><analytic><title level="a" type="main">Segmentation methods for character recognition: From segmentation to document structure analysis</title><author><persName><forename type="first">H</forename><surname>Fujisawa</surname></persName></author><author><persName><forename type="first">Y</forename><surname>Nakano</surname></persName></author><author><persName><forename type="first">K</forename><surname>Kuriro</surname></persName></author></analytic><monogr><title level="m">Proc. of the IEEE</title><meeting>. of the IEEE</meeting><imprint><date type="published" when="1992"></date><biblScope unit="page" from="1079" to="1092"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b7"><analytic><title level="a" type="main">Segmentation of handwritten digits using contour features</title><author><persName><forename type="first">N</forename><forename type="middle">W</forename><surname>Strathy</surname></persName></author><author><persName><forename type="first">C</forename><forename type="middle">Y</forename><surname>Suen</surname></persName></author><author><persName><forename type="first">A</forename><surname>Krzyzak</surname></persName></author></analytic><monogr><title level="m">Proc. 2nd Int'l Conf. Document Analysis and Recognition</title><meeting>. 2nd Int'l Conf. Document Analysis and Recognition</meeting><imprint><date type="published" when="1993"></date><biblScope unit="page" from="577" to="580"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b8"><analytic><title level="a" type="main">Algorithm for stroke width compensation of handwritten characters</title><author><persName><forename type="first">J</forename><surname>Hu</surname></persName></author><author><persName><forename type="first">D</forename><surname>Yu</surname></persName></author><author><persName><forename type="first">H</forename><surname>Yau</surname></persName></author></analytic><monogr><title level="j">Electronics Letters</title><imprint><biblScope unit="volume">32</biblScope><biblScope unit="page" from="2221" to="2222"></biblScope><date type="published" when="1996"></date></imprint></monogr></biblStruct><biblStruct xml:id="b9"><analytic><title level="a" type="main">An efficient algorithm for smoothing, linearization and detection of structural feature points of binary image contours</title><author><persName><forename type="first">D</forename><surname>Yu</surname></persName></author><author><persName><forename type="first">H</forename><surname>Yah</surname></persName></author></analytic><monogr><title level="j">Pattern Recognition</title><imprint><biblScope unit="volume">30</biblScope><biblScope unit="page" from="57" to="69"></biblScope><date type="published" when="1997"></date></imprint></monogr></biblStruct><biblStruct xml:id="b10"><analytic><title level="a" type="main">A multiple point boundary smoothing algorithm</title><author><persName><forename type="first">J</forename><surname>Hu</surname></persName></author><author><persName><forename type="first">D</forename><surname>Yu</surname></persName></author><author><persName><forename type="first">H</forename><surname>Yah</surname></persName></author></analytic><monogr><title level="j">Pattern Recognition Letters</title><imprint></imprint></monogr><note>accepted</note></biblStruct></listBibl></back></text></istex:refBibTEI></enrichments></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 002819 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002819 | 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:E6A24C00D9D5FE1D7F884765FAE1275E9814FFAD
|texte= Locating segmentation regions of connected handwritten digits
}}
| This area was generated with Dilib version V0.6.32. |  |