The rapid solution of surface interpolation and other regularization problems on massively parallel architectures is an important problem within computer vision. Fast relaxation algorithms can be used to integrate sparse data, resolve ambiguities in optic flow fields, and guide stereo matching algorithms. In the present paper, an alternative to multigrid relaxation which is much easier to implement is presented. This approach uses conjugate-gradient descent in conjunction with a hierarchical (multiresolution) set of basis functions. The resulting algorithm uses a pyramid to smooth the residual vector before the new direction is computed. Simulation results show the speed and its dependence on the choice of interpolator, the number of smoothing levels, and other factors. Also discussed is relationship of this approach to other multiresolution relaxation and representation schemes.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fast surface interpolation using hierarchical basis functions


    Contributors:


    Publication date :

    1989-01-01


    Size :

    570846 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    Multidimensional Aircraft Data Interpolation Using Radial Basis Functions

    Rendall, T. / Allen, C. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2007



    Adaptive Sampling for CFD Data Interpolation Using Radial Basis Functions

    Mackman, T. / Allen, C. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2009