CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2006 vol.28 Issue No.02 - February
Issue No.02 - February (2006 vol.28)
Hanno Scharr , IEEE Computer Society
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.29
In this paper, we present a new and efficient method to implement robust smoothing of low-level signal features: B-spline channel smoothing. This method consists of three steps: encoding of the signal features into channels, averaging of the channels, and decoding of the channels. We show that linear smoothing of channels is equivalent to robust smoothing of the signal features if we make use of quadratic B-splines to generate the channels. The linear decoding from B-spline channels allows the derivation of a robust error norm, which is very similar to Tukey's biweight error norm. We compare channel smoothing with three other robust smoothing techniques: nonlinear diffusion, bilateral filtering, and mean-shift filtering, both theoretically and on a 2D orientation-data smoothing task. Channel smoothing is found to be superior in four respects: It has a lower computational complexity, it is easy to implement, it chooses the global minimum error instead of the nearest local minimum, and it can also be used on nonlinear spaces, such as orientation space.
Index Terms- Robust smoothing, channel representation, diffusion filtering, bilateral filtering, mean-shift, B-spline, orientation smoothing.
Michael Felsberg, Per-Erik Forss?, Hanno Scharr, "Channel Smoothing: Efficient Robust Smoothing of Low-Level Signal Features", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.28, no. 2, pp. 209-222, February 2006, doi:10.1109/TPAMI.2006.29