Study of the similarity function in Indexing-First-One hashing

Y. L. Lai; Z. Jin; B. M. Goi; T. Y. Chai

doi:10.1117/12.2280238

Study of the similarity function in Indexing-First-One hashing

Y. L. Lai
, Z. Jin
, B. M. Goi
, T. Y. Chai

Malaysia Sch of Information Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

Abstract

The recent proposed Indexing-First-One (IFO) hashing is a latest technique that is particularly adopted for eye iris template protection, i.e. IrisCode. However, IFO employs the measure of Jaccard Similarity (JS) initiated from Min-hashing has yet been adequately discussed. In this paper, we explore the nature of JS in binary domain and further propose a mathematical formulation to generalize the usage of JS, which is subsequently verified by using CASIA v3-Interval iris database. Our study reveals that JS applied in IFO hashing is a generalized version in measure two input objects with respect to Min-Hashing where the coefficient of JS is equal to one. With this understanding, IFO hashing can propagate the useful properties of Min-hashing, i.e. similarity preservation, thus favorable for similarity searching or recognition in binary space.

Original language	English
Title of host publication	Proceedings of SPIE
Subtitle of host publication	Second International Workshop on Pattern Recognition
Editors	Xudong Jiang, Masayuki Arai, Guojian Chen
Place of Publication	Bellingham WA USA
Publisher	SPIE - International Society for Optical Engineering
Number of pages	5
ISBN (Electronic)	9781510613515
ISBN (Print)	9781510613508
DOIs	https://doi.org/10.1117/12.2280238
Publication status	Published - 2017
Event	International Workshop on Pattern Recognition 2017 - Singapore, Singapore Duration: 1 May 2017 → 3 May 2017 Conference number: 2nd https://www.spiedigitallibrary.org/conference-proceedings-of-spie/10443.toc (Proceedings)

Publication series

Name	Proceedings of SPIE - The International Society for Optical Engineering
Publisher	SPIE
Volume	10443
ISSN (Print)	0277-786X
ISSN (Electronic)	1996-756X

Conference

Conference	International Workshop on Pattern Recognition 2017
Abbreviated title	IWPR 2017
Country/Territory	Singapore
City	Singapore
Period	1/05/17 → 3/05/17
Internet address	https://www.spiedigitallibrary.org/conference-proceedings-of-spie/10443.toc (Proceedings)

Keywords

Indexing-First-One hashing
Jaccard similarity
Min-hashing

Access to Document

10.1117/12.2280238

Cite this

Lai, Y. L., Jin, Z., Goi, B. M., & Chai, T. Y. (2017). Study of the similarity function in Indexing-First-One hashing. In X. Jiang, M. Arai, & G. Chen (Eds.), Proceedings of SPIE: Second International Workshop on Pattern Recognition Article 104431N (Proceedings of SPIE - The International Society for Optical Engineering; Vol. 10443). SPIE - International Society for Optical Engineering. https://doi.org/10.1117/12.2280238

Lai, Y. L. ; Jin, Z. ; Goi, B. M. et al. / Study of the similarity function in Indexing-First-One hashing. Proceedings of SPIE: Second International Workshop on Pattern Recognition. editor / Xudong Jiang ; Masayuki Arai ; Guojian Chen. Bellingham WA USA : SPIE - International Society for Optical Engineering, 2017. (Proceedings of SPIE - The International Society for Optical Engineering).

@inproceedings{53c718e5086046f6941fdd6f8fc088e1,

title = "Study of the similarity function in Indexing-First-One hashing",

abstract = "The recent proposed Indexing-First-One (IFO) hashing is a latest technique that is particularly adopted for eye iris template protection, i.e. IrisCode. However, IFO employs the measure of Jaccard Similarity (JS) initiated from Min-hashing has yet been adequately discussed. In this paper, we explore the nature of JS in binary domain and further propose a mathematical formulation to generalize the usage of JS, which is subsequently verified by using CASIA v3-Interval iris database. Our study reveals that JS applied in IFO hashing is a generalized version in measure two input objects with respect to Min-Hashing where the coefficient of JS is equal to one. With this understanding, IFO hashing can propagate the useful properties of Min-hashing, i.e. similarity preservation, thus favorable for similarity searching or recognition in binary space.",

keywords = "Indexing-First-One hashing, Jaccard similarity, Min-hashing",

author = "Lai, \{Y. L.\} and Z. Jin and Goi, \{B. M.\} and Chai, \{T. Y.\}",

note = "Funding Information: This research is supported by the Malaysian MOSTI Science fund 01-02-11-SF0201. Publisher Copyright: {\textcopyright} COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only. Copyright: Copyright 2017 Elsevier B.V., All rights reserved.; International Workshop on Pattern Recognition 2017, IWPR 2017 ; Conference date: 01-05-2017 Through 03-05-2017",

year = "2017",

doi = "10.1117/12.2280238",

language = "English",

isbn = "9781510613508",

series = "Proceedings of SPIE - The International Society for Optical Engineering",

publisher = "SPIE - International Society for Optical Engineering",

editor = "Xudong Jiang and Masayuki Arai and Guojian Chen",

booktitle = "Proceedings of SPIE",

address = "United States of America",

url = "https://www.spiedigitallibrary.org/conference-proceedings-of-spie/10443.toc",

}

