Name
Title | ||
|---|---|---|
Fast Binary Embedding via Circulant Downsampled Matrix - A Data-Independent Approach. |
Abstract | ||
|---|---|---|
Binary embedding of high-dimensional data aims to produce low-dimensional binary codes while preserving discriminative power. State-of-the-art methods often suffer from high computation and storage costs. We present a simple and fast embedding scheme by first downsampling N-dimensional data into M-dimensional data and then multiplying the data with an MxM circulant matrix. Our method requires O(N +M log M) computation and O(N) storage costs. We prove if data have sparsity, our scheme can achieve similarity-preserving well. Experiments further demonstrate that though our method is cost-effective and fast, it still achieves comparable performance in image applications. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Information Theory | Discrete mathematics,Embedding,Matrix (mathematics),Binary code,Circulant matrix,Upsampling,Discriminative model,Mathematics,Computation,Binary number |
DocType | Volume | Citations |
Journal | abs/1601.06342 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sung-Hsien Hsieh | 1 | 48 | 13.71 |
| Chun-shien Lu | 2 | 1238 | 104.71 |
| Soo-Chang Pei | 3 | 2054 | 241.11 |