检索结果-内蒙古大学图书馆

A fingerprint matching algorithm using bit-plane extraction method with phase-only correlation

INTERNATIONAL JOURNAL OF BIOMETRICS 2017年第1期9卷 44-66页

作者： Francis-Lothai, Florence Bong, David B. L. Univ Malaysia Sarawak Fac Engn Kota Samarahan Malaysia

This paper introduces a new method in fingerprint feature extraction based on bit-plane. A bit-plane image requires smaller storage space than a greyscale image. Region of interest (ROI) of a fingerprint image is extracted by using a modified blob analysis method, and then the core point of the ROI is detected for dimension reduction process. Before bit-plane is extracted, the fingerprint image is enhanced by using Fourier transform. Bit-plane 7 of the enhanced image is used as the input for fingerprint matching with phase-only correlation (POC) function. Experiment results showed that the storage space requirement for a fingerprint database could be reduced up to 87% per image for a bit-plane image compared with a greyscale image. The proposed fingerprint matching algorithm achieves 81.16% of recognition rate on FVC2002-Db1a database and 89.78% on FingerDOS database.

关键词： bit-plane biometric feature extraction fingerprint matching algorithm phase-only correlation POC

来源：评论

学校读者我要写书评

暂无评论

Study on Improvement of fingerprint matching algorithm in Wireless LAN Based Indoor Positioning System 17

Study on Improvement of Fingerprint Matching Algorithm in Wi...

引用

17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)

作者： Wang Hongyu Zhao Zhanhao Hu Jialiang Qu Zhenxin Feng Hao Zhongnan Univ Econ & Law Sch Informat & Safety Engn Wuhan Peoples R China

ISBN: (纸本)9781509022397

By comparing and analyzing several common indoor positioning system solutions, we found that indoor positioning System based on wireless LAN is superior, in which fingerprint matching algorithm was widely used and had a large room to be improved for more precise positioning performance. This paper presents an improved fingerprint matching algorithm, which reduces interference by Gaussian filter, calculates distance more accurately by weighted centroid algorithm. Furthermore, the algorithm improves precision by local prediction model revised by entire prediction model to increase the accuracy of positioning. The proposed algorithm can be widely used in different environment and has strong robustness. Experiments performed on real-world place shows that the result of our system is enhanced more than 26%, as compare to the traditional fingerprint-based WLAN positioning system.

关键词： indoor positioning wireless local area network fingerprint matching algorithm prediction model

来源：评论

学校读者我要写书评

暂无评论

fingerprint matching algorithm for poor quality images

引用

JOURNAL OF ENGINEERING-JOE 2015年第4期2015卷 149-153页

作者： Singh, Vedpal Elamvazuthi, Irraivan Univ Teknol PETRONAS Dept Elect & Elect Engn CISIR Tronoh 31750 Perak Darul Rid Malaysia

The main aim of this study is to establish an efficient platform for fingerprint matching for low-quality images. Generally, fingerprint matching approaches use the minutiae points for authentication. However, it is not such a reliable authentication method for low-quality images. To overcome this problem, the current study proposes a fingerprint matching methodology based on normalised cross-correlation, which would improve the performance and reduce the miscalculations during authentication. It would decrease the computational complexities. The error rate of the proposed method is 5.4%, which is less than the two-dimensional (2D) dynamic programming (DP) error rate of 5.6%, while Lee's method produces 5.9% and the combined method has 6.1% error rate. Genuine accept rate at 1% false accept rate is 89.3% but at 0.1% value it is 96.7%, which is higher. The outcome of this study suggests that the proposed methodology has a low error rate with minimum computational effort as compared with existing methods such as Lee's method and 2D DP and the combined method.

关键词： fingerprint identification image matching dynamic programming fingerprint matching algorithm poor quality images low-quality images authentication method normalised cross-correlation computational complexities two-dimensional dynamic programming error rate 2D DP Lee method genuine accept rate false accept rate

来源：评论

学校读者我要写书评

暂无评论

An ensemble of fingerprint matching algorithms based on cylinder codes and mtriplets for latent fingerprint identification

引用

PATTERN ANALYSIS AND APPLICATIONS 2021年第2期24卷 433-444页

作者： Valdes-Ramirez, Danilo Medina-Perez, Miguel A. Monroy, Raul Tecnol Monterrey Sch Sci & Engn Carretera Lago Guadalupe Km 3-5 Atizapan De Zaragoza 52926 Estado De Mexic Mexico Univ Ciego de Avila Dept Comp Sci Ciego De Avila 65100 Cuba

Automatic latent fingerprint identification is beneficial during forensic investigations. Usually, latent fingerprint identification algorithms are used to find a subset of similar fingerprints from those previously captured on databases, which are finally examined by latent examiners. Yet, the identification rate achieved by latent fingerprint identification algorithms is far from those obtained by latent examiners. One approach for improving identification rates is the fusion of the match scores computed with fingerprint matching algorithms using a supervised classification algorithm. This approach fuses the results provided by different lower-level algorithms to improve them. Thus, we propose a fusion of fingerprint matching algorithms using a supervised classifier. Our proposal starts with two different local matching algorithms. We substitute their global matching algorithms with another independent of the local matching, creating two lower-level algorithms for fingerprint matching. Then, we combine the output of these lower-level algorithms using a supervised classifier. Our proposal achieves higher identification rates than each lower-level algorithm and their fusion using traditional approaches for most of the rank values and reference databases. Moreover, our fusion algorithm reaches a Rank-1 identification rate of 74.03% and 71.32% matching the 258 samples in the NIST SD27 database against 29,257 and 100,000 references, the two largest reference databases employed in our experiments.

