Scalable action localization with kernel-space hashing

To detect and locate complex human actions in video, one trains a detector for each target class and applies it to the video content. This approach can scale to large video databases if the application of the detector can be made sublinear in the size of the database. Sublinear retrieval methods have been successfully explored for query-by-example but few were devised for these more challenging queries by detector. We put forward here a novel approximate search method that relies on LSH to support query-by-detector. We evaluate our method on a recent large action localization dataset and show it has significantly better efficiency than linear search.