NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Recursive algorithms for two-dimensional smoothing using bicubic hermite polynomialIt is noted that in the past, smoothing splines originated from approximation theory have been successfully applied to data filtering and image smoothing problems. Even though the nonrecursive technique of smoothing splines gives an optimal solution, the amount of computation increases rapidly with the size of the two-dimensional data. A derivation is presented here of quarter-plane filtering algorithms that provide smoothed estimates of function values and their derivatives by fitting two-dimensional smoothing splines in a recursive manner. The derivation procedure sheds light on specific problems encountered in two-dimensional filtering problems. What is more, the amount of computation for this recursive processor increases only linearly with the size of the two-dimensional data. Because of certain approximations introduced in its derivation, this recursive processor becomes suboptimal.
Document ID
19830043499
Acquisition Source
Legacy CDMS
Document Type
Conference Proceedings
Authors
Kim, C. S.
(Rensselaer Polytechnic Inst. Troy, NY, United States)
Shen, C. N.
(Rensselaer Polytechnic Institute, Troy, NY, United States)
Date Acquired
August 11, 2013
Publication Date
January 1, 1981
Subject Category
Numerical Analysis
Meeting Information
Meeting: In: Conference on Decision and Control, 20th, and Symposium on Adaptive Processes
Location: San Diego, CA
Start Date: December 16, 1981
End Date: December 18, 1981
Sponsors: Navy
Accession Number
83A24717
Funding Number(s)
CONTRACT_GRANT: NAG1-61
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available