4 ms·
You could narrow down the possible matches to just a handful by comparing movie lengths – say, within 10 seconds of the same length is a possible match. Maybe t
by mistercow 15y ago
You could narrow down the possible matches to just a handful by comparing movie lengths – say, within 10 seconds of the same length is a possible match. Maybe throw in some basic title comparison to narrow the search further, and then do a simple check to see if the audio tracks seem to line up (an exhaustive comparison isn't necessary) to rapidly detect and exclude duplicates with a more than adequate accuracy rate. It would require a bit more complexity in the Kopime device, but not so much as to make it impractical.
- pessimizer 15y agoAre you aware of any (free or open) code out there that has implemented a reasonably efficient fingerprinting system? I'd love to take a look at it and/or use it for a project I'm working on.
- DennisP 15y agoI don't know how efficient it is, but here's an opensource perceptual hash library: http://www.phash.org/ http://www.phash.org/
- canadaduane 15y agoVery interesting. Thanks!
- pessimizer 15y agoNew to me. Thanks a lot.