This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Channel Smoothing: Efficient Robust Smoothing of Low-Level Signal Features
February 2006 (vol. 28 no. 2)
pp. 209-222
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.

[1] M.J. Black, G. Sapiro, D.H. Marimont, and D. Heeger, “Robust Anisotropic Diffusion,” IEEE Trans. Image Processing, vol. 7, no. 3, pp. 421-432, 1998.
[2] J. Weickert, “Theoretical Foundations of Anisotropic Diffusion in Image Processing,” Computing, supplemental 11, pp. 221-236, 1996.
[3] C.K. Chu, I.K. Glad, F. Godtliebsen, and J.S. Marron, “Edge-Preserving Smoothers for Image Processing,” J. Am. Statistical Assoc., vol. 93, no. 442, pp. 526-541, 1998.
[4] C. Tomasi and R. Manduchi, “Bilateral Filtering for Gray and Color Images,” Proc. Sixth Int'l Conf. Computer Vision, 1998.
[5] J. Weule, “Iteration Nichtlinearer Gauss-Filter in der Bildverarbeitung,” PhD thesis, Heinrich-Heine-Universität Düsseldorf 1994.
[6] V. Aurich and J. Weule, “Non-Linear Gaussian Filters Performing Edge Preserving Diffusion,” Proc. 17 DAGM-Symp., pp. 538-545, 1995.
[7] F. Godtliebsen, E. Spjotvoll, and J.S. Marron, “A Nonlinear Gaussian Filter Applied to Images with Discontinuities,” J. Nonparametric Statistics, vol. 8, pp. 21-43, 1997.
[8] S.M. Smith and J.M. Brady, “SUSAN-A New Approach to Low Level Image Processing,” Int'l J. Computer Vision, vol. 23, no. 1, pp. 45-78, 1997.
[9] K. Fukunaga and L.D. Hostetler, “The Estimation of the Gradient of a Density Function, with Applications in Pattern Recognition,” IEEE Trans. Information Theory, vol. 21, no. 1, pp. 32-40, 1975.
[10] Y. Cheng, “Mean Shift, Mode Seeking, and Clustering,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 790-799, Aug. 1995.
[11] D. Comaniciu and P. Meer, “Mean Shift: A Robust Approach Toward Feature Space Analysis,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 603-619, 2002.
[12] P.-E. Forssén, G.H. Granlund, and J. Wiklund, “Channel Representation of Colour Images,” Technical Report LiTH-ISY-R-2418, Dept. of Electrical Eng., Linköping Univ., 2002.
[13] P.-E. Forssén, “Low and Medium Level Vision Using Channel Representations,” PhD thesis, Linkoping Univ., Sweden, 2004.
[14] M. Felsberg and G. Granlund, “Anisotropic Channel Filtering,” Proc. 13th Scandinavian Conf. Image Analysis, pp. 755-762, 2003.
[15] N. Sochen, R. Kimmel, and R. Malladi, “A Geometrical Framework for Low Level Vision,” IEEE Trans. Image Processing, special issue on PDE-based image processing, vol. 7, no. 3, pp. 310-318, 1998.
[16] H.P. Snippe and J.J. Koenderink, “Discrimination Thresholds for Channel-Coded Systems,” Biological Cybernetics, vol. 66, pp. 543-551, 1992.
[17] G.H. Granlund, “An Associative Perception-Action Structure Using a Localized Space Variant Information Representation,” Proc. Int'l Workshop Algebraic Frames for the Perception-Action Cycle, 2000.
[18] K. Nordberg, G.H. Granlund, and H. Knutsson, “Representation and Learning of Invariance,” Proc. IEEE Int'l Conf. Image Processing, 1994.
[19] N.L. Lüdtke, R.C. Wilson, and E.R. Hancock, “Probabilistic Population Coding of Multiple Edge Orientation,” Proc. IEEE Int'l Conf. Image Processing, vol. II, pp. 865-868, 2002.
[20] P.-E. Forssén, “Sparse Representations for Medium Level Vision,” Lic. Thesis LiU-Tek-Lic-2001:06, Dept. of Electrical Eng., Linköping Univ., Feb. 2001.
[21] M. Felsberg, H. Scharr, and P.-E. Forssén, “The B-Spline Channel Representation: Channel Algebra and Channel Based Diffusion Filtering,” Technical Report LiTH-ISY-R-2461, Dept. of Electrical Eng., Linköping Univ., Sept. 2002.
[22] J. Weickert, “A Review of Nonlinear Diffusion Filtering,” Scale-Space Theory in Computer Vision, pp. 260-271, Berlin: Springer, 1997.
[23] P. Perona and J. Malik, “Scale-Space and Edge Detection Using Anisotropic Diffusion,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 7, pp. 629-639, July 1990.
[24] G. Winkler and V. Liebscher, “Smoothers for Discontinuous Signals,” J. Nonparametric Statistics, vol. 14, no. 1-2, pp. 203-222, 2002.
[25] A.K. Louis, P. Maaß, and A. Rieder, Wavelets. Stuttgart: Teubner, 1994.
[26] M. Jacob, T. Blu, and M. Unser, “A Unifying Approach and Interface for Spline-Based Snakes,” Proc. SPIE Medical Imaging: Image Processing, vol. 4322, pp. 340-347, 2001.
[27] M. Unser, “Splines— A Perfect Fit for Signal and Image Processing,” IEEE Signal Processing Magazine, vol. 16, pp. 22-38, Nov. 1999.
[28] E. Weisstein, “World of Mathematics,” http:/mathworld. wolfram.com, July 2003.
[29] C. de Boor, Splinefunktionen. Birkhäuser, 1990.
[30] R.N. Bracewell, The Fourier Transform and Its Applications. McGraw Hill, 1986.
[31] M.J. Black and A. Rangarajan, “On the Unification of Line Processes, Outlier Rejection, and Robust Statistics with Applications in Early Vision,” Int'l J. Computer Vision, vol. 19, no. 1, pp. 57-91, 1996.
[32] G. Dahlquist and Å. Björck, Numerical Mathematics and Scientific Computation, Philadelphia: SIAM, to appear.
[33] R.S. Zemel, P. Dayan, and A. Pouget, “Probabilistic Interpretation of Population Codes,” Neural Computation, vol. 10, no. 2, pp. 403-430, 1998.
[34] C.M. Bishop, Neural Networks for Pattern Recognition. New York: Oxford Univ. Press, 1995.
[35] M. Felsberg, P.-E. Forssén, and H. Scharr, “Supplemental Material for: Channel Smoothing,” http://computer.org/tpamiarchives.htm, 2005.
[36] A. Chambolle and B.J. Lucier, “Interpreting Translation-Invariant Wavelet Shrinkage as a New Image Smoothing Scale Space,” IEEE Trans. Image Processing, vol. 10, no. 7, pp. 993-1000, 2001.
[37] P. Mrázek, J. Weickert, and G. Steidl, “Correspondences between Wavelet Shrinkage and Nonlinear Diffusion,” Scale Space Methods in Computer Vision, L.D. Griffin and M. Lillholm, eds., pp. 101-116, Heidelberg: Springer, 2003.
[38] A.G. Bruce, I.M. Donoho, and R.D. Martin, “Denoising and Robust Nonlinear Wavelet Analysis,” Wavelet Applications, vol. 2242, Apr. 1994.
[39] P. Perona, “Orientation Diffusions,” IEEE Trans. Image Processing, vol. 7, no. 3, pp. 457-467, 1998.
[40] B. Tang, G. Sapiro, and V. Caselles, “Diffusion of General Data on Non-Flat Manifolds via Harmonic Maps Theory: The Direction Diffusion Case,” Int'l J. Computer Vision, vol. 36, no. 2, pp. 149-161, 2000.
[41] D. Tschumperlé and R. Deriche, “Orthonormal Vector Sets Regularization with PDES and Applications,” Int'l J. Computer Vision, vol. 50, no. 3, pp. 237-252, 2002.
[42] X. Pennec and N. Ayache, “Uniform Distribution, Distance and Expectation Problems for Geometric Features Processing,” J. Math. Imaging Vision, vol. 9, no. 1, pp. 49-67, 1998.
[43] T. Chan and J. Shen, “Variational Restoration of Nonflat Image Features: Models and Algorithms,” SIAM J. Applied Math., vol. 61, no. 4, pp. 1338-1361, 2000.
[44] L.A. Vese and S.J. Osher, “Numerical Methods for P-Harmonic Flows and Applications to Image Processing,” SIAM J. Numerical Analysis, vol. 40, no. 6, pp. 2085-2104, 2002.
[45] R. Kimmel and N. Sochen, “Orientation Diffusion or How to Comb a Porcupine,” J. Visual Comm. and Image Representation, pp. 238-248, 2001.
[46] D. Comaniciu and P. Meer, “Mean Shift Analysis and Applications,” Proc. Int'l Conf. Computer Vision, pp. 1197-1203, Sept. 1999.
[47] M. Felsberg and G. Sommer, “The Monogenic Signal,” IEEE Trans. Signal Processing, vol. 49, no. 12, pp. 3136-3144, Dec. 2001.
[48] G.H. Granlund and H. Knutsson, Signal Processing for Computer Vision. Dordrecht: Kluwer Academic, 1995.
[49] G.H. Granlund, “In Search of a General Picture Processing Operator,” Computer Graphics and Image Processing, vol. 8, pp. 155-173, 1978.
[50] M. Felsberg and G. Sommer, “A New Extension of Linear Signal Processing for Estimating Local Properties and Detecting Features,” Proc. DAGM Symp., G. Sommer, N. Kruger, and C. Perwass, eds., pp. 195-202, 2000.
[51] B. Johansson, “Representing Multiple Orientations in 2D with Orientation Channel Histograms,” Technical Report LiTH-ISY-R-2475, Dept. of Electrical Eng., Linköping Univ., Nov. 2002.
[52] H. Knutsson and M. Andersson, “Robust N-Dimensional Orientation Estimation Using Quadrature Filters and Tensor Whitening,” Proc. IEEE Int'l Conf. Acoustics, Speech, Signal Processing, Apr. 1994.

Index Terms:
Index Terms- Robust smoothing, channel representation, diffusion filtering, bilateral filtering, mean-shift, B-spline, orientation smoothing.
Citation:
Michael Felsberg, Per-Erik Forss?, Hanno Scharr, "Channel Smoothing: Efficient Robust Smoothing of Low-Level Signal Features," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 2, pp. 209-222, Feb. 2006, doi:10.1109/TPAMI.2006.29
Usage of this product signifies your acceptance of the Terms of Use.