Abstract
To determine the source camera of a query image, the fingerprint from the query image needs to be compared with the fingerprints in the reference fingerprint database. Traditionally, the query fingerprint is compared with these reference fingerprints one by one in sequence. For a large database, however, such a brute-force search is inefficient and time-consuming. How to accurately locate the correct fingerprint in the reference fingerprint database is thus becoming a crucial problem for commercial applications of source camera identification. So far there have been few studies in literature addressing this problem. In this work, we propose a new solution to fast fingerprint search. We first store the information of the reference fingerprint digests in the separate-chaining hash table, and then introduce a new rule to select the candidate reference fingerprint digests before performing the correlation. The selection rule is incarnated with the search priority vector. Experimental results have shown that the proposed algorithm outperforms current algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
