Chinese Signature Research Articles

Chinese signature verification: The topological approach and the waveform matching approach

Two approaches are proposed for Chinese signature verification in this article. The topological approach, which extracts the static topological features of the Chinese signature characters such as blocks, holes, segments, end-points, and cross-points, is first presented. Based on this approach, an automatic Chinese signature verification system is designed and implemented. Experimental results demonstrate a recognition rate of 94%. Two new algorithms for this approach are proposed in this article. The waveform matching approach to measure the similarity of waveforms is then presented. This approach cuts the waveforms into a string of valley and peak (V-P-V) units and calculates the distance between two strings by using insertion, deletion, and substitution to obtain the similarity of two waveforms. The time complexity of this algorithm is O(n × m), where n and m are the unit numbers of the two waveform strings, respectively. The V-P-V algorithm used in a Chinese signature verification system achieves a recognition rate of 90%. © 1999 John Wiley & Sons, Inc. Int J Imaging Syst Technol 10, 355–362, 1999

A new approach to the verification of chinese signatures with variant orientations and scales using relaxation and state-space search methods

A signature verification system usually consists of a learning stage and a testing stage. Always an assumption is made by most previous studies that the variations in orientation and scale of the signatures done by the signer in the two stages should be minimized, otherwise, errors might occur. In this study, we propose a new method to solve the problem. By treating each signature as a point pattern consisting of a set of critical points, the relaxation method proposed by reference (15) is extended first, and next the best matching pairs are found using the state-space search method like the A∗ algorithm. According to the matching results, an affine transformation matrix is computed finally. By applying the matrix to the signatures, the variation problem mentioned above is thus solved. Experimental results are given to show the superiority of the method.

Optimal weight assignment for a Chinese signature file

The performance of a character-based Chinese text retrieval scheme (the combined scheme) is investigated. In the scheme both the monogram keys (singleton characters) and bigram keys (consecutive character pairs) are encoded into document signatures such that half of the bits in every signature are set. For disyllabic queries, an analytical expression of the false hit rate that accounts for both random false hits and adjacency false hits is proposed. Then optimal monogram and bigram weight assignments together with the corresponding minimal false hit rate are derived in terms of signature length, storage overhead of the combined scheme, and the occurrence frequency and the association value of a disyllabic query. The theoretical predictions of the optimal weight assignments and the minimal false hit rate are tested and verified in experiments using a real Chinese corpus for disyllabic queries of different association values. Satisfactory agreement between the experimental results and theoretical predictions is found.

Optimal weight assignment for a chinese signature file

Optimal weight assignment for a chinese signature file

Paris, Pretoria, Peking … Proliferation?

“The absence of French, South African and Communist Chinese signatures from the Nuclear Non-Proliferation Treaty does not immediately upset the Treaty…. We are prone to exaggerate the indifference of such nations to a further spread of nuclear weapons. Yet to demonstrate that fears are groundless does not terminate their political significance.” George Quester is associate professor of government at Cornell University.