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

added todos to all chapters

Browse Source
This commit is contained in:
toni
2018-02-14 19:30:33 +01:00
parent 040572cfe6
commit a6bf369407
5 changed files with 52 additions and 38 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
tex/chapters/relatedwork.tex
View File

@@ -44,6 +44,7 @@ However, reducing the sample size by distributing the data on a equidistant grid
Silverman \cite{silverman1982algorithm} originally suggested to combine adjacent data points into data bins, which results in a discrete convolution structure of the KDE.
Allowing to efficiently compute the estimate using a FFT algorithm.
This approximation scheme was later called binned KDE (BKDE) and was extensively studied \cite{fan1994fast} \cite{wand1994fast} \cite{hall1996accuracy} \cite{holmstrom2000accuracy}.
While the FFT algorithm poses an efficient algorithm for large sample sets, it adds an noticeable overhead for smaller ones.
The idea to approximate a Gaussian filter using several box filters was first formulated by Wells \cite{wells1986efficient}.
Kovesi \cite{kovesi2010fast} suggested to use two box filters with different widths to increase accuracy maintaining the same complexity.