Sciweavers

Share
SIBGRAPI
2008
IEEE

Approximations by Smooth Transitions in Binary Space Partitions

9 years 2 months ago
Approximations by Smooth Transitions in Binary Space Partitions
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.
Marcos Lage, Alex Laier Bordignon, Fabiano Petrone
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where SIBGRAPI
Authors Marcos Lage, Alex Laier Bordignon, Fabiano Petronetto, Alvaro Veiga, Geovan Tavares, Thomas Lewiner, Hélio Lopes
Comments (0)
books