p3 = integral[y+1,x2+1]
p2 = integral[y+1,x1-1]
p1 = integral[y,x2+1]
p0 = integral[y,x1-1]
val = p3-p2-p1+p0
return val
# roughly how far we scan horizontally
window = 2*80 #int(img.width/repeats)
repeats = np.floor(img.width/window)
print "window: {0}".format(window)
# how big of a signal we convolve
samplesz = window / 10
print "sample: {0}".format(samplesz)
dmap = np.zeros([img.width-window,img.height],dtype='int32')
integral = cv2.integral(img.getGrayNumpyCv2())
# we'll do this with iteration first to test
# proof of concept.
print (img.width,img.height)
# need to double check these bounds with the integral image
# really wish I could get rid of this iteration
for vidx in range(1,img.height-1): # for each row
print "row {0}".format(vidx)
for hidx in range(1,img.width-window-1): #for each pixel in the row
# get the sum of a horz chunk
sample = idxToSum(hidx,hidx+samplesz,vidx,integral)
# try and grok this, go thru a search window, calc the abs diff of sums
# between or sample and the test window, toss in a list
vals = [np.abs(sample-idxToSum(hidx+sidx,hidx+sidx+samplesz,vidx,integral)) for sidx in range((window/2)-samplesz,window-samplesz) ]
# find the minimum match
best = np.where(np.array(vals)==np.min(vals))[0]
