Christoph Florian Schaller - FU Berlin, FB MI
Christoph Florian Schaller - FU Berlin, FB MI
Christoph Florian Schaller - FU Berlin, FB MI
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Christoph</strong> <strong>Schaller</strong> - STORMicroscopy 16<br />
Thus we systematically perform least squares<br />
ts of a pixelated Gaussian to a Gaussian on a<br />
grid with equally distributed spot centers within<br />
one pixel, which can be seen in Figure 3.2. The<br />
observed eects are easier to understand remembering<br />
that a 2D Gaussian is the combination<br />
of 1D Gaussians in x- and y- direction. Now as<br />
long as the center is located at 0, 0.5 or 1 for one<br />
coordinate, the Gaussian distribution is symmetric<br />
with respect to the pixel grid in that direction<br />
and therefore this center coordinate coincides<br />
with the one of the t. Nevertheless for all<br />
other cases we detect a tendency towards 0.5 as<br />
indicated by the arrows, which are amplied by<br />
a factor of 20. The fact, that the tendency goes<br />
towards 0.5 and not 0 or 1 is probably caused by<br />
starting the tting iteration in the center of the<br />
local maximum pixel.<br />
Figure 3.2: Shift of tted spot centers due to pixelation,<br />
spot diameter 5 pixels.<br />
For a spot size of 5 pixels (500 nm for the common pixel size of 100 nm) we measure an average<br />
systematic error of 4 · 10 −3 px (0.4 nm) and a maximal error of 6 · 10 −3 px (0.6 nm) already for<br />
tting the perfect Gaussian. The existence of this systematic error coincides with the observed error<br />
dierence between numerical integrations and pixelated algorithms (e.g. Figure 4.5). We will quantify<br />
the observed eects in Chapter 4.4.<br />
All used algorithms were programmed in MATLAB R○ , for further information consider Appendix<br />
A.1.