I see a relatively easy SUGAR. More importantly, I really like that they limit the accuracy measures by taking into account the huge disparity between positive count and negative count. Personally I just use the metric of binary "Found everything with/without false positives", versus "missed something critical". I agree with Tingfan that the whole nearest neighbor suppression is inherent in all of the sliding window approaches. I agree that segmentation and selection of regions would be a good solution to that, but it might push things out of the nice realish time area.