
TL;DR
This paper introduces Deep LDA Hashing, a novel end-to-end deep learning approach that transforms the LDA objective into a least squares problem, enabling efficient hashing code learning with significant performance improvements.
Contribution
It proposes a deep extension of LDA hashing by reformulating the objective into a simple least squares problem, overcoming eigenvalue decomposition challenges.
Findings
Achieves nearly 70-point improvement on CIFAR-10
Outperforms several state-of-the-art hashing methods
Demonstrates effectiveness across multiple benchmark datasets
Abstract
The conventional supervised hashing methods based on classification do not entirely meet the requirements of hashing technique, but Linear Discriminant Analysis (LDA) does. In this paper, we propose to perform a revised LDA objective over deep networks to learn efficient hashing codes in a truly end-to-end fashion. However, the complicated eigenvalue decomposition within each mini-batch in every epoch has to be faced with when simply optimizing the deep network w.r.t. the LDA objective. In this work, the revised LDA objective is transformed into a simple least square problem, which naturally overcomes the intractable problems and can be easily solved by the off-the-shelf optimizer. Such deep extension can also overcome the weakness of LDA Hashing in the limited linear projection and feature learning. Amounts of experiments are conducted on three benchmark datasets. The proposed Deep LDA…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Image and Video Retrieval Techniques · Video Surveillance and Tracking Methods · QR Code Applications and Technologies
MethodsLinear Discriminant Analysis
