.png){kind=icon}
返回
SNR Maximization Hashing
.png){kind=icon}
PRE
AI
DOI：10.1109/TIFS.2015.2436871.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a novel robust hashing algorithm based on signal-to-noise ratio (SNR) maximization to learn compact binary codes, where the SNR metric is used to select a set of projection directions, and one hash bit is extracted from each projection direction. We first motivate this approach under a Gaussian model for the underlying signals, in which case maximizing SNR is equivalent to minimizing the robust hashing error probability. A globally optimal solution can be obtained by solving a generalized eigenvalue problem. We also develop a multibit per projection algorithm to learn longer hash codes when the number of high-SNR projections is limited. The proposed algorithms are tested on both synthetic and real data sets, showing significant performance gains over existing hashing algorithms.
Keyword:
Hashing
robust hashing
multi-bit hashing
SNR maximization
content identification
image retrieval
fingerprinting
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
5.2K
被引数:
2.3W
机构
引用论文
.png){kind=icon}
分享收藏
The Impact of Pre-existing Immunity on the Non-clinical Pharmacodynamics of AAV5-Based Gene Therapy
OAAI
OAAI分享收藏
查看更多内容