Optimal Piecewise Linear Function Approximation for GPU-based Applications
Daniel Berj\'on, Guillermo Gallego, Carlos Cuevas, Francisco Mor\'an, and Narciso Garc\'ia

TL;DR
This paper introduces an efficient piecewise linear approximation method for complex functions, optimized for GPU implementation, significantly reducing computational costs in real-time computer vision applications.
Contribution
It presents a novel, nearly optimal piecewise linear approximation technique with tight error bounds, tailored for GPU acceleration, improving accuracy and efficiency over previous methods.
Findings
Outperforms previous approaches in GPU environments
Provides asymptotically tight error bounds
Effectively approximates functions like Gaussian in real-time
Abstract
Many computer vision and human-computer interaction applications developed in recent years need evaluating complex and continuous mathematical functions as an essential step toward proper operation. However, rigorous evaluation of this kind of functions often implies a very high computational cost, unacceptable in real-time applications. To alleviate this problem, functions are commonly approximated by simpler piecewise-polynomial representations. Following this idea, we propose a novel, efficient, and practical technique to evaluate complex and continuous functions using a nearly optimal design of two types of piecewise linear approximations in the case of a large budget of evaluation subintervals. To this end, we develop a thorough error analysis that yields asymptotically tight bounds to accurately quantify the approximation performance of both representations. It provides an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
