IPP Software Navigation Tools IPP Links Communication Pan-STARRS Links

Changeset 2174


Ignore:
Timestamp:
Oct 19, 2004, 4:27:32 PM (22 years ago)
Author:
Paul Price
Message:

Generalised entry on Gaussian smoothing.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/doc/pslib/psLibADD.tex

    r2042 r2174  
    1 %%% $Id: psLibADD.tex,v 1.48 2004-10-09 03:29:29 price Exp $
     1%%% $Id: psLibADD.tex,v 1.49 2004-10-20 02:27:32 price Exp $
    22\documentclass[panstarrs]{panstarrs}
    33
     
    102102Smoothing may occasionally be perfomed on data.  We present the
    103103algorithms for two typical versions: boxcar and Gaussian smoothing.
    104 In both smoothing techniques, given a series of data values $f_i$, the
    105 smoothed values $g_i$ are determined by calculating a linear
    106 combination based on the input data point and its nearest $2N$
     104In both smoothing techniques, given a series of data values $f_i(x_i)$
     105where $x_i$ are the values of the corresponding to the center of the
     106bin, the smoothed values $g_i(x_i)$ are determined by calculating a
     107linear combination based on the input data point and its nearest $2N$
    107108neighbors in the form:
    108109
    109110\begin{equation}
    110  g_i = \sum_{n=-N}^N c_n f_i
    111 \end{equation}
    112 %
    113 where the values of $c_n$ determine the filter type.  For boxcar
    114 smoothing, the values $c_n$ are constant, and must be equal to $1/(2N
    115 + 1)$ to maintain the zeroth moment of the data (care must be taken at
    116 the ends of the data range to reduce the value of $c_n$ as fewer input
    117 data points may be used).  For Gaussian smoothing, the crucial
    118 parameter is $\sigma$, the standard deviation.  The value of $N$
    119 should be chosen to be large enough to sample the Gaussian, $N =
    120 5\sigma$, and the values of $c_n$ are then just the Gaussian curve:
    121 
    122 \begin{equation}
    123 c_n = \frac{e^{\frac{-n^2}{2\sigma^2}}}{\sqrt{2\pi\sigma^2}}
     111g_i = \sum_{j=i_{\rm min}}^{i_{\rm max}} c_{ij} f_j
     112\end{equation}
     113%
     114where the values of $c_{ij}$ determine the filter type.  For boxcar
     115smoothing, the values $c_{ij}$ are constant and scaled to maintain the
     116zeroth moment of the data (care must be taken at the ends of the data
     117range to reduce the value of $c_{ij}$ as fewer input data points may
     118be used).  For Gaussian smoothing, the crucial parameter is
     119$\sigma_x$, the standard deviation.  The values of $i_{\rm min}$ and
     120$i_{\rm max}$ are functions of the standard deviation: $i_{\rm min}$
     121corresponds to the bin in which $x_i - N\sigma_x$ is found; similarly
     122$i_{\rm max}$ is the bin corresponding to $x_i + N\sigma_x$.  The
     123value of $N$ should be chosen to be large enough to sample the
     124Gaussian, $N = 5$.  The values of $c_{ij}$ are then just the Gaussian
     125curve:
     126
     127\begin{equation}
     128c_{ij} = \frac{e^{\frac{-(x_j - x_i)^2}{2\sigma_x^2}}}{\sqrt{2\pi\sigma_x^2}}
    124129\end{equation}
    125130
Note: See TracChangeset for help on using the changeset viewer.