E-mail

E-mail a Wiley Online Library Link

M. Finckh, H. Dammertz and H. P. A. Lensch On Near Optimal Lattice Quantization of Multi-Dimensional Data Points Computer Graphics Forum 33

Version of Record online: 21 DEC 2013 | DOI: 10.1111/cgf.12273

Thumbnail image of graphical abstract

One of the most elementary application of a lattice is the quantization of real valued s-dimensional vectors into finite bit precision to make them representable by a digital computer. Most often, the simple s-dimensional regular grid is used for this task where each component of the vector is quantized individually. However, it is known that other lattices perform better regarding the average quantization error. A rank-1 lattices is a special type of lattice, where the lattice points can be described by a single s-dimensional generator vector.

Complete the form below and we will send an e-mail message containing a link to the selected article on your behalf

Required = Required Field

SEARCH