1998
DOI: 10.1109/18.705561
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of lattices for quantization

Abstract: A training algorithm for the design of lattices for vector quantization is presented. The algorithm uses a steepest descent method to adjust a generator matrix, in the search for a lattice whose Voronoi regions have minimal normalized second moment. The numerical elements of the found generator matrices are interpreted and translated into exact values. Experiments show that the algorithm is stable, in the sense that several independent runs reach equivalent lattices. The obtained lattices reach as low second m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
69
0

Year Published

2002
2002
2023
2023

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 44 publications
(72 citation statements)
references
References 45 publications
3
69
0
Order By: Relevance
“…According to [AE98], the lattice D + 10 is conjectured to be the optimal lattice quantizer. Conway and Sloane approximated G(K 12 ) ([CS99, Table 2.3]) using Monte-Carlo integration; our exact computation fits into their bounds.…”
Section: Coxeter Latticesmentioning
confidence: 99%
“…According to [AE98], the lattice D + 10 is conjectured to be the optimal lattice quantizer. Conway and Sloane approximated G(K 12 ) ([CS99, Table 2.3]) using Monte-Carlo integration; our exact computation fits into their bounds.…”
Section: Coxeter Latticesmentioning
confidence: 99%
“…A square grid may not be the optimal lattice [1] for our feature space, with SIFT-like descriptors, which are typically compared using Euclidean distance (but see also section 2.5). Nevertheless, we prefer this simple lattice structure as it is more intuitive and allows for easy interpretation and exploration of the feature space (see section 3).…”
Section: Discretizing High-dimensional Feature Spacesmentioning
confidence: 99%
“…y = (Hxt · (Hx) = xHHHHx = xHGx. (4) Consequently, one can state that G induces a quadratic form and is defmite positive because Il yl l > 0 for any x 7: 0 .…”
Section: A the Generator Matrixmentioning
confidence: 99%