• Login
    View Item 
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 33 (2014)
    • 33-Issue 1
    • View Item
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 33 (2014)
    • 33-Issue 1
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    On Near Optimal Lattice Quantization of Multi‐Dimensional Data Points

    Thumbnail
    View/Open
    v33i1pp271-281.pdf (1.658Mb)
    Date
    2014
    Author
    Finckh, M.
    Dammertz, H.
    Lensch, H. P. A.
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    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. Further, the number of points inside the unit cube [0, 1)s is arbitrary and can be directly enumerated by a single one‐dimensional integer value. By choosing a suitable generator vector the minimum distance between the lattice points can be maximized which, as we show, leads to a nearly optimal mean quantization error. We present methods for finding parameters for s‐dimensional maximized minimum distance rank‐1 lattices and further show their practical use in computer graphics applications.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.
    BibTeX
    @article {10.1111:cgf.12273,
    journal = {Computer Graphics Forum},
    title = {{On Near Optimal Lattice Quantization of Multi‐Dimensional Data Points}},
    author = {Finckh, M. and Dammertz, H. and Lensch, H. P. A.},
    year = {2014},
    publisher = {The Eurographics Association and John Wiley and Sons Ltd.},
    ISSN = {1467-8659},
    DOI = {10.1111/cgf.12273}
    }
    URI
    http://dx.doi.org/10.1111/cgf.12273
    Collections
    • 33-Issue 1

    Eurographics Association copyright © 2013 - 2023 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2023 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA