AI Chat AI Image Generator AI Video Text to Speech

Random projection trees for vector quantization

05/09/2008

∙

by Sanjoy Dasgupta, et al.

∙

∙

A simple and computationally efficient scheme for tree-structured vector quantization is presented. Unlike previous methods, its quantization error depends only on the intrinsic dimension of the data distribution, rather than the apparent dimension of the space in which the data happen to lie.

Sanjoy Dasgupta
28 publications
Yoav Freund
24 publications

page 1

page 2

page 3

page 4

research

∙ 05/09/2012

Which Spatial Partition Trees are Adaptive to Intrinsic Dimension?

Recent theory work has found that a special type of spatial partition tr...

0 Nakul Verma, et al. ∙

research

∙ 03/31/2022

Ternary and Binary Quantization for Improved Classification

Dimension reduction and data quantization are two important methods for ...

0 Weizhi Lu, et al. ∙

research

∙ 07/08/2019

Multi-Scale Vector Quantization with Reconstruction Trees

We propose and study a multi-scale approach to vector quantization. We d...

2 Enrico Cecini, et al. ∙

research

∙ 11/14/2019

The Canonical Distortion Measure for Vector Quantization and Function Approximation

To measure the quality of a set of vector quantization points a means of...

0 Jonathan Baxter, et al. ∙

research

∙ 06/04/2019

On General Lattice Quantization Noise

The problem of constructing lattices such that their quantization noise ...

0 Tal Gariby, et al. ∙

research

∙ 09/23/2015

A review of learning vector quantization classifiers

In this work we present a review of the state of the art of Learning Vec...

0 David Nova, et al. ∙

research

∙ 04/11/2006

Concerning the differentiability of the energy function in vector quantization algorithms

The adaptation rule for Vector Quantization algorithms, and consequently...

0 Dominique Lepetz, et al. ∙