Optimizing affinity-based binary hashing using auxiliary coordinates

In supervised binary hashing, one wants to learn a function that maps a high-dimensional feature vector to a vector of binary codes, for application to fast image retrieval. This typically results in a difficult optimization problem, nonconvex and nonsmooth, because of the discrete variables involved... (read more)

Results in Papers With Code
(↓ scroll down to see all results)