Lai, YL, Jin, Z, Goi, BM & Chai, TY 2017, Study of the similarity function in Indexing-First-One hashing. in X Jiang, M Arai & G Chen (eds), Proceedings of SPIE: Second International Workshop on Pattern Recognition., 104431N, Proceedings of SPIE - The International Society for Optical Engineering, vol. 10443, SPIE - International Society for Optical Engineering, Bellingham WA USA, International Workshop on Pattern Recognition 2017, Singapore, Singapore, 1/05/17. https://doi.org/10.1117/12.2280238

Study of the similarity function in Indexing-First-One hashing. / Lai, Y. L.; Jin, Z.; Goi, B. M. et al.
Proceedings of SPIE: Second International Workshop on Pattern Recognition. ed. / Xudong Jiang; Masayuki Arai; Guojian Chen. Bellingham WA USA: SPIE - International Society for Optical Engineering, 2017. 104431N (Proceedings of SPIE - The International Society for Optical Engineering; Vol. 10443).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Study of the similarity function in Indexing-First-One hashing

AU - Lai, Y. L.

AU - Jin, Z.

AU - Goi, B. M.

AU - Chai, T. Y.

N1 - Conference code: 2nd

PY - 2017

Y1 - 2017

N2 - The recent proposed Indexing-First-One (IFO) hashing is a latest technique that is particularly adopted for eye iris template protection, i.e. IrisCode. However, IFO employs the measure of Jaccard Similarity (JS) initiated from Min-hashing has yet been adequately discussed. In this paper, we explore the nature of JS in binary domain and further propose a mathematical formulation to generalize the usage of JS, which is subsequently verified by using CASIA v3-Interval iris database. Our study reveals that JS applied in IFO hashing is a generalized version in measure two input objects with respect to Min-Hashing where the coefficient of JS is equal to one. With this understanding, IFO hashing can propagate the useful properties of Min-hashing, i.e. similarity preservation, thus favorable for similarity searching or recognition in binary space.

AB - The recent proposed Indexing-First-One (IFO) hashing is a latest technique that is particularly adopted for eye iris template protection, i.e. IrisCode. However, IFO employs the measure of Jaccard Similarity (JS) initiated from Min-hashing has yet been adequately discussed. In this paper, we explore the nature of JS in binary domain and further propose a mathematical formulation to generalize the usage of JS, which is subsequently verified by using CASIA v3-Interval iris database. Our study reveals that JS applied in IFO hashing is a generalized version in measure two input objects with respect to Min-Hashing where the coefficient of JS is equal to one. With this understanding, IFO hashing can propagate the useful properties of Min-hashing, i.e. similarity preservation, thus favorable for similarity searching or recognition in binary space.

KW - Indexing-First-One hashing

KW - Jaccard similarity

KW - Min-hashing

UR - https://www.scopus.com/pages/publications/85028537163

U2 - 10.1117/12.2280238

DO - 10.1117/12.2280238

M3 - Conference Paper

AN - SCOPUS:85028537163

SN - 9781510613508

T3 - Proceedings of SPIE - The International Society for Optical Engineering

BT - Proceedings of SPIE

A2 - Jiang, Xudong

A2 - Arai, Masayuki

A2 - Chen, Guojian

PB - SPIE - International Society for Optical Engineering

CY - Bellingham WA USA

T2 - International Workshop on Pattern Recognition 2017

Y2 - 1 May 2017 through 3 May 2017

ER -

Lai YL, Jin Z, Goi BM, Chai TY. Study of the similarity function in Indexing-First-One hashing. In Jiang X, Arai M, Chen G, editors, Proceedings of SPIE: Second International Workshop on Pattern Recognition. Bellingham WA USA: SPIE - International Society for Optical Engineering. 2017. 104431N. (Proceedings of SPIE - The International Society for Optical Engineering). doi: 10.1117/12.2280238

Study of the similarity function in Indexing-First-One hashing

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this