关键词： Latent fingerprint identification Match-score fusion fingerprint matching algorithm

来源：评论

学校读者我要写书评

暂无评论

A Cluster-Principal-Component-Analysis-Based Indoor Positioning algorithm

引用

IEEE INTERNET OF THINGS JOURNAL 2021年第1期8卷 187-196页

作者： Li, Ang Fu, Jingqi Shen, Huaming Sun, Sizhou Shanghai Univ Dept Mechatron Engn & Automat Shanghai 200444 Peoples R China

Indoor location-based service is emerging as the crucial application of the Internet of Things, which promotes the advance of relevant technology in the indoor scenario. Several positioning algorithms are proposed for different indoor configurations in recent years. The fingerprint-based indoor positioning algorithm has drawn much attention because of the good positioning performance without additional hardware. However, the false fingerprint matching frequently incurs due to the complexity of the indoor positioning environment and affects the positioning accuracy. In this article, a principal component analysis (PCA)-assisted indoor positioning algorithm based on the adaptive hierarchical clustering algorithm (PAHC) is proposed, which can improve the positioning accuracy through aggregating the reference points (RPs) and conducting the cluster-based PCA (C-PCA) features extraction. More specifically, a clustering termination method is proposed to obtain reasonable RPs clusters adaptively according to the preset RPs. A two-stage fingerprint matching algorithm is proposed based on the C-PCA to further increase the difference between similar RPs and thus improving the positioning accuracy. To verify the proposed algorithm, an indoor wireless system is established in the practical indoor scenario. The experimental results indicate that the proposed PAHC algorithm can increase the positioning accuracy by 9.3% compared with the conventional fingerprint algorithm.

关键词： Clustering algorithms Principal component analysis Interference Estimation Internet of Things Wireless sensor networks Feature extraction fingerprint matching algorithm hierarchical clustering indoor positioning algorithm principal component analysis (PCA) sums-of-squared deviations

来源：评论

学校读者我要写书评

暂无评论

A Dual-Image Template Based fingerprint matching Method 10

A Dual-Image Template Based Fingerprint Matching Method

引用

10th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)

作者： Li, Tuo Arif, Annatoma Cheng, Chi-Hao Miami Univ Dept Elect & Comp Engn Oxford OH 45056 USA

ISBN: (纸本)9781538619377

A new fingerprint matching method based on a dual-image template and an improved matching algorithm is presented in this paper. The proposed matching method is tested using images from FVC2002 fingerprint databases and demonstrates a superior performance compared with fingerprint matching algorithm using single-image template. Compared with other dual-image matching algorithms, the proposed algorithm has advantages of easy implementation. By taking advantages of dual-image template and improved matching algorithm, the proposed matching method improves matching accuracy and relaxes requirement on fingerprint image quality.

关键词： fingerprint matching algorithm minutia false match rate false non-match rate equal error rate

来源：评论

学校读者我要写书评

暂无评论

A New Method of fingerprints' Singular Points Detection

引用

INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS 2015年第9期9卷 213-224页

作者： Zhang Zhe Liang Yuanyuan Liu Xiangjiao Nan Yang Normal Univ Software Coll Nanyang 473000 Henan Peoples R China

This paper proposes a new method of fingerprint singular points searching algorithm based on fingerprint orientation maps mainly. In these orientation maps, mathematical morphology theory and operations are used to search the fingerprint's singular points in view of the phenomenon that the change of ridges' direction at the points is the fastest in the whole fingerprint image and the directions of finger ridges which surround the points are symmetric with each other. For obtaining more accuracy result, before obtain the orientation maps, we use db3 wavelet technology to remove the most of fingerprint images' noises in this paper. For the same reason, before the main mathematical morphology operations, we first obtain fingerprint images' binary image models based on the db3-denoise image, and use these models to remove the disturb directions of the image background secondly. Experiments indicate this method is easy to understand, achieve and has a good robustness for the fingerprint's translation and deformation.

关键词： fingerprint matching algorithm Mathematical Morphology fingerprint Singular Points' Searching Method

来源：评论

学校读者我要写书评

暂无评论

Study on the center of rotation method based on minimum spanning tree matching algorithm for fingerprint recognition

引用

OPTICAL ENGINEERING 2004年第4期43卷 822-829页

作者： Oh, CS Ryu, YK SunMoon Univ Dept Elect Informat & Commun Engn Tanghchung Myun 336708 Asan Si Chungna South Korea

The minimum spanning tree (MST) matching algorithm has been used for searching the partial matching points extracted from fingerprint images. The method, however, has some limitations. To obtain the relationship between the enrolled fingerprints and the input fingerprints the MST is used to generate the tree graph that represents the unique graph for the given minutiae. From the graph, the matching points are estimated. However, the shape of the graph highly depends on the positions of the minutiae. If there are some pseudo minutiae caused by noise, the shape of the graph will be totally different. To overcome the limitations of the MST, we propose the center of rotation method (CRM) that finds true partial matching points. The proposed method is based on the assumption that the input fingerprint minutiae are rigid body. In addition, we employ the polygon wrapping the minutiae for fast matching speed and reliable matching results. In conclusion we have been able to confirm fast performance and high identification ratio by using CRM. (C) 2004 Society of Photo-Optical Instrumentation Engineers.

关键词： fingerprint matching algorithm center of rotation method minimum spanning tree fingerprint recognition

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：