A Square-Root Sampling Approach to Fast Histogram-Based Search

--

Run 'demo.m' to try some examples.
(Use 'recompile.m' to recompile the C code if necessary.)

C source code:
ELK.c     (expected likelihood kernel)
SELK.c    (sparse evaluation of ELK)
SBTCY.c   (sparse evaluation of Bhattacharyya kernel)
SSD_U.c   (comparing histograms by SSD using an updating scheme)
BTCY_U.c  (exact evaluation of Bhattacharyya kernel using an updating scheme)

--

Try "eval_painting_8.m" or "eval_painting_16.m" or "eval_painting_32.m" 
to generate the results shown in the paper.
It takes a couple of hours to repeat 300 runs of evaluations on the five methods.
Once done, use "draw_res.m" to plot the resulting precision and timing curves, e.g.,
>> draw_res('res_painting_q8.mat')