Timeline for Cross correlation detection in binary Hamming distance
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 17, 2011 at 2:42 | comment | added | Brian Borchers | I'd expect that single precision would be quite accurate enough for your purposes and would run somewhat faster than double precision, particularly if you're using a GPU to do this. | |
| Jan 17, 2011 at 0:52 | vote | accept | MathGeek | ||
| Jan 17, 2011 at 0:52 | comment | added | MathGeek | Ah! So the simple realization is that this doesn't have to be done bitwise at all.. just move it into reals and use standard tools. Thanks for the -1 to 1 remapping trick, that makes the output very clean! | |
| Jan 16, 2011 at 23:00 | history | answered | Brian Borchers | CC BY-SA 2.5 |