Mlambo, CSShabalala, MBNelwamondo, Fulufhelo V2015-08-192015-08-192015-01Mlambo, C.S, Shabalala, M.B and Nelwamondo, F.V. 2015. Analysis of computational complexity for HT-based fingerprint alignment algorithms on java card environment. In: The Fifth International Conference on Computer Science, Engineering and Applications (CCSEA-2015), Dubai, UAE, 23-24 January 2015http://airccj.org/CSCP/vol5/csit53304.pdfhttp://hdl.handle.net/10204/8027The Fifth International Conference on Computer Science, Engineering and Applications (CCSEA-2015), Dubai, UAE, 23-24 January 2015. Due to copyright restrictions, the attached PDF file only contains the abstract of the full text item. For access to the full text item, please consult the publisher's websiteIn this paper, implementations of three Hough Transform based fingerprint alignment algorithms are analyzed with respect to time complexity on Java Card environment. Three algorithms 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 to present the complexity and implementations of existing work of one of the mostly used method of fingerprint alignment, in order that the complexity can be simplified or find the best algorithm with efficient complexity and implementation that can be easily implemented on Java Card environment for match on card. Efficiency involves the accuracy of the implementation, time taken to perform fingerprint alignment, memory required by the implementation and instruction operations required and used.enFingerprint alignmentJava cardsHough transformSmart cardsTime complexityConference PresentationMlambo, C., Shabalala, M., & Nelwamondo, F. V. (2015). Analysis of computational complexity for HT-based fingerprint alignment algorithms on java card environment. CS & IT-CSCP. http://hdl.handle.net/10204/8027Mlambo, CS, MB Shabalala, and Fulufhelo V Nelwamondo. "Analysis of computational complexity for HT-based fingerprint alignment algorithms on java card environment." (2015): http://hdl.handle.net/10204/8027Mlambo C, Shabalala M, Nelwamondo FV, Analysis of computational complexity for HT-based fingerprint alignment algorithms on java card environment; CS & IT-CSCP; 2015. http://hdl.handle.net/10204/8027 .TY - Conference Presentation AU - Mlambo, CS AU - Shabalala, MB AU - Nelwamondo, Fulufhelo V AB - In this paper, implementations of three Hough Transform based fingerprint alignment algorithms are analyzed with respect to time complexity on Java Card environment. Three algorithms 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 to present the complexity and implementations of existing work of one of the mostly used method of fingerprint alignment, in order that the complexity can be simplified or find the best algorithm with efficient complexity and implementation that can be easily implemented on Java Card environment for match on card. Efficiency involves the accuracy of the implementation, time taken to perform fingerprint alignment, memory required by the implementation and instruction operations required and used. DA - 2015-01 DB - ResearchSpace DP - CSIR KW - Fingerprint alignment KW - Java cards KW - Hough transform KW - Smart cards KW - Time complexity LK - https://researchspace.csir.co.za PY - 2015 T1 - Analysis of computational complexity for HT-based fingerprint alignment algorithms on java card environment TI - Analysis of computational complexity for HT-based fingerprint alignment algorithms on java card environment UR - http://hdl.handle.net/10204/8027 ER -