Skip to main content

Polyakov action minimization for efficient color image processing

Publication ,  Conference
Rosman, G; Tai, XC; Dascal, L; Kimmel, R
Published in: Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
December 20, 2012

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. © 2012 Springer-Verlag.

Duke Scholars

Published In

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

December 20, 2012

Volume

6554 LNCS

Issue

PART 2

Start / End Page

50 / 61

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Rosman, G., Tai, X. C., Dascal, L., & Kimmel, R. (2012). Polyakov action minimization for efficient color image processing. In Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics (Vol. 6554 LNCS, pp. 50–61). https://doi.org/10.1007/978-3-642-35740-4_5
Rosman, G., X. C. Tai, L. Dascal, and R. Kimmel. “Polyakov action minimization for efficient color image processing.” In Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 6554 LNCS:50–61, 2012. https://doi.org/10.1007/978-3-642-35740-4_5.
Rosman G, Tai XC, Dascal L, Kimmel R. Polyakov action minimization for efficient color image processing. In: Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. 2012. p. 50–61.
Rosman, G., et al. “Polyakov action minimization for efficient color image processing.” Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 6554 LNCS, no. PART 2, 2012, pp. 50–61. Scopus, doi:10.1007/978-3-642-35740-4_5.
Rosman G, Tai XC, Dascal L, Kimmel R. Polyakov action minimization for efficient color image processing. Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. 2012. p. 50–61.

Published In

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

December 20, 2012

Volume

6554 LNCS

Issue

PART 2

Start / End Page

50 / 61

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences