A Study On Improvements for Fingerprint Identification
碩士 === 東吳大學 === 資訊科學系 === 96 === In this paper, we present a fast geometric fingerprint matching based on graph matching principles. We use a representation called K-plets to match local neighborhood minutia, and we use the other presentation called CBFS that is a graph traversal algorithm for conso...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/772hvd |