Pairwise Quantization

We consider the task of lossy compression of high-dimensional vectors through quantization. We propose the approach that learns quantization parameters by minimizing the distortion of scalar products and squared distances between pairs of points. This is in contrast to previous works that obtain these parameters through the minimization of the reconstruction error of individual points. The proposed approach proceeds by finding a linear transformation of the data that effectively reduces the minimization of the pairwise distortions to the minimization of individual reconstruction errors. After such transformation, any of the previously-proposed quantization approaches can be used. Despite the simplicity of this transformation, the experiments demonstrate that it achieves considerable reduction of the pairwise distortions compared to applying quantization directly to the untransformed data

Binary Biometric Representation through Pairwise Adaptive Phase Quantization

Extracting binary strings from real-valued biometric templates is a fundamental step in template compression and protection systems, such as fuzzy commitment, fuzzy extractor, secure sketch, and helper data systems. Quantization and coding is the straightforward way to extract binary representations from arbitrary real-valued biometric modalities. In this paper, we propose a pairwise adaptive phase quantization (APQ) method, together with a long-short (LS) pairing strategy, which aims to maximize the overall detection rate. Experimental results on the FVC2000 fingerprint and the FRGC face database show reasonably good verification performances.\ud \u

On the superfluidity of classical liquid in nanotubes

In 2001, the author proposed the ultra second quantization method. The ultra second quantization of the Schr\"odinger equation, as well as its ordinary second quantization, is a representation of the N-particle Schr\"odinger equation, and this means that basically the ultra second quantization of the equation is the same as the original N-particle equation: they coincide in 3N-dimensional space. We consider a short action pairwise potential V(x_i -x_j). This means that as the number of particles tends to infinity, $N\to\infty$, interaction is possible for only a finite number of particles. Therefore, the potential depends on N in the following way: $V_N=V((x_i-x_j)N^{1/3})$. If V(y) is finite with support $\Omega_V$, then as $N\to\infty$ the support engulfs a finite number of particles, and this number does not depend on N. As a result, it turns out that the superfluidity occurs for velocities less than $\min(\lambda_{\text{crit}}, \frac{h}{2mR})$, where $\lambda_{\text{crit}}$ is the critical Landau velocity and R is the radius of the nanotube.Comment: Latex, 20p. The text is presented for the International Workshop "Idempotent and tropical mathematics and problems of mathematical physics", Independent University of Moscow, Moscow, August 25--30, 2007 and to be published in the Russian Journal of Mathematical Physics, 2007, vol. 15, #

Exactly solvable model of three interacting particles in an external magnetic field

The quantum mechanical problem of three identical particles, moving in a plane and interacting pairwise via a spring potential, is solved exactly in the presence of a magnetic field. Calculations of the pair--correlation function, mean distance and the cluster area show a quantization of these parameters. Especially the pair-correlation function exhibits a certain number of maxima given by a quantum number. We obtain Jastrow pre-factors which lead to an exchange correlation hole of liquid type, even in the presence of the attractive interaction between the identical electrons.Comment: 8 pages 3 figure

Fluctuation-induced interactions between dielectrics in general geometries

We study thermal Casimir and quantum non-retarded Lifshitz interactions between dielectrics in general geometries. We map the calculation of the classical partition function onto a determinant which we discretize and evaluate with the help of Cholesky factorization. The quantum partition function is treated by path integral quantization of a set of interacting dipoles and reduces to a product of determinants. We compare the approximations of pairwise additivity and proximity force with our numerical methods. We propose a ``factorization approximation'' which gives rather good numerical results in the geometries that we study