|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
A Novel Encoding Scheme for Effective Biometric Discretization: Linearly Separable Subcode
Feb. 2013 (vol. 35 no. 2)
pp. 300-313
| ASCII Text | x | ||
| Meng-Hui Lim, A. B. J. Teoh, "A Novel Encoding Scheme for Effective Biometric Discretization: Linearly Separable Subcode," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2, pp. 300-313, Feb., 2013. | |||
| BibTex | x | ||
| @article{ 10.1109/TPAMI.2012.122, author = { Meng-Hui Lim and A. B. J. Teoh}, title = {A Novel Encoding Scheme for Effective Biometric Discretization: Linearly Separable Subcode}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {35}, number = {2}, issn = {0162-8828}, year = {2013}, pages = {300-313}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2012.122}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - A Novel Encoding Scheme for Effective Biometric Discretization: Linearly Separable Subcode IS - 2 SN - 0162-8828 SP300 EP313 EPD - 300-313 A1 - Meng-Hui Lim, A1 - A. B. J. Teoh, PY - 2013 KW - pattern classification KW - biometrics (access control) KW - cryptography KW - encoding KW - entropy KW - feature extraction KW - Gray codes KW - Hamming codes KW - cryptography KW - encoding scheme KW - effective biometric discretization KW - code separability KW - Hamming-distance separation KW - codewords KW - multibit biometric discretization KW - quantization-interval labeling KW - distance dissimilarity preservation KW - feature component mapping KW - discrete space KW - Hamming space KW - binary reflected Gray code KW - BRGC encoding KW - interclass variation KW - discrete-to-binary mapping KW - classification performance KW - binary output entropy KW - full-ideal separability capability KW - near-ideal separability capability KW - partially linearly separable subcode KW - PLSSC KW - entropy-performance tradeoff KW - entropy-redundancy tradeoff KW - code length KW - discretization performance KW - Encoding KW - Hamming distance KW - Reflective binary codes KW - Entropy KW - Indexes KW - Quantization KW - Labeling KW - linearly separable subcode KW - Biometric discretization KW - quantization KW - encoding VL - 35 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
Web Extra: View Supplemental Material (PDF)
Separability in a code is crucial in guaranteeing a decent Hamming-distance separation among the codewords. In multibit biometric discretization where a code is used for quantization-intervals labeling, separability is necessary for preserving distance dissimilarity when feature components are mapped from a discrete space to a Hamming space. In this paper, we examine separability of Binary Reflected Gray Code (BRGC) encoding and reveal its inadequacy in tackling interclass variation during the discrete-to-binary mapping, leading to a tradeoff between classification performance and entropy of binary output. To overcome this drawback, we put forward two encoding schemes exhibiting full-ideal and near-ideal separability capabilities, known as Linearly Separable Subcode (LSSC) and Partially Linearly Separable Subcode (PLSSC), respectively. These encoding schemes convert the conventional entropy-performance tradeoff into an entropy-redundancy tradeoff in the increase of code length. Extensive experimental results vindicate the superiority of our schemes over the existing encoding schemes in discretization performance. This opens up possibilities of achieving much greater classification performance with high output entropy.
Index Terms:
pattern classification,biometrics (access control),cryptography,encoding,entropy,feature extraction,Gray codes,Hamming codes,cryptography,encoding scheme,effective biometric discretization,code separability,Hamming-distance separation,codewords,multibit biometric discretization,quantization-interval labeling,distance dissimilarity preservation,feature component mapping,discrete space,Hamming space,binary reflected Gray code,BRGC encoding,interclass variation,discrete-to-binary mapping,classification performance,binary output entropy,full-ideal separability capability,near-ideal separability capability,partially linearly separable subcode,PLSSC,entropy-performance tradeoff,entropy-redundancy tradeoff,code length,discretization performance,Encoding,Hamming distance,Reflective binary codes,Entropy,Indexes,Quantization,Labeling,linearly separable subcode,Biometric discretization,quantization,encoding
Citation:
Meng-Hui Lim, A. B. J. Teoh, "A Novel Encoding Scheme for Effective Biometric Discretization: Linearly Separable Subcode," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2, pp. 300-313, Feb. 2013, doi:10.1109/TPAMI.2012.122
Usage of this product signifies your acceptance of the Terms of Use.