出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：In this paper, implementations of three Hough Transform based fingerprint alignmentalgorithms are analyzed with respect to time complexity on Java Card environment. Threealgorithms are: Local Match Based Approach (LMBA), Discretized Rotation Based Approach(DRBA), and All Possible to Match Based Approach (APMBA). The aim of this paper is topresent the complexity and implementations of existing work of one of the mostly used method offingerprint alignment, in order that the complexity can be simplified or find the best algorithmwith efficient complexity and implementation that can be easily implemented on Java Cardenvironment for match on card. Efficiency involves the accuracy of the implementation, timetaken to perform fingerprint alignment, memory required by the implementation and instructionoperations required and used.
关键词：ingerprint Alignment; Java Card; Hough Transform; Smart Cards; Time Complexity.
