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

Added missing cites

Browse Source
This commit is contained in:
MBulli
2018-02-19 21:12:13 +01:00
parent a46fe242e8
commit 601a93552d
4 changed files with 112 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
tex/chapters/mvg.tex
View File

@@ -55,7 +55,7 @@ Furthermore, only one addition and subtraction is required to calculate a single
Given a fast approximation scheme, it is necessary to construct a box filter analogous to a given Gaussian filter.
As given in \eqref{eq:gausfx} the solely parameter of the Gaussian kernel is the standard deviation $\sigma$.
The solely parameter of the Gaussian kernel is the standard deviation $\sigma$.
In contrast, the moving average filter is parametrized by its width $w$.
Therefore, in order to approximate the Gaussian filter of a given $\sigma$ a corresponding value of $w$ must be found.
Given $n$ iterations of moving average filters with identical widths the ideal width $\wideal$, as suggested by Wells~\cite{wells1986efficient}, is