Statistical and geometrical way of model selection for a family of subdivision schemes

Abstract

The objective of this article is to introduce a generalized algorithm to produce the m-point n-ary approximating subdivision schemes (for any integer m, n ≥ 2). The proposed algorithm has been derived from uniform B-spline blending functions. In particular, we study statistical and geometrical/traditional methods for the model selection and assessment for selecting a subdivision curve from the proposed family of schemes to model noisy and noisy free data. Moreover, we also discuss the deviation of subdivision curves generated by proposed family of schemes from convex polygonal curve. Furthermore, visual performances of the schemes have been presented to compare numerically the Gibbs oscillations with the existing family of schemes.

Keywords

Approximating subdivision schemes / B-spline blending function / Convex polygon / Statistical and geometrical methods / Model selection and assessment

References

[1] Alboul L., Echeverria G., Rodrigues M.. Curvature Criteria to Fit Curves to Discrete Data. 20th European Workshop on Computational Geometry, Seville, 2004

[2] Aslam M., Mustafa G., Ghaffar A.. (2n−1)-point ternary approximating and interpolating subdivision schemes. Journal of Applied Mathematics, 2011, 2011: 12

[3] Amat S., Liandrat J.. On a nonlinear 4-point quaternary approximating subdivision schemes eliminating the Gibbs phenomenon. SeMA Journal, 2013, 62: 15-25

[4] Beccari C., Casiola G., Romani L.. An interpolating 4-point C2 ternary non-stationary subdivision scheme with tension control. Computer Aided Geometric Design, 2007, 24(4): 210-219

[5] Conti C., Hormann K.. Polynomial reproduction for univariate subdivision scheme of any arity. Approximation Theory, 2011, 163: 413-437

[6] Deslauriers G., Dubuc S.. Symmetric iterative interpolation processes. Constructive Approximation, 1989, 5: 49-68

[7] Dyn, N., Tutorial on multiresolution in geometric modeling summer school lecture notes series, Mathematics and Visualization, Iske, A., Quak, E. Michael S. (Eds.) Springer-Verlag, 2002.

[8] Hastie T., Tibshirani R., Friedman J.. The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2002, London: Springer-Verlag

[9] Lian J.-A.. On a-ary subdivision for curve design: I. 2m-point and (2m + 1)-point interpolatory schemes. Applications and Applied Mathematics: An International Journal, 2009, 4(1): 434-444

[10] Ko K. P.. A quaternary approximating 4-point subdivision scheme. The Journal of the Korean Society for Industrial and Applied Mathematics, 2009, 13(4): 307-314

[11] Mustafa, G., Deng, J., Ashraf, P. and Rehman, N. A., The mask of odd points n-ary interpolating subdi-vision scheme, Journal of Applied Mathematics, Article ID 205863, 2012, 20 pages.

[12] Mustafa G., Li H., Zhang J., Deng J.. ℓ₁-Regression based subdivision schemes for noisy data. Computer-Aided Design, 2015, 58: 189-199

[13] Mustafa G., Rehman N. A.. The mask of (2b+4)-point n-ary subdivision scheme. Computing, 2010, 90(1–2): 1-14

[14] Mustafa G., Ashraf P., Deng J.. Generalized and unified families of interpolating subdivision schemes. Numerical Mathematics: Theory, Methds and Applications, 2014, 7: 193-213

[15] Mustafa G., Khan F.. A new 4-point C3 quaternary approximating subdivision scheme. Abstract and Applied Analysis, 2009, 301967: 14

[16] Mustafa G., Ivrissimtzis I. P.. Model selection for the Dubuc-Deslauriers family of subdivision scheme. Proceeding of the 14th IMA Conference on Mathematics of Surfaces, 2013 155-162

[17] Rioul O.. Simple regularity for subdivision schemes. SIAM Journal on Mathematical Analysis, 1992, 23: 1544-1576

[18] Siddiqi S. S., Younis M.. The m-point quaternary approximating subdivision schemes. American Journal of Computational Mathematics, 2013, 3: 6-10

[19] Zheng, H., Hu, M. and Peng, G., p-ary subdivision generalizing B-splines, 2009 Second International Conference on Computer and Electrical Engineering, DOI: 10.1109/ICCEE.2009.204