On Mon, Aug 31, 2009 at 7:08 PM, Eknath Venkataramani <eknath.i...@gmail.com > wrote:
> how efficient is the search? Can you describe the best case, worst case and > average case? > We carried out tests on a miniature database of about a million records. The False match was in the order of 2-3 in a million. The False non match was in the order of 5 per thousand. The speed depends on the system config. A normal laptop can do around 10,000 matchings per second. The template record is around 800 bytes in size and can be easily transmitted in low bandwidths The false non match is high and is a real limitation. In spite of this limitation it has a lot of applications. particularly in web banking/ rural atms / door locks / laptop login / mobile banking / elections / ration cards / National ID card/ Visa etc. For example, take that 5 out of every 1000 rightful person is denied a vote and 3 in a million are able to cast bogus votes. Compare this with what is really happening in the elections currently... And unless the image in the database is of bad quality, a false non match only requires a retry . _______________________________________________ To unsubscribe, email ilugc-requ...@ae.iitm.ac.in with "unsubscribe <password> <address>" in the subject or body of the message. http://www.ae.iitm.ac.in/mailman/listinfo/ilugc
