Locally adapted hierarchical basis preconditioning

  • Szeliski R
  • 70


    Mendeley users who have this article in their library.
  • 43


    Citations of this article.


This paper develops locally adapted hierarchical basis functions for effectively preconditioning large optimization problems that arise in computer graphics applications such as tone mapping, gradient-domain blending, colorization, and scattered data interpolation. By looking at the local structure of the coefficient matrix and performing a recursive set of variable eliminations, combined with a simplification of the resulting coarse level problems, we obtain bases better suited for problems with inhomogeneous (spatially varying) data, smoothness, and boundary constraints. Our approach removes the need to heuristically adjust the optimal number of preconditioning levels, significantly outperforms previously proposed approaches, and also maps cleanly onto data-parallel architectures such as modern CPUs. Copyright © 2006 by the Association for Computing Machinery, Inc.

Author-supplied keywords

  • as well as the
  • col-
  • computational photography
  • fast pde solution
  • gpu acceleration
  • multilevel techniques
  • orization
  • parallel algo-
  • poisson blending
  • regularized solution of computer
  • rithms
  • vi-
  • witkin 1988

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Richard Szeliski

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free