Fast surface interpolation using hierarchical basis functions
Szeliski, R.
Digital Equipment Corp., Cambridge, MA;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Jun 1990
Volume: 12,
Issue: 6
On page(s): 513-528
ISSN: 0162-8828
References Cited: 45
CODEN: ITPIDJ
INSPEC Accession Number: 3724660
Digital Object Identifier: 10.1109/34.56188
Current Version Published: 2002-08-06
Abstract
An alternative to multigrid relaxation that is much easier to
implement and more generally applicable is presented. Conjugate gradient
descent is used in conjunction with a hierarchical (multiresolution) set
of basis functions. The resultant algorithm uses a pyramid to smooth the
residual vector before the direction is computed. Simulation results
showing the speed of convergence and its dependence on the choice of
interpolator, the number of smoothing levels, and other factors are
presented. The relationship of this approach to other multiresolution
relaxation and representation schemes is also discussed
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
