A collection of k-matchings of bipartite graph Kn,n with the property thatevery pair of independent edges lies in exactly λ of the k-matchings is called aBIMATCH(n,k,λ)-design. Existences and constructions for vario...A collection of k-matchings of bipartite graph Kn,n with the property thatevery pair of independent edges lies in exactly λ of the k-matchings is called aBIMATCH(n,k,λ)-design. Existences and constructions for various BIMATCH (n,k,λ)designs are given.展开更多
For stroke-order free online multi-stroke charac- ter recognition, stroke-to-stroke correspondence search be- tween an input pattern and a reference pattern plays an im- portant role to deal with the stroke-order vari...For stroke-order free online multi-stroke charac- ter recognition, stroke-to-stroke correspondence search be- tween an input pattern and a reference pattern plays an im- portant role to deal with the stroke-order variation. Although various methods of stroke correspondence have been pro- posed, no comparative study for clarifying the relative su- periority of those methods has been done before. In this pa- per, we firstly review the approaches for solving the stroke- order variation problem. Then, five representative methods of stroke correspondence proposed by different groups, includ- ing cube search （CS）, bipartite weighted matching （BWM）, individual correspondence decision （ICD）, stable marriage （SM）, and deviation-expansion model （DE）, are experimen- tally compared, mainly in regard of recognition accuracy and efficiency. The experimental results on an online Kanji char- acter dataset, showed that 99.17%, 99.17%, 96.37%, 98.54%, and 96.59% were attained by CS, BWM, ICD, SM, and DE, respectively as their recognition rates. Extensive discussions are made on their relative superiorities and practicalities.展开更多
文摘A collection of k-matchings of bipartite graph Kn,n with the property thatevery pair of independent edges lies in exactly λ of the k-matchings is called aBIMATCH(n,k,λ)-design. Existences and constructions for various BIMATCH (n,k,λ)designs are given.
文摘For stroke-order free online multi-stroke charac- ter recognition, stroke-to-stroke correspondence search be- tween an input pattern and a reference pattern plays an im- portant role to deal with the stroke-order variation. Although various methods of stroke correspondence have been pro- posed, no comparative study for clarifying the relative su- periority of those methods has been done before. In this pa- per, we firstly review the approaches for solving the stroke- order variation problem. Then, five representative methods of stroke correspondence proposed by different groups, includ- ing cube search （CS）, bipartite weighted matching （BWM）, individual correspondence decision （ICD）, stable marriage （SM）, and deviation-expansion model （DE）, are experimen- tally compared, mainly in regard of recognition accuracy and efficiency. The experimental results on an online Kanji char- acter dataset, showed that 99.17%, 99.17%, 96.37%, 98.54%, and 96.59% were attained by CS, BWM, ICD, SM, and DE, respectively as their recognition rates. Extensive discussions are made on their relative superiorities and practicalities.
