|
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 these 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 improvement upon previous error estimates and allows the user to control the tradeoff between the approximation error and the number of evaluation subintervals. To guarantee real-time operation, the method is suitable for, but not limited to, an efficient implementation in modern graphics processing units, where it outperforms previous alternative approaches by exploiting the fixed-function interpolation routines present in their texture units. The proposed technique is a perfect match for any application requiring the evaluation of continuous functions; we have measured in detail its quality and efficiency on several functions, and, in particular, the Gaussian function because it is extensively used in many areas of computer vision and cybernetics, and it is expensive to evaluate. | |
|
International
|
Si |
|
JCR
|
Si |
|
Title
|
Ieee Transactions on Cybernetics |
|
ISBN
|
2168-2267 |
|
Impact factor JCR
|
3,469 |
|
Impact info
|
Datos JCR del año 2014 |
|
Volume
|
|
|
|
10.1109/TCYB.2015.2482365 |
|
Journal number
|
|
|
From page
|
1 |
|
To page
|
12 |
|
Month
|
SIN MES |
|
Ranking
|
|