An Efficient Graph-Based Algorithm for Fingerprint Representation and Matching

doi 10.2991/icmt-13.2013.125
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Atlantis Press

Related search

K-Plet and Coupled BFS: A Graph Based Fingerprint Representation and Matching Algorithm

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

A Tensor-Based Algorithm for High-Order Graph Matching

2009English

An Efficient Graph-Coloring Algorithm for Processor Allocation

International Journal of Information Technology and Computer Science
2013English

Filterbank-Based Fingerprint Matching

IEEE Transactions on Image Processing
Computer GraphicsComputer-Aided DesignSoftware
2000English

Image Matching Using Relational Graph Representation

2006English

Efficient Shape Matching via Graph Cuts

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

New and Efficient Recursive-Based String Matching Algorithm (RSMA-FLFC)

International Journal of Computer Applications
2014English

A New Algorithm for Graph Matching With Application to Content-Based Image Retrieval

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

An Efficient Algorithm for Vehicle Crashworthiness Design via Crash Mode Matching

2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy