Online hashing for fast similarity search
In this thesis, the problem of online adaptive hashing for fast similarity search is studied. Similarity search is a central problem in many computer vision applications. The ever-growing size of available data collections and the increasing usage of high-dimensional representations in describing d...
Main Author: | |
---|---|
Language: | en_US |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/2144/27360 |