A Fast Optimization Method for General Binary Code Learning

Abstract

Hashing or binary code learning has been recognized to accomplish efficient near neighbor search, and has thus attracted broad interests in recent retrieval, vision, and learning studies. One main challenge of learning to hash arises from the involvement of discrete variables in binary code optimization. While the widely used continuous relaxation may… (More)
DOI: 10.1109/TIP.2016.2612883

Topics

11 Figures and Tables

Statistics

05010020162017
Citations per Year

Citation Velocity: 36

Averaging 36 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.