Polyakov Action Minimization for Efficient Color Image Processing
The Laplace-Beltrami operator is an extension of the Laplacian from flat domains to curved manifolds. It was proven to be useful for color image processing as it models a meaningful coupling between the color channels. This coupling is naturally expressed in the Beltrami framework in which a color image is regarded as a two dimensional manifold embedded in a hybrid, five-dimensional, spatial-chromatic (x,y,R,G,B) space.
The Beltrami filter defined by this framework minimizes the Polyakov action, adopted from high-energy physics, which measures the area of the image manifold. Minimization is usually obtained through a geometric heat equation defined by the Laplace-Beltrami operator. Though efficient simplifications such as the bilateral filter have been proposed for the single channel case, so far, the coupling between the color channel posed a non-trivial obstacle when designing fast Beltrami filters.
Here, we propose to use an augmented Lagrangian approach to design an efficient and accurate regularization framework for color image processing by minimizing the Polyakov action. We extend the augmented Lagrangian framework for total variation (TV) image denoising to the more general Polyakov action case for color images, and apply the proposed framework to denoise and deblur color images.
KeywordsLaplace-Beltrami diffusion optimization denoising PDEs
Unable to display preview. Download preview PDF.
- 1.Antoni Buades, B.C., Morel, J.-M.: A review of image denoising algorithms, with a new one. SIAM Interdisciplinary Journal 4, 490–530 (2005)Google Scholar
- 5.Bresson, X., Chan, T.: Fast dual minimization of the vectorial total variation norm and applications to color image processing. CAM-Report 07-25, UCLA (2007)Google Scholar
- 7.Carter, J.L.: Dual methods for total variation-based image restoration. CAM-Report 02-13, UCLA (April 2002)Google Scholar
- 10.Dabov, K., Foi, A., Katkovnik, V., Egiazarian, K.: Image restoration by sparse 3D transform-domain collaborative filtering. In: Astola, J.T., Egiazarian, K.O., Dougherty, E.R. (eds.) Proc. SPIE, vol. 6812 (2008)Google Scholar
- 14.Goldluecke, B., Cremers, D.: An approach to vectorial total variation based on geometric measure theory. In: Computer Vision and Pattern Recognition (2010)Google Scholar
- 16.Kaftory, R., Sochen, N., Zeevi, Y.Y.: Variational blind deconvolution of multi-channel images. IJIST 15(1), 56–63 (2005)Google Scholar
- 17.Kimmel, R.: Numerical Geometry of Images: Theory, Algorithms, and Applications. Springer (2003)Google Scholar
- 23.Powell, M.J.: Optimization. chapter A method for nonlinear constraints in minimization problems, pp. 283–298. Academic Press (1969)Google Scholar
- 24.Rosman, G., Dascal, L., Kimmel, R., Sidi, A.: Efficient beltrami image filtering via vector extrapolation methods. SIAM J. Imag. Sci. (3), 858–878 (2008)Google Scholar
- 25.Rosman, G., Tai, X.-C., Kimmel, R., Dascal, L.: Polyakov action minimization for efficient color image processing. Technical Report CIS-2010-04, Technion (2010)Google Scholar
- 32.Tai, X.-C., Wu, C.: Augmented Lagrangian method, dual methods and split Bregman iteration for ROF model. In: SSVM, pp. 502–513 (2009)Google Scholar
- 33.Tomasi, C., Manduchi, R.: Bilateral filtering for gray and color images. In: Int. Conf. on Comp. Vision, pp. 836–846 (1998)Google Scholar
- 36.Wu, C., Zhang, J., Tai, X.-C.: Augmented Lagrangian method for total variation restoration with non-quadratic fidelity. CAM Report 09-82, UCLA (December 2009)Google Scholar