DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Saehoon | - |
dc.contributor.author | CHOI, SEUNGJIN | - |
dc.date.accessioned | 2018-05-04T02:32:55Z | - |
dc.date.available | 2018-05-04T02:32:55Z | - |
dc.date.created | 2018-02-26 | - |
dc.date.issued | 2018-03 | - |
dc.identifier.issn | 1070-9908 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/41165 | - |
dc.description.abstract | Binary embedding refers to methods for embedding points in R-d into vertices in the Hamming cube of dimension O(d), such that the normalized Hamming distance between the codes preserves a prespecified distance between vectors in the original space. A common approach to binary embedding is to use random projection, followed by one-bit quantization to produce binary codes. Of particular interest, in this letter, is sparse circulant binary embedding (SCBE), where a sparse random circulant matrix with random sampling at a rate of 1 - s for s. (0, 1) is used for random projection. The SCBE has the space complexity O((1 - s) d), while unstructured random projection has the space complexity O(d(2)). We present an asymptotic analysis of SCBE, when d approaches infinity, showing that the performance of SCBE is comparable to that of binary embedding with unstructured random projection while the former has the space complexity O((1 - s) d) and the time complexity O(d log d) but the latter has both space and time complexities O(d(2)). | - |
dc.language | English | - |
dc.publisher | IEEE | - |
dc.relation.isPartOf | IEEE Signal Processing Letters | - |
dc.subject | Asymptotic analysis | - |
dc.subject | Binary codes | - |
dc.subject | Bins | - |
dc.subject | Codes (symbols) | - |
dc.subject | Hamming distance | - |
dc.subject | Quantization (signal) | - |
dc.subject | Vector spaces | - |
dc.subject | Binary embedding | - |
dc.subject | Circulant matrix | - |
dc.subject | Convergence | - |
dc.subject | Locality sensitive hashing | - |
dc.subject | Random projections | - |
dc.subject | sparse embedding | - |
dc.subject | Sparse matrices | - |
dc.subject | Time complexity | - |
dc.subject | Matrix algebra | - |
dc.title | Sparse circulant binary embedding: An asymptotic analysis | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/LSP.2018.2794768 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | IEEE Signal Processing Letters, v.25, no.3, pp.432 - 436 | - |
dc.identifier.wosid | 000424699600003 | - |
dc.date.tcdate | 2018-03-23 | - |
dc.citation.endPage | 436 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 432 | - |
dc.citation.title | IEEE Signal Processing Letters | - |
dc.citation.volume | 25 | - |
dc.contributor.affiliatedAuthor | Kim, Saehoon | - |
dc.contributor.affiliatedAuthor | CHOI, SEUNGJIN | - |
dc.identifier.scopusid | 2-s2.0-85040934093 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Binary embedding (BE) | - |
dc.subject.keywordAuthor | circulant matrix | - |
dc.subject.keywordAuthor | locality-sensitive hashing | - |
dc.subject.keywordAuthor | random projection | - |
dc.subject.keywordAuthor | sparse embedding | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.