Iris Recognition Based on Wavelet Transform with Shift Invariance Preprocessing

Ming Xing; Liu Yuanning; Zhu Xiaodong; Xu Tao

Journal of Computer Research and Development > 2006 > 43(7): 1186-1193.

Ming Xing, Liu Yuanning, Zhu Xiaodong, Xu Tao. Iris Recognition Based on Wavelet Transform with Shift Invariance Preprocessing[J]. Journal of Computer Research and Development, 2006, 43(7): 1186-1193.

Citation:

PDF (482 KB)

Iris Recognition Based on Wavelet Transform with Shift Invariance Preprocessing

1(College of Computer Science and Technology, Jilin University, Changchun 130012) 2(Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 130012) 3(College of Mechanical Science and Engineering, Jilin University, Changchun 130022)

More Information

Published Date: July 14, 2006

Graphical Abstract

Abstract

Abstract

The normal discrete wavelet transform is sensitive to the initial position of asignal and can not be used to extract stable iris features. To weaken the negative effect on the recognition result due to the shift sensitivity of the wavelettransform，a shift invariance preprocessing method based on directional energy distribution sequences is proposed to correct the angular rotation of different iris textures, which corresponds to the horizontal shift of normalized iris blocks. A threshold scheme is then performed to transform all the wavelet coefficients into a binary vector to represent iris features. In verification mode, the weighted Hamming distance classifier is finally adopted to perform multi-template matching to identify the unknown feature vector. Comparison experiments show that the proposed algorithm enhances the availability of iris feature representation by wavelet transform and leads to a good performance of iris recognition.
- iris recognition,
- invariance,
- wavelet transform,
- weighted Hamming distance

FullText(HTML)

References (0)

[1]	Chen Guilin, Wang Guanwu, Hu Jian, Wang Kang, Xu Dongzhong. Survey on Chiplet Packaging Structure and Communication Structure[J]. Journal of Computer Research and Development, 2022, 59(1): 22-30. DOI: 10.7544/issn1000-1239.20200314
[2]	Liu Runtao, Liang Jianchuang. Reverse Nearest Neighbor Query Based on New Index Structure[J]. Journal of Computer Research and Development, 2020, 57(6): 1335-1346. DOI: 10.7544/issn1000-1239.2020.20190470
[3]	Ren Gang, Deng Pan, Yang Chao, Wu Changmao. MapReduce Back Propagation Algorithm Based on Structure Parallelism[J]. Journal of Computer Research and Development, 2018, 55(6): 1308-1319. DOI: 10.7544/issn1000-1239.2018.20170024
[4]	Xu Jian, Zhou Fucai, Yang Muzhou, Li Fuxiang, Zhu Zhiliang. Hierarchical Hash List for Distributed Query Authentication[J]. Journal of Computer Research and Development, 2012, 49(7): 1533-1544.
[5]	Li Shaofang, Hu Shanli, Shi Chunyi. An Anytime Coalition Structure Generation Based on the Grouping Idea of Cardinality Structure[J]. Journal of Computer Research and Development, 2011, 48(11): 2047-2054.
[6]	Liu Jinglei, Zhang Wei, Liu Zhaowei, and Sun Xuejiao. Properties and Application of Coalition Structure Graph[J]. Journal of Computer Research and Development, 2011, 48(4): 602-609.
[7]	Ha Minghu, Tian Jingfeng, Zhang Zhiming. Structural Risk Minimization Principle Based on Complex Random Samples[J]. Journal of Computer Research and Development, 2009, 46(11): 1907-1916.
[8]	Liu Quan, Gao Yang, Chen Daoxu, Sun Jigui, Yao Wangshu. A Logical Reinforcement Learning Method Based on Heuristic Contour List[J]. Journal of Computer Research and Development, 2008, 45(11): 1824-1830.
[9]	Su Shexiong, Hu Shanli, Zheng Shengfu, Lin Chaofeng, and Luo Jianbin. An Anytime Coalition Structure Generation Algorithm Based on Cardinality Structure[J]. Journal of Computer Research and Development, 2008, 45(10): 1756.
[10]	Pang Liaojun, Jiang Zhengtao, and Wang Yumin. A Multi-Secret Sharing Scheme Based on the General Access Structure[J]. Journal of Computer Research and Development, 2006, 43(1): 33-38.