Notes on generalized Hamming weights of some classes of binary codes
Sign Up to like & getrecommendations! Published in 2019 at "Cryptography and Communications"
DOI: 10.1007/s12095-019-00404-3
Abstract: Some classes of binary codes constructed by using some defining sets are studied, and for most defining sets, we will determine the generalized Hamming weight of the corresponding codes completely, and for other defining sets,… read more here.
Keywords: binary codes; classes binary; notes generalized; defining sets ... See more keywords
Kernelized product quantization
Sign Up to like & getrecommendations! Published in 2017 at "Neurocomputing"
DOI: 10.1016/j.neucom.2016.12.016
Abstract: There has been increasing interest in learning compact binary codes for large-scale image data representation and retrieval. In most existing hashing-based methods, high-dimensional vectors are hashed into Hamming space, and the similarity between two vectors… read more here.
Keywords: space; binary codes; quantization; hashing based ... See more keywords
Efficient Conversion of Deep Features to Compact Binary Codes Using Fourier Decomposition for Multimedia Big Data
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Transactions on Industrial Informatics"
DOI: 10.1109/tii.2018.2800163
Abstract: Exponential growth of multimedia data has been witnessed in recent years from various industries, such as e-commerce, health, transportation, and social networks, etc. Access to desired data in such gigantic datasets require sophisticated and efficient… read more here.
Keywords: compact binary; codes using; fourier decomposition; binary codes ... See more keywords
Learning Discriminative Binary Codes for Large-scale Cross-modal Retrieval
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Transactions on Image Processing"
DOI: 10.1109/tip.2017.2676345
Abstract: Hashing based methods have attracted considerable attention for efficient cross-modal retrieval on large-scale multimedia data. The core problem of cross-modal hashing is how to learn compact binary codes that construct the underlying correlations between heterogeneous… read more here.
Keywords: binary codes; large scale; cross modal; modal retrieval ... See more keywords
An Algorithmic Reduction Theory for Binary Codes: LLL and More
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2022.3143620
Abstract: In this article, we propose an adaptation of the algorithmic reduction theory of lattices to binary codes. This includes the celebrated LLL algorithm (Lenstra, Lenstra, Lovasz, 1982), as well as adaptations of associated algorithms such… read more here.
Keywords: binary codes; theory; theory binary; reduction theory ... See more keywords
BATCH: A Scalable Asymmetric Discrete Cross-Modal Hashing
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Transactions on Knowledge and Data Engineering"
DOI: 10.1109/tkde.2020.2974825
Abstract: Supervised cross-modal hashing has attracted much attention. However, there are still some challenges, e.g., how to effectively embed the label information into binary codes, how to avoid using a large similarity matrix and make a… read more here.
Keywords: binary codes; cross modal; cross; modal hashing ... See more keywords
Nonlinear Discrete Hashing
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Transactions on Multimedia"
DOI: 10.1109/tmm.2016.2620604
Abstract: In this paper, we propose a nonlinear discrete hashing approach to learn compact binary codes for scalable image search. Instead of seeking a single linear projection in most existing hashing methods, we pursue a multilayer… read more here.
Keywords: data samples; nonlinear discrete; binary codes; error ... See more keywords
Deep Variational and Structural Hashing
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Pattern Analysis and Machine Intelligence"
DOI: 10.1109/tpami.2018.2882816
Abstract: In this paper, we propose a deep variational and structural hashing (DVStH) method to learn compact binary codes for multimedia retrieval. Unlike most existing deep hashing methods which use a series of convolution and fully-connected… read more here.
Keywords: binary codes; deep variational; variational structural; structural hashing ... See more keywords
Two-Stage Supervised Discrete Hashing for Cross-Modal Retrieval
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Systems, Man, and Cybernetics: Systems"
DOI: 10.1109/tsmc.2021.3130939
Abstract: Recently, hashing-based multimodal learning systems have received increasing attention due to their query efficiency and parsimonious storage costs. However, impeded by the quantization loss caused by numerical optimization, the existing cross-media hashing approaches are unable… read more here.
Keywords: cross modal; two stage; stage supervised; binary codes ... See more keywords
Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1)
Sign Up to like & getrecommendations! Published in 2019 at "Quaestiones Mathematicae"
DOI: 10.2989/16073606.2019.1580227
Abstract: Abstract For a set Ω = {1, 2, . . . , n} where n = 2k ≥ 6, let Ω{k} denote the set of all subsets of Ω of size k. We examine the… read more here.
Keywords: bipartite graphs; binary codes; codes partial; biadjacency matrices ... See more keywords