A metasynthetic approach for segmenting handwritten Chinese character strings

Saved in:
Bibliographic Details
Title: A metasynthetic approach for segmenting handwritten Chinese character strings
Authors: Liang, Zhizhen liangzhizheng@sjtu.edu.cn, Shi, Pengfei1
Source: Pattern Recognition Letters. Jul2005, Vol. 26 Issue 10, p1498-1511. 14p.
Subjects: Chinese character sets (Data processing), Algorithms, Character sets (Data processing), Chinese language -- Data processing
Abstract: Abstract: In this paper, a metasynthetic method is proposed to segment handwritten Chinese character strings. The Viterbi algorithm is firstly applied to search segmentation paths and several rules are used to remove redundant paths. Then a background-thinning method is further adopted to obtain non-linear segmentation paths. If there are not touching characters, a dynamic programming algorithm is applied to merge components. For touching characters, we apply background and foreground information to obtain candidate segmentation paths and the feature vectors are constructed in terms of peripheral features. Then the mixture probabilistic density function whose parameters are obtained by the EM algorithm is used to choose the best segmentation path. Experimental results demonstrate that the proposed scheme effectively segments handwritten Chinese characters and achieves an improvement over previous methods. [Copyright &y& Elsevier]
Copyright of Pattern Recognition Letters is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 17949582
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A metasynthetic approach for segmenting handwritten Chinese character strings
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Liang%2C+Zhizhen%22">Liang, Zhizhen</searchLink><i> liangzhizheng@sjtu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Shi%2C+Pengfei%22">Shi, Pengfei</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Pattern+Recognition+Letters%22">Pattern Recognition Letters</searchLink>. Jul2005, Vol. 26 Issue 10, p1498-1511. 14p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Chinese+character+sets+%28Data+processing%29%22">Chinese character sets (Data processing)</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Character+sets+%28Data+processing%29%22">Character sets (Data processing)</searchLink><br /><searchLink fieldCode="DE" term="%22Chinese+language+--+Data+processing%22">Chinese language -- Data processing</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: In this paper, a metasynthetic method is proposed to segment handwritten Chinese character strings. The Viterbi algorithm is firstly applied to search segmentation paths and several rules are used to remove redundant paths. Then a background-thinning method is further adopted to obtain non-linear segmentation paths. If there are not touching characters, a dynamic programming algorithm is applied to merge components. For touching characters, we apply background and foreground information to obtain candidate segmentation paths and the feature vectors are constructed in terms of peripheral features. Then the mixture probabilistic density function whose parameters are obtained by the EM algorithm is used to choose the best segmentation path. Experimental results demonstrate that the proposed scheme effectively segments handwritten Chinese characters and achieves an improvement over previous methods. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Pattern Recognition Letters is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=17949582
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.patrec.2004.12.001
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 1498
    Subjects:
      – SubjectFull: Chinese character sets (Data processing)
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Character sets (Data processing)
        Type: general
      – SubjectFull: Chinese language -- Data processing
        Type: general
    Titles:
      – TitleFull: A metasynthetic approach for segmenting handwritten Chinese character strings
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Liang, Zhizhen
      – PersonEntity:
          Name:
            NameFull: Shi, Pengfei
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 07
              Text: Jul2005
              Type: published
              Y: 2005
          Identifiers:
            – Type: issn-print
              Value: 01678655
          Numbering:
            – Type: volume
              Value: 26
            – Type: issue
              Value: 10
          Titles:
            – TitleFull: Pattern Recognition Letters
              Type: main
ResultId 1