Results 261 to 270 of about 126,873 (298)
Some of the next articles are maybe not open access.

Distribution Sensitive Product Quantization

IEEE Transactions on Circuits and Systems for Video Technology, 2018
Product quantization (PQ) seems to have become the most efficient framework of performing approximate nearest neighbor (ANN) search for high-dimensional data. However, almost all existing PQ-based ANN techniques uniformly allocate precious bit budget to each subspace.
Linhao Li   +3 more
openaire   +1 more source

New Perspective on Inner Product Quantization

Physical Review Letters, 1998
Summary: We devise a new and highly accurate quantization procedure for the inner product representation, in both configuration and momentum space. Utilizing the representation \(\Psi(\xi)=\sum_ia_i[E]\xi^iR_\beta(\xi)\), for an appropriate reference function, \(R_\beta(\xi)\), we demonstrate that the (convergent) zeros of the coefficient functions ...
Tymczak, C. J.   +3 more
openaire   +1 more source

Improved embedding product quantization

Machine Vision and Applications, 2019
Real-time object matching and recognition is a challenging task in computer vision probably due to the extensively computational overload posed by large and high dimensional data space. Indexing approaches can help achieving thousands of times in speedups when comparing to sequential search.
openaire   +1 more source

Adaptive bit allocation product quantization

Neurocomputing, 2016
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 is quantized separately with the same number of codewords.
Qin-Zhen Guo   +4 more
openaire   +1 more source

QUANTIZED SYMMETRIZATIONS AND ⋆-PRODUCTS

Quantum Theory and Symmetries, 2002
Mathematics
openaire   +1 more source

Structure Sensitive Hashing With Adaptive Product Quantization

IEEE Transactions on Cybernetics, 2016
Hashing has been proved as an attractive solution to approximate nearest neighbor search, owing to its theoretical guarantee and computational efficiency. Though most of prior hashing algorithms can achieve low memory and computation consumption by pursuing compact hash codes, however, they are still far beyond the capability of learning discriminative
Xianglong, Liu   +4 more
openaire   +2 more sources

Quantization based on a novel sample-adaptive product quantizer (SAPQ)

IEEE Transactions on Information Theory, 1999
Summary: We propose a novel feedforward adaptive quantization scheme called the sample-adaptive product quantizer (SAPQ). This is a structurally constrained vector quantizer that uses unions of product codebooks. SAPQ is based on a concept of adaptive quantization to the varying samples of the source and is very different from traditional adaptation ...
Kim, Dong Sik, Shroff, Ness B.
openaire   +1 more source

Accelerating Product Quantization Query Execution Runtime

Proceedings of the 2021 International Conference on Management of Data, 2021
Product Quantization is a method for approximate nearest neighbor search. I review and analyze two recent SIMD-based query acceleration techniques and propose an algorithmic solution agnostic to the underlying hardware. This new method is competitive in terms of runtime to the SIMD-based methods and alleviates their drawbacks: reduced accuracy and ...
openaire   +1 more source

The pointwise product in Weyl quantization

Journal of Physics A: Mathematical and General, 2004
The present paper is devoted to an analysis of the recently introduced Bracken product of operators (which is distributive, commutative and associative), whose symbol is the pointwise product of distributions, in the framework of Weyl's approach to quantization, consisting, roughly speaking, in associating functions on phase space (the simplest case \(\
Dubin, D. A., Hennings, M. A.
openaire   +2 more sources

KMS states and star product quantization

Reports on Mathematical Physics, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bordemann, Martin   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy