arXiv:1612.01834
Revisiting Winner Take All (WTA) Hashing for Sparse Datasets
원문 초록
WTA (Winner Take All) hashing has been successfully applied in many large scale vision applications. This hashing scheme was tailored to take advantage of the comparative reasoning (or order based information), which showed significant accuracy improvements. In this paper, we identify a subtle issue with WTA, which grows with the sparsity of the datasets. This issue limits the discriminative power of WTA. We then propose a solution for this problem based on the idea of Densification which provably fixes the issue. Our experiments show that Densified WTA Hashing outperforms Vanilla WTA both in image classification and retrieval tasks consistently and significantly.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Label Consistent Fisher Vectors for Supervised Feature Aggregation
SUT: a new multi-purpose synthetic dataset for Farsi document image analysis
Semantic Structure Enhanced Contrastive Adversarial Hash Network for Cross-media Representation Learning
Generative Adversarial Minority Oversampling for Spectral-Spatial Hyperspectral Image Classification
Attention-Based Adaptive Spectral-Spatial Kernel ResNet for Hyperspectral Image Classification
Multi-direction Networks with Attentional Spectral Prior for Hyperspectral Image Classification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.