Talk:Scale space implementation

Recursive filters figure

The idea with a figure to illustrate the effect of recursive filters is good. To give a better illustration of the discrete filters, however, it would be better to use a rectangular box for each individual value instead of as now a set of points that are connected by straight lines. Then, the graph of each filter would look like a histogram graph with distinct discontinuities between the filter coefficients instead of as now a stepwise linear continuous graph. Tpl 12:15, 2 September 2006 (UTC)[reply]

It's very hard to show how two families of sequences compare when using bar graphs. The dots show the discreteness, and the lines help you follow and see what compares with what. I'll play with it and see if I can come up with something better. Dicklyon 15:28, 2 September 2006 (UTC)[reply]

Truncation versus other approaches

tpl, why do you prefer to use a truncated FIR approach to smoothing filters, rather than windowed or a recursive filter? It seems to me that the truncation will always destroy the key property of no introduction of spurious maxima, where the convolution passes the small step edge across a localized signal feature in a non-cascaded application. It's also more more expensive and/or complex to use big FIR convolutions, rather than low-order filters. Dicklyon 23:28, 5 September 2006 (UTC)[reply]