Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?
 
PerlMonks  

Re: I need a comparison/hashing algorithm (not the usual).

by Zaxo (Archbishop)
on Sep 24, 2004 at 06:13 UTC ( [id://393402]=note: print w/replies, xml ) Need Help??


in reply to I need a comparison/hashing algorithm (not the usual).

This is crude, but you can try zipping them separately for comparison and zipping their concatenation. If they are similar, you'll get a higher compression ratio than if not.

Another possibility to to apply a fast fourier transform to each and multiply them pointwise. That will give the fourier transform of their correlation function. That has the potential to give very precise results, but maybe hard to interpret. Similar files will produce a strongly peaked correlation function.

If you want to try the second route, PDL is the way.

After Compline,
Zaxo

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://393402]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others musing on the Monastery: (9)
As of 2024-03-28 10:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found