In this work, we propose a novel mobile visual search system based on "bag of hash bits". Using new ideas for hash bit selection, multi-hash table generation, and hamming-distance soft scoring, we overcome the problem of bit inefficiency affecting the traditional hashing approaches, and ...
The paper "Cryptanalysis of the Hash Functions MD4 and RIPEMD" by Wang et al details a cryptanalytic attack that lets us find collisions in 2^8 or less. Given a message block M, Wang outlines a strategy for finding a sister message block M', differing only in a few bits, that will ...
SYSTEMS AND METHODS FOR MOBILE SEARCH USING BAG OF HASH BITS AND BOUNDARY RERANKINGDetermining ranked candidate media in response to media query data corresponding to a query media includes receiving the media query data including feature data of the query media, coordinate data, and boundary data,...
A New Modified MD5-224 Bits Hash Function andanEfficient Message Authentication Code Based onQuasigroupsdoi:10.1007/978-981-16-8664-1_1In this paper, we have proposed (i) a hash function and (ii) an efficient message authentication code based on quasigroup. We refer to these as QGMD5 and...
Si, and D. Zhang, "Learning to hash with partial tags: exploring correlation between tags and hashing bits for large scale image retrieval". in: ECCV, 2014, pp. 378-392.Wang, Q., Si, L., Zhang, D.: Learning to hash with partial tags: Exploring cor- relation between tags and ...
Enhanced payload volume in the least significant bits image steganography using hash functiondoi:10.7717/peerj-cs.1606Ghadi, Yazeed YasinAlShloul, TamaraNezami, Zahid IqbalAli, HamidAsif, MuhammadBah, Mohamed JawardPeerJ Computer Science
Qifan Wang, Luo Si, and Dan Zhang, "Learning to hash with partial tags: Exploring correlation between tags and hashing bits for large scale image retrieval," Trans- actions on Multimedia, pp. 378-392, 2014.Wang, Q., Si, L., Zhang, D.: Learning to hash with partial tags: Exploring ...
A method and network element identify a set of bit indices for forming compressed keys, which are used to map a set of keys of corresponding input values to assigned lookup values in a hash table, where the keys of the input values have colliding hash values according to a hash function ...
The information validation engine then forms the protected compression encoded data by replacing the selected data bits of the normalised compression encoded data with the data bits of the secure hash value. By generating a secure hash of the normalised bitstream rather than the original bitstream, ...
A method and network element identify a set of bit indices for forming compressed keys, which are used to map a set of keys of corresponding input values to assigned lookup values in a hash table, where the keys of the input values have colliding hash values according to a hash function ...