Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: , a fuzzy bipartite ighted graph model is proposed to solve "ngerprint veri"cation problem. A "ngerprint image is preprocessed "rst to form clusters of feature points, which are called feature point clusters. Tnty-four attributes are extracted for each feature point cluster. The attributes are characterized by fuzzy values. Attributes of an input image to be veri"ed are considered as the set of left nodes in a fuzzy bipartite ighted graph, and the attributes of claimed template "ngerprint image are considered as the set of right nodes in the graph. The "ngerprint veri"cation problem is thus converted into a fuzzy bipartite ighted graph matching problem. A matching algorithm is proposed for the fuzzy bipartite ighted graph model to "nd an optimal matching with a goodness score. Experimental results reveal the feasibility of the proposed approach in "ngerprint veri"cation. ( 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
['Kuo Chin Fan', 'Cheng Wen Liu', 'Yuan Kai Wang']
I am writing a research paper on a idea A randomized approach with geometric constraints to fingerprint verification
[{"from": "human", "value": "I am writing a research paper on a idea A randomized approach with geometric constraints to fingerprint verification"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: , a fuzzy bipartite ighted graph model is proposed to solve \"ngerprint veri\"cation problem. A \"ngerprint image is preprocessed \"rst to form clusters of feature points, which are called feature point clusters. Tnty-four attributes are extracted for each feature point cluster. The attributes are characterized by fuzzy values. Attributes of an input image to be veri\"ed are considered as the set of left nodes in a fuzzy bipartite ighted graph, and the attributes of claimed template \"ngerprint image are considered as the set of right nodes in the graph. The \"ngerprint veri\"cation problem is thus converted into a fuzzy bipartite ighted graph matching problem. A matching algorithm is proposed for the fuzzy bipartite ighted graph model to \"nd an optimal matching with a goodness score. Experimental results reveal the feasibility of the proposed approach in \"ngerprint veri\"cation. ( 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved."}]