The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


Objectives: The essential requirement for a successful hashing method involves two distinct stages projection and quantization. In general, the projection stage is given much importance than the quantization stage. This stage has been concentrated in this paper which has equal importance as projection stage. Methods/Analysis: The using of Manhattan Distance method has been proposed in this paper instead of the widely used Hamming Distance, since it destroys the neighbourhood structure while measuring the similarity between points in the hashcode space. Findings: The problem of destroying the neighbourhood structure that existed in Hamming Distance is overcome by Manhattan hashing. Novelty/Improvement: The outperformance of Manhattan distance compared with Hamming distance has been shown and also, this paper has made an attempt to implement them in our Biocryptosystem to show its efficiency.

Keywords

Biocryptosystem, Biometrics, Hamming Distance, Manhattan Hashing, Similarity Measure Functions.
User