FHWS/Fusion2018
Archived
4
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Language

Browse Source
This commit is contained in:
MBulli
2018-03-12 23:24:55 +01:00
parent b76b07b485
commit 9f098887db
5 changed files with 30 additions and 29 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
tex/chapters/conclusion.tex
View File

@@ -1,12 +1,12 @@
\section{Conclusion}
Within this paper a novel approach for rapid approximation of the KDE was presented.
This is achieved by considering the discrete convolution structure of the BKDE and thus elaborate its connection to digital signal processing, especially the Gaussian filter.
Using a box filter as an appropriate approximation results in an efficient computation scheme with a fully linear complexity and a negligible overhead, as confirmed by the utilized experiments.
This is achieved by considering the discrete convolution structure of the BKDE and thus elaborating its connection to digital signal processing, especially the Gaussian filter.
Using a box filter as an appropriate approximation results in an efficient computation scheme with a fully linear complexity and a negligible overhead, as demonstrated by the utilized experiments.
The analysis of the error showed that the method exhibits an similar error behaviour compared to the BKDE.
The analysis of the error showed that the method shows an similar error behaviour compared to the BKDE.
In terms of calculation time, our approach outperforms other state of the art implementations.
Despite being more efficient than other methods, the algorithmic complexity still increases in its exponent with increasing number of dimensions.
Despite being more efficient than other methods, the algorithmic complexity still increases in its exponent with an increasing number of dimensions.
%future work kurz
Finally, such a fast computation scheme makes the KDE more attractive for real time use cases.