Approximations by smooth transitions in binary space partitions

Approximations by smooth transitions in binary space partitions
Marcos Lage, Alex Bordignon, Fabiano Petronetto, Álvaro Veiga, Geovan Tavares, Thomas Lewiner, Hélio Lopes

Abstract:

This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Space Partitions Trees with the statistical robustness of Smooth Transition Regression Trees. The construction of the tree is straightforward and easily controllable, using error-driven metrics or external constraints. Moreover, it leads to a concise representation. Applications on synthetic and real data, both scalar and vector-valued demonstrated the effectiveness of this approach.

Downloads:

PDF paper (4.7 MB)
PPT presentation (4.2 MB)

BibTeX:

@inproceedings{bsptstree_sibgrapi,
    author = {Marcos Lage and Alex Bordignon and Fabiano Petronetto and Álvaro Veiga and Geovan Tavares and Thomas Lewiner and Hélio Lopes},
    title = {Approximations by smooth transitions in binary space partitions},
    year = {2008},
    month = {october},
    booktitle = {Sibgrapi 2008 (XXI Brazilian Symposium on Computer Graphics and Image Processing)},
    pages = {230--236},
    publisher = {IEEE},
    address = {Campo Grande, MT},
    doi = {10.1109/SIBGRAPI.2008.7},
    url = {\url{http://thomas.lewiner.org/pdfs/bsptstree_sibgrapi.pdf}}
}