Decide which hash-table corpus samples go into by a 4bit per pixel start
fragment, when computing a relevant subsetting index for which hashtable to use
- include neighbouring "bins" per pixel in neighborhood, as well as full
variation for that part of index if needle contains transparency.

The result is a quality near exhaustive search; at orders of magnitude better
performance.