Presenting Univariate, Linear and Stationary Subdivision Schemes for Refining Noisy Data

Exploring subdivision schemes for refining noisy data

Abstract

This is the principal endeavour to plan subdivision schemes for noisy data. We present and dissect univariate, linear, and stationary subdivision schemes for refining noisy data, by fitting nearby least squares polynomials. We present primal schemes, with refinement rules dependent on locally fitting linear polynomials to the data, and concentrate their convergence, smoothness, and basic limit functions. Primal schemes and schemes identified with noisy data are first talked about, in light of fitting linear polynomials to the data, and concentrate their convergence, smoothness, and basic limit functions. In this investigation we manage the issue of-how to surmised a function from its noisy examples by subdivision schemes.