Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Glyph Based Segmentation Of Chinese Calligraphy Characters In The "Collected Characters" Stele., David A. Mcinnis
Glyph Based Segmentation Of Chinese Calligraphy Characters In The "Collected Characters" Stele., David A. Mcinnis
EWU Masters Thesis Collection
Text character segmentation is the process of detecting the bounding box position of individual characters within a written text document image. The character segmentation problem remains extremely difficult for ancient Chinese calligraphy documents. This paper examines a glyph-based segmentation technique for segmenting Chinese Calligraphy characters in the "Collected Characters". The glyph-based character segmentation pipeline utilizes a combination of well-understood image processing techniques in a novel pipeline which is able to detect Chinese calligraphy characters from ink-blots with a good reliability.
A Practical And Efficient Algorithm For The K-Mismatch Shortest Unique Substring Finding Problem, Daniel Robert Allen
A Practical And Efficient Algorithm For The K-Mismatch Shortest Unique Substring Finding Problem, Daniel Robert Allen
EWU Masters Thesis Collection
This thesis revisits the k-mismatch shortest unique substring (SUS) finding problem and demonstrates that a technique recently presented in the context of solving the k-mismatch average common substring problem can be adapted and combined with parts of the existing solution, resulting in a new algorithm which has expected time complexity of O(n logk n), while maintaining a practical space complexity at O(kn), where n is the string length. When k > 0, which is the hard case, the new proposal significantly improves the any-case O(n2) time complexity of the prior best method for k-mismatch SUS finding. Experimental study …