Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Qin-Zhen Guo"'
Publikováno v:
Neurocomputing. 171:866-877
Product quantization (PQ) is a popular vector quantization method for approximate nearest neighbor search. The key idea of PQ is to decompose the original data space into the Cartesian product of some low-dimensional subspaces and then every subspace
Publikováno v:
Neurocomputing. 151:719-728
Using hashing algorithms to learn binary codes representation of data for fast approximate nearest neighbor (ANN) search has attracted more and more attention. Most existing hashing methods employ various hash functions to encode data. The resulting
Publikováno v:
Applied Mechanics and Materials. :2197-2200
Due to its fast query speed and reduced storage cost, hashing, which tries to learn binary code representation for data with the expectation of preserving the neighborhood structure in the original data space, has been widely used in a large variety
Publikováno v:
Applied Mechanics and Materials. :2224-2227
Product quantization (PQ) is an efficient and effective vector quantization approach to fast approximate nearest neighbor (ANN) search especially for high-dimensional data. The basic idea of PQ is to decompose the original data space into the Cartesi
Publikováno v:
Applied Mechanics and Materials. :2168-2171
Hashing which maps data into binary codes in Hamming space has attracted more and more attentions for approximate nearest neighbor search due to its high efficiency and reduced storage cost. K-means hashing (KH) is a novel hashing method which firstl
Publikováno v:
ICASSP
Many image retrieval systems adopt the bag-of-words model and rely on matching of local descriptors. However, these descriptors of keypoints, such as SIFT, may lead to false matches, since they do not consider the contextual information of the keypoi
Publikováno v:
ICASSP
Existing techniques usually adopt compact descriptors such as Fisher vector for mobile visual search, since compact descriptors are memory-efficient and suitable for fast transmission. In common Fisher vector methods, in order to make the size of ima
Publikováno v:
ICASSP
Although many systems based on global or local descriptors have shown promising results for logo recognition, they have handled all logos with the same structure and not considered their diversities. Therefore, with the logo scale increasing, the gen
Publikováno v:
ICME
Using hashing algorithms to learn binary codes representation of data for fast approximate nearest neighbor (ANN) search has attracted more and more attentions. Most existing hashing methods employ various hash functions to encode data. The resulting
Publikováno v:
2013 IEEE International Conference on Multimedia & Expo (ICME); 2013, p1-6, 6p