Bok-Min GoiBokMin

Prof. Bok-Min GoiBokMin

Universiti Tunku Abdul Rahman (UTAR)

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2017 in Pattern Recognition
Verified
Journal Article
Closed access
YLYen-Lung Lai
Yen-Lung Lai
ZJZhe Jin
Zhe Jin
Andrew Teoh Beng JinAndrew Teoh Beng Jin
Andrew Teoh Beng Jin
BGBok-Min GoiBokMin
Bok-Min GoiBokMin
WYWun-She Yap
Wun-She Yap
CRChristian Rathgeb
Christian Rathgeb

1 June 2014 in Pattern Recognition Letters
Verified
Journal Article
Closed access
ZJZhe Jin
Zhe Jin
MLMeng-Hui Lim
Meng-Hui Lim
Andrew Teoh Beng JinAndrew Teoh Beng Jin
Andrew Teoh Beng Jin
BGBok-Min GoiBokMin
Bok-Min GoiBokMin

1 August 2016 in Pattern Recognition
Verified
Journal Article
Closed access
ZJZhe Jin
Zhe Jin
Andrew Teoh Beng JinAndrew Teoh Beng Jin
Andrew Teoh Beng Jin
BGBok-Min GoiBokMin
Bok-Min GoiBokMin
YTYong-Haur Tay
Yong-Haur Tay

12 January 2016 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
ZJZhe Jin
Zhe Jin
MLMeng-Hui Lim
Meng-Hui Lim
Andrew Teoh Beng JinAndrew Teoh Beng Jin
Andrew Teoh Beng Jin
BGBok-Min GoiBokMin
Bok-Min GoiBokMin
YTYong Haur Tay
Yong Haur Tay
The ISO/IEC 19794-2-compliant fingerprint minutiae template is an unordered and variable-sized point set data. Such a characteristic leads to a restriction for the applications that can only operate on fixed-length binary data, such as cryptographic applications and certain biometric cryptosystems (e.g., fuzzy commitment). In this paper, we propose a generic point-to-string conversion framework for fingerprint minutia based on kernel learning methods to generate discriminative fixed length binary strings, which enables rapid matching. The proposed framework consists of four stages: (1) minutiae descriptor extraction; (2) a kernel transformation method that is composed of kernel principal component analysis or kernelized locality-sensitive hashing for fixed length vector generation; (3) a dynamic feature binarization; and (4) matching. The promising experimental results on six datasets from fingerprint verification competition (FVC)2002 and FVC2004 justify the feasibility of the proposed framework in terms of matching accuracy, efficiency, and template randomness.

31 July 2008
Verified
Book Chapter
Closed access
PDF file
WYWei-Chuen Yau
Wei-Chuen Yau
SHSwee-Huay Heng
Swee-Huay Heng
BGBok-Min GoiBokMin
Bok-Min GoiBokMin

1 January 2012
Verified
Book Chapter
Closed access
PDF file
CNChoon Boon Ng
Choon Boon Ng
YTYong Haur Tay
Yong Haur Tay
BGBok-Min GoiBokMin
Bok-Min GoiBokMin