Efficient Beltrami filtering of color images via vector extrapolation

  • Authors:
  • Lorina Dascal;Guy Rosman;Ron Kimmel

  • Affiliations:
  • Computer Science Department, Technion, Institute of Technology, Haifa, Israel;Computer Science Department, Technion, Institute of Technology, Haifa, Israel;Computer Science Department, Technion, Institute of Technology, Haifa, Israel

  • Venue:
  • SSVM'07 Proceedings of the 1st international conference on Scale space and variational methods in computer vision
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Beltrami image flow is an effective non-linear filter, often used in color image processing. It was shown to be closely related to the median, total variation, and bilateral filters. It treats the image as a 2D manifold embedded in a hybrid spatial-feature space. Minimization of the image area surface yields the Beltrami flow. The corresponding diffusion operator is anisotropic and strongly couples the spectral components. Thus, there is so far no implicit nor operator splitting based numerical scheme for the PDE that describes Beltrami flow in color. Usually, this flow is implemented by explicit schemes, which are stable only for very small time steps and therefore require many iterations. At the other end, vector extrapolation techniques accelerate the convergence of vector sequences, without explicit knowledge of the sequence generator. In this paper, we propose to use the minimum polynomial extrapolation (MPE) and reduced rank extrapolation (RRE) vector extrapolation methods for accelerating the convergence of the explicit schemes for the Beltrami flow. Experiments demonstrate their stability and efficiency compared to explicit schemes.