KDnuggets Home » News » 2012 » Sep » Competitions » Innocentive: Algorithm for Matching Latent Fingerprints  ( < Prev | 12:n21 | Next > )

Innocentive: Algorithm for Matching Latent Fingerprints


 
  
Given images of latent fingerprints, identify the closest matching fingerprint in a reference collection of fingerprints, across a wide range of image quality. $100K prize, deadline Nov 27.


FingerprintInnocentive Challenge: Algorithm for Matching Latent Fingerprints

Given images of latent fingerprints, identify the closest matching fingerprint in a reference collection of fingerprints. The best algorithms will correctly and robustly identify latent fingerprints across a wide range of image quality.

This is a Reduction-to-Practice Challenge that requires a written proposal and delivery of source code implementing the algorithm. A real-time online scoring utility and leaderboard will be available for this Challenge.

Challenge Overview

This Challenge seeks to identify innovative methods to perform fully automated matching of digitized latent fingerprints against a gallery of known and unknown reference fingerprints, to support law enforcement agencies' ability to identify suspects from the scene of a crime. Current Automated Fingerprint Identification Systems (AFIS's) attempt to match a latent fingerprint to an enrolled print in a gallery and provide a list of candidate matches for a trained Latent Print Examiner.

This Challenge includes a real-time online scoring utility for Solvers to easily score their own code for accuracy on a blinded data set and compare performance versus other Solvers

For more information, visit

https://www.innocentive.com/ar/challenge/9932941


 
Related
Data Mining Competitions

KDnuggets Home » News » 2012 » Sep » Competitions » Innocentive: Algorithm for Matching Latent Fingerprints  ( < Prev | 12:n21 | Next > )