Efficient Signature Pattern Generation by Using Latticed Bounding Box
暂无分享,去创建一个
According to the growth of users' needs for security and human-machine interaction, many automated user verification method have been developed based on biometrics. One of the representative methods among them is on-line signature recognition. But, the previous on-line signature recognition methods require too much complex processing so that it is not well suited for the simple and fast processing application. In this paper, we deals with efficient signature pattern generation method by using the relatively adjustable latticed bounding box to make more efficient signature recognition for various human-machine interactions.
[1] Anil K. Jain,et al. On-line signature verification, , 2002, Pattern Recognit..
[2] Dae-Jong Lee,et al. On-line Signature Verification using Segment Matching and LDA Method , 2007 .
[3] Raffaele Giancarlo,et al. The Boyer-Moore-Galil String Searching Strategies Revisited , 1986, SIAM J. Comput..
[4] David Gries,et al. K-M-P String Matching Revisited , 1997, Inf. Process. Lett..