Zobrazeno 1 - 10
of 253
pro vyhledávání: '"Locality preserving hashing"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE Transactions on Circuits and Systems for Video Technology. 28:2703-2715
Multimodal hashing approaches have gained great success on large-scale cross-modal similarity search applications, due to their appealing computation and storage efficiency. However, it is still a challenge work to design binary codes to represent th
Publikováno v:
Pattern Recognition. 75:175-187
As far as we know, we are the first to propose a general framework to incorporate the quantization-based methods into the conventional similarity-preserving hashing, in order to improve the effectiveness of hashing methods. In theory, any quantizatio
Autor:
Zhouchen Lin, Yameng Huang
Publikováno v:
IEEE Transactions on Image Processing. 27:406-418
Hashing is a useful technique for fast nearest neighbor search due to its low storage cost and fast query speed. Unsupervised hashing aims at learning binary hash codes for the original features so that the pairwise distances can be best preserved. W
Publikováno v:
IEEE Transactions on Cybernetics. 47:4275-4288
Due to the significant reduction in computational cost and storage, hashing techniques have gained increasing interests in facilitating large-scale cross-view retrieval tasks. Most cross-view hashing methods are developed by assuming that data from d
Publikováno v:
IEEE Transactions on Image Processing. 26:5367-5380
To overcome the barrier of storage and computation when dealing with gigantic-scale data sets, compact hashing has been studied extensively to approximate the nearest neighbor search. Despite the recent advances, critical design issues remain open in
Autor:
Dandan Chen, Yingjie Tian
Publikováno v:
Neural Computing and Applications. 31:2889-2903
By combining the structural information with nonparallel support vector machine, structural nonparallel support vector machine (SNPSVM) can fully exploit prior knowledge to directly improve the algorithm’s generalization capacity. However, the scal
Publikováno v:
Cluster Computing. 22:1959-1971
Similarity search is an essential operation in such domains as data mining and content-based information retrieval. This simple operation causes considerable burden when the number of data records grows large, especially in big data applications. At
Publikováno v:
Neurocomputing. 236:56-64
Hashing based approximate nearest neighbor (ANN) search techniques have attracted considerable attention in media search community because of its good potential for low storage cost and fast query speed. Many hashing based ANN search methods have bee
Publikováno v:
Multimedia Tools and Applications. 77:7131-7152
Robust image hashing is a promising technique to represent image’s perceptual content. However, when it comes to image authentication, tradeoff between robustness and discrimination is a non-negligible issue. The allowed content preserving operatio