2021
DOI: 10.1145/3423184
|View full text |Cite
|
Sign up to set email alerts
|

Fast Linear Interpolation

Abstract: We present fast implementations of linear interpolation operators for piecewise linear functions and multi-dimensional look-up tables. These operators are common for efficient transformations in image processing and are the core operations needed for lattice models like deep lattice networks, a popular machine learning function class for interpretable, shape-constrained machine learning. We present new strategies for an efficient compiler-based solution using MLIR to accelerate linear interpolation. For real-w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…Although, in our examples, the solution time of FEM was so much faster that continued solving the PDE with FEM on different adapted grids would likely still be considerably faster than solving and evaluating the PINN. In addition, we believe that the evaluation time in FEM could be significantly sped up using more appropriate interpolation methodology, such as Lin & Lee (2005) ; Zhang et al. (2021) .…”
Section: Discussionmentioning
confidence: 99%
“…Although, in our examples, the solution time of FEM was so much faster that continued solving the PDE with FEM on different adapted grids would likely still be considerably faster than solving and evaluating the PINN. In addition, we believe that the evaluation time in FEM could be significantly sped up using more appropriate interpolation methodology, such as Lin & Lee (2005) ; Zhang et al. (2021) .…”
Section: Discussionmentioning
confidence: 99%
“…(3) can then be detailed as Agreeably, [16] gather that the linear interpolation technique is simple but very useful. This is demonstrated by [17] when they used linear interpolation to reduce the training samples required in a Machine Learning algorithm and in [18] where linear interpolation was found to optimize the interpolation of Look-Up Tables (LTUs) on standard CPUs or more specifically, compute kernels. In [19], it was used alongside an artificial neural network to estimate the health of lithium-ion batteries in an online system.…”
Section: The Undetermined Cs Problemmentioning
confidence: 99%
“…This solves the problem of finding the necessary grid nodes surrounding any point inside an inhomogeneously spaced grid by projecting it to a homogeneous grid on which the localization is negligible in computational cost, i.e. it can only be left or right from the respectively localized node on the original grid [14]. The lookup table is pre-computed for each field during the import.…”
Section: δXmentioning
confidence: 99%