This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
smp.smooth [2010/10/27 18:27] jochen |
smp.smooth [2010/10/28 02:09] (current) jochen updated the algorithm description to reflect an update in code |
||
---|---|---|---|
Line 5: | Line 5: | ||
===== Requirements ===== | ===== Requirements ===== | ||
- | To perform the smoothing, you must have a valid SMP object as well as the SRF object that contains the respective, neighborhood information. | + | To perform the smoothing, you must have a valid SMP object as well as the SRF object that contains the respective neighborhood information. |
===== Notes ===== | ===== Notes ===== | ||
Line 46: | Line 46: | ||
In other words, the central kernel weight remains with the old value and the remainder to 1 is split across the next neighbors according to the kernel weight given by their distance to the vertex. This approach takes both the neighborhood and the distance of vertices into account. | In other words, the central kernel weight remains with the old value and the remainder to 1 is split across the next neighbors according to the kernel weight given by their distance to the vertex. This approach takes both the neighborhood and the distance of vertices into account. | ||
+ | After the smoothing is performed, the mean of the map is adjusted to reflect the original mean value (to counter rounding errors if a high number of iterations was used), **if and only if** the standard deviation is not smaller than the sum (for most skewed maps this is the case). |