tld: Set rotation for faster processing.
face: Fix path to classifier data.
make: Cleanup.
capture: Optionally use file streams.
capture: Set swscale to NULL after freeing.
histogram: Add.

Does naive histogram intersection on a 'mean histogram'
for each NV12 color plane.
cluster: Add greedy agglomerative clustering.
cluster: Remove unused min/max code.
cluster: Fix cluster intersection checks.

Now properly clusters in O(n^3), exhaustively.
bkg: Frame-by-frame background differencing.
bkg: Simplify windowing.
test: Remove stray #if
patch: Implement PatchMatch algorithm.
kdtree: Add a merge sort implementation.

Currently ~25% lower than C qsort.

The advantage is in being able to pass local context into the
comparator in a threadsafe way.

Whether this will actually be useful remains to be seen.
fill: more complete PatchMatch implementation.

Includes hole filling (inpainting), etc.
kdtree: replace custom msort with qsort_r.

Gives the same behavior at 10x the speed.
Complete kd-tree building.
kdtree: Each leaf can have up to 8 elements.

Makes for a cheap ANN search.
kdtree: Convert to Lab, WHT, quantize, store in tree
kdtree: Cleanup better.
kdtree: Naive querying.

Returns all "nearest" neighbors at a leaf.