Journal of Applied Mathematics

Volume 2014 (2014), Article ID 628285, 7 pages

http://dx.doi.org/10.1155/2014/628285

Research Article

A Six-Point Variant on the Lane-Riesenfeld Algorithm

Pakeeza Ashraf,¹ Ghulam Mustafa,¹ and Jiansong Deng²

¹Department of Mathematics, The Islamia University of Bahawalpur, Bahawalpur 63100, Pakistan

²Department of Mathematics, University of Science and Technology of China, Hefei 230026, China

Received 30 November 2013; Accepted 15 April 2014; Published 8 May 2014

Academic Editor: Mohamad Alwash

Copyright © 2014 Pakeeza Ashraf et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

We apply six-point variant on the Lane-Riesenfeld algorithm to obtain a new family of subdivision schemes. We also determine the support, smoothness, Hölder regularity, magnitude of the artifact, and the shrinkage effect due to the change of integer smoothing parameter that characterizes the members of the family. The degree of polynomial reproduction also has been discussed. It is observed that the proposed schemes have less shrinkage effect and as a result better preserve the shape of control polygon.

1. Introduction

The Lane-Riesenfeld algorithm [1] is a competent subdivision algorithm for subdividing uniform B-splines. To subdivide a B-spline curve, the algorithm is composed of two phases. The first phase doubles the control point by simply taking each control point twice. This step is followed by a sequence of smoothing operators which is midpoint averaging. By applying this subdivision process recursively, a sequence of piecewise linear curves is generated that in the limit converges to the uniform B-spline defined by the original control points. We may refer the articles [2–4] to the readers for further insight about subdivision schemes. However, for smoothness of the schemes, we may refer to [5–7].

In literature, there are different variants which are applied on the Lane-Riesenfeld algorithm. For example, Schaefer et al. [8] replaced the linear smoothing operator by nonlinear averaging rule in the Lane-Riesenfeld algorithm. They replaced the arithmetic mean with geometric mean to produce a subdivision scheme. Hormann and Sabin [9] offered a family of subdivision schemes by the convolution of uniform B-spline with kernel. Schaefer and Goldman [10] presented an algorithm for subdividing nonuniform B-splines of arbitrary degree in a manner similar to the Lane-Riesenfeld subdivision algorithm for uniform B-splines of arbitrary degree. Cashman et al. [11] presented generalized Lane-Riesenfeld algorithm; they used same operator to define the refine and each smoothing stage. They applied four-point [12] variant on the Lane-Riesenfeld algorithm to introduce new family of schemes.

The best choice of smoothing operator is the one which keep the sense of balance among different properties of the schemes. For example, some of the smoothing operators give high degree of smoothness but very low degree of polynomial reproduction. So, choosing smoothing operator is a challenging task. One of the advantages of the proposed smoothing operator in this paper is that it keeps the balance among different properties of the schemes.

In this paper, we apply six-point variant on the Lane-Riesenfeld algorithm to introduce family of subdivision schemes. Proposed family of schemes comprises two stages, that is, refine and smoothing, similar to the Lane-Riesenfeld algorithm, but the only difference is that we have used refine stage to introduce new points in the same way as each smoothing stage. We also show how the support, smoothness, Hölder regularity, magnitude of the artifact, and the shrinkage effect change with the change of integer smoothing parameter that categorizes the members of the family. Moreover, we find that each member of the family has quintic polynomial reproduction. We have the following findings.

(i)The proposed smoothing operator keeps a balance among different properties of the schemes. It also gives best degree of polynomial reproduction.(ii)For the fixed number of control points, the number of smoothing stages is reciprocal to the magnitude of the artifacts.(iii)Level of continuity of the schemes does not increase in general by increasing the smoothing stage. However, there are upper and lower bounds on Hölder continuity which grow gradually with the increase of smoothing stage.(iv)The proposed schemes have less shrinkage effect and as a result better preserve the shape of control polygon.(v)The smoothing stages affect the shrinkage in the limit curve while refine stages are not the factor of this effect.

2. The -Schemes

Lane-Riesenfeld algorithm performs on an input sequence by using a refine stage followed by smoothing stages . A subdivision step is therefore , where is defined as refine stage in which each control point is doubled. is the smoothing stage in which midpoint averaging is used to compute new control points; that is,

The -point scheme [13] samples a local quintic interpolant to every adjacent values just like the Lane-Riesenfeld smoothing operator which samples a local linear interpolant between every two adjacent values. This offers smoothing operator as

The new algorithm uses refine stage

So, the subdivision operator for new family of schemes is given by

where refine stage is pursued by smoothing stages . We call this family of schemes as the -schemes. When we take th smoothing stage, then it reduces to the novel six-point scheme [13]. By increasing the number of smoothing stages, that is, , we get new subdivision schemes. We can easily derive mask of the -schemes for different values of as follows.

The factored form of the smoothing operator and refine stage can be written as

So, it is clear from (4) that the symbol of the -schemes with smoothing stages can be written as

with

where

In Table 1, we present the mask and complexity of the proposed schemes corresponding to and .

Table 1: Complexity, support, and mask of the -schemes corresponding to different values of , and here shows complexity of the schemes (i.e., 6-, 8-, 11-, and 13-point schemes) and stands for support width.

Mask

0
6
10
3, 0, −25, 0, 150, 256, 150, 0, −25, 0, 3

1
8
15
9, −75, 375, 1075, −3375, −6723, 17175, 57075, 57075, 17175, −6723, −3375, 1075, 375, −75, 9

2
11
20
           16223412, 9920100, 399750, 1798600, −135000, 283608, 7775, −16050, 4350, −450, 27

3
13
25
81, −2025, 28350, −220350, 1008900, −1087220, −8846550, 42100950, 68212925,  

        −277340325, −404933940, 1216712500, 3659334000, 3659334000, 1216712500, −404933940,  

        −277340325, 68212925, 42100950, −8846550, −1087220, 1008900, −220350, 28350, −2025, 81

Remark 1 (support of the -schemes). The basis function is the map from positions in the domain to the limit curve of the refinement corresponding to a single old vertex having a unit value and all the others zero.

Since the smoothing operator makes use of six adjacent values to insert a new one, the number of nonzero entries in the mask of is and the number of nonzero entries in the mask of refine stage is ; therefore, by following [14], we conclude that support width of basis limit function for and is and , respectively.

Since the mask of -schemes is obtained by applying refine stage on initial data followed by smoothing stages , then the support width of basis limit function for the -schemes is . In Table 1, we present supports of some of the -schemes. By applying the algebraic condition (14) and Lemma 4.2 of [15] on the symbol of -schemes (6), we can prove that the degree of polynomial reproduction of each -scheme is quintic.

3. Continuity Analysis of the -Schemes

In this section, we make use of Laurent polynomial (symbol) formalism [16] to calculate integer class continuity of the -schemes. Lower bounds on Hölder continuity are computed by using the following theorem and upper bounds are calculated by using Rioul's method [7]. Moreover, exact upper bounds on Hölder continuity can also be derived by using Floater and Muntingh algorithm [5].

Theorem 2. The lower bound on the Hölder continuity of the limit curves produced by the -schemes with smoothing stages is

Proof. Since by (6)

then by Rioul [7] the Hölder continuity of the limit curves is bounded from below by

Since and both are alternating symbols (i.e., its even coefficients are nonnegative and its odd coefficients are nonpositive), then is also alternating and

where and are sum of even and odd coefficients of , respectively. Since by [11]

then

By eigenvalue decomposition, we have

This implies that

Thus, we have

Consequently, the Hölder continuity of the limit curves produced by the -schemes with smoothing stages is bounded from below by

Table 2 summarizes the continuity analysis of the -schemes. We observe that the order of continuities achieved by -schemes is reasonable, but it does not increase by increasing smoothing stages. However, there are upper and lower bounds on Hölder continuity which grow gradually with .

Table 2: Comparison of continuity of the -schemes.

Continuity
Hölder continuity

Lower bound
Upper bound

0
2
2.540
2.830

1
3
2.696
3.246

2
3
2.823
3.649

3
3
2.935
4.040

4
3
3.038
4.421

5
4
3.137
4.795

Remark 3. Actually, the anonymous reviewer’s suggested smoothing operator significantly improve the smoothness of the schemes. That is, we get , , , and  smoothness for ,  ,  , and , respectively, but with only linear degree of polynomial reproduction. While by using our proposed smoothing operator, we get up to quintic degree of reproduction with ,  ,  , and  smoothness for ,  ,  , and , respectively.

4. Analysis of the Limit Curve

In this section, we present limit behavior, artifact analysis, and shrinkage effect of the -schemes.

4.1. Limit Behavior of the -Schemes

The limit behavior of the subdivision scheme can be analyzed by examining the eigenstructure of subdivision matrix . For a nondefective matrix , if there is linearly independent eigenvectors corresponding to the eigenvalues , then it is possible to diagonalize by transforming it by the eigenvectors and their inverse; that is, . If the subdivision curve is (i.e., if all the rows of sum to one, then will have one eigenvector consisting of all ones and at least one eigenvalue must be one. If , then subdivision scheme is .), then all the vertices in the local neighborhood will shrink to the same point and thus we obtain limit stencil of the subdivision scheme mathematically

The subdivision matrices for the -schemes corresponding to the masks ,  ,  , and presented in Table 1 have order ,  ,  , and , respectively. The limit stencils of these -schemes for some smoothing stages are presented in Table 3. By applying limit stencil on consecutive control points in local neighborhood, we get limit position of the central one. Moreover, these stencils are useful to compute the magnitude of artifacts presented in the polygon.

Table 3: Limit stencils of the -schemes.

Limit stencils

0
=

1
= 0.00000012323, −0.00000041069, −0.000039800, −0.00088283, 0.016736, −0.10701, 0.59120, 0.59120, −0.10701, 0.016736, −0.00088283, −0.000039800, −0.00000041069, 0.00000012323

2
= 0.000000000000026, 0.00000000044399, 0.000000023348, −0.0000024738, 0.00023116, 0.00086974, −0.0097205, 0.027417, 0.96241, 0.027417, −0.0097205, 0.00086974, 0.00023116, −0.0000024738, 0.000000023348, 0.000000023348, 0.00000000044399, 0.000000000000026

3
= −0.000000000003485, 0.0000000011645, 0.00000031630, 0.000014667, 0.000074973, −0.0020474, 0.020295, −0.11208, 0.59374, 0.59374, −0.11208, 0.020295, −0.0020474, 0.000074973, 0.000014667, 0.00000031630, 0.0000000011645, −0.000000000003485

4.2. Artifact Analysis of the -Schemes

An artifact is defined to be any characteristic which is undesirable and cannot be separated by movement of control points which means that the curve holds spatial frequencies above the Shannon limit [17] relative to the density of the control polygon because features of the spatial frequency below this limit are removable by movements of the control points [18]. By definition, spatial frequency is the reciprocal of the number of control points per cycle and artifact magnitude is the function of the spatial frequency. We measure the amount of artifact presented in the polygon after the first subdivision level by using the following strategy. First, take the product of symmetric mask/symbol with symmetric limit stencil/symbol and then represent this product as polynomial in . Then, the magnitude of artifact can be calculated by substituting for in that polynomial, where is the spatial frequency. The magnitude of the artifact presented in the limit curve is given by with the understanding that the data is sampled from a sinusoid with samples per cycle, where is the number of control points.

Theorem 4. The amount of artifact presented in the limit curve produced by the 6-point binary scheme (i.e., ) is

where .

Proof. By substituting in (6) and (7), we get 6-point binary scheme whose symbol in symmetric form can be written as

This can be manipulated as

Since the symbol of the limit stencil (as given in Table 3) of 6-point binary scheme is , this implies that

By representing it as polynomial in , we get

Since the magnitude of the artifact presented in the limit curve is given by , then, by substituting for in above polynomial, we get

where , , and is the number of control points of the polygon.

Similarly, we can prove the following theorems.

Theorem 5. The amount of artifact presented in the limit curve produced by the 8-point binary scheme (i.e., ) is

Theorem 6. The amount of artifact presented in the limit curve produced by the 11-point binary scheme (i.e., ) is

Theorem 7. The amount of artifact presented in the limit curve produced by the 13-point binary scheme (i.e., ) is

Similarly, we can determine the amount of artifact presented in the limit curves for other values of . The amount of artifacts of the -schemes for four (i.e., ) smoothing stages is shown in Figure 1. The magnitude of the artifact in the limit curve is plotted against the number of control points . It is noticed that when the smoothing stages increase the magnitude of the artifact decreases for the same number of control points.

Figure 1: Artifact behavior of the -schemes.

4.3. Shrinkage Effect of the -Schemes

A control polygon is a sequence of points in space that is commonly used to manage the shape of an object. We apply subdivision scheme on closed control polygons to create visually smooth limit curves. Figure 2 shows limit curves generated by the -schemes with different number of smoothing stages. Note that, as we increase the number of smoothing stages, final limit curve has larger distance from the control polygon. Since this shrinkage effect is only due to the smoothing stages, it is clear that the refine stage is not a factor of this effect. Therefore, we can measure this shrinkage effect by only examining smoothing stage. We can represent smoothing stage for a closed -point polygon as the matrix

Since the above matrix is circulant, by [19], its eigenvalues are

where .

(a)

(b)

Figure 2: Limit curves generated by the -scheme by applying 0, 1, 2, and 3 smoothing stages.

Here, we can determine that the dominant eigenvalue and its corresponding eigenvector is also a column vector consisting of all ones. This shows a dominant behavior that as we increase the smoothing stages, say , the whole configuration falls down towards barycenter of the original control polygon.

The subdominant eigenvalues and are complex conjugate of each other and shrinkage of the polygon towards its barycenter as well as a phase shift is decided by them. Disregarding this rotation, the rate of shrinkage for each smoothing stage is . We plot this rate of shrinkage against the number of smoothing stages in Figure 3. From Figure 3, it is apparent that the -schemes bear less shrinkage when the number of smoothing stages increases and as a result better preserve the shape of control polygon as compared to -schemes [11].

(a) -schemes [11]

(b) proposed -schemes

Figure 3: Rate of shrinkage plotted for the -schemes [11] and proposed -schemes against the number of smoothing stages , for polygons having 4, 8, and 16 points.

5. Summary

In this paper, we have applied 6-point variant on Lane-Riesenfeld algorithm [1] to generate a new family of schemes, which we call the -schemes. Furthermore, we have evaluated the relation among support, smoothness, Hölder continuity, and number of smoothing stages. The degree of polynomial reproduction also has been discussed. We have evaluated the rate of shrinkage of limit curve from original control polygon at different number of smoothing stages and make comparison with -schemes [11]. Artifact and limit stencil analysis of proposed schemes is also carried out.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

The authors thank the anonymous reviewers whose valuable comments greatly improved this paper. This work is supported by the Chinese Academy of Sciences (CAS) no. 2013FFJA0008, the NSF of China no. 11371341, and Indigenous PhD Scholarship Scheme of Higher Education Commission (HEC) Pakistan.

References

J. M. Lane and R. F. Riesenfeld, “A theoretical development for the computer generation and display of piecewise polynomial surfaces,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 2, no. 1, pp. 35–46, 1980.

M. Aslam, G. Mustafa, and A. Ghaffar, “(2n −1)-point ternary approximating and interpolating subdivision schemes,” Journal of Applied Mathematics, vol. 2011, Article ID 832630, 13 pages, 2011.

G. Mustafa, J. Deng, P. Ashraf, and N. A. Rehman, “The mask of odd points n-ary interpolating subdivision scheme,” Journal of Applied Mathematics, vol. 2012, Article ID 205863, 20 pages, 2012.

G. Mustafa, P. Ashraf, and J. Deng, “Generalized and unifiedfamilies of interpolating subdivision schemes,” Numerical Mathematics: Theory, Methods and Applications, vol. 7, 2014

M. S. Floater and G. Muntingh, “Exact regularity of symmetric univariate subdivision schemes,” Geometry Seminar, Centre of Mathematics for Applications, University of Oslow, Oslo, Norway, 2012

R.-Q. Jia and Q. Jiang, “Spectral analysis of the transition operator and its applications to smoothness analysis of wavelets,” SIAM Journal on Matrix Analysis and Applications, vol. 24, no. 4, pp. 1071–1109, 2003.

O. Rioul, “Simple regularity criteria for subdivision schemes,” SIAM Journal on Mathematical Analysis, vol. 23, no. 6, pp. 1544–1576, 1992.

S. Schaefer, E. Vouga, and R. Goldman, “Nonlinear subdivision through nonlinear averaging,” Computer Aided Geometric Design, vol. 25, no. 3, pp. 162–180, 2008.

K. Hormann and M. A. Sabin, “A family of subdivision schemes with cubic precision,” Computer Aided Geometric Design, vol. 25, no. 1, pp. 41–52, 2008.

S. Schaefer and R. Goldman, “Non-uniform subdivision for B-splines of arbitrary degree,” Computer Aided Geometric Design, vol. 26, no. 1, pp. 75–81, 2009.

T. J. Cashman, K. Hormann, and U. Reif, “Generalized Lane-Riesenfeld algorithms,” Computer Aided Geometric Design, vol. 30, no. 4, pp. 398–409, 2013.

N. Dyn, D. Levin, and J. A. Gregory, “A 4-point interpolatory subdivision scheme for curve design,” Computer Aided Geometric Design, vol. 4, no. 4, pp. 257–268, 1987.

G. Deslauriers and S. Dubuc, “Symmetric iterative interpolation processes,” Constructive Approximation, vol. 5, no. 1, pp. 49–68, 1989.

I. P. Ivrissimtzis, M. A. Sabin, and N. A. Dodgson, “On the support of recursive subdivision,” ACM Transactions on Graphics, vol. 23, no. 4, pp. 1043–1060, 2004.

C. Conti and K. Hormann, “Polynomial reproduction for univariate subdivision schemes of any arity,” Journal of Approximation Theory, vol. 163, no. 4, pp. 413–437, 2011.

N. Dyn and D. Levin, “Subdivision schemes in geometric modelling,” Acta Numerica, vol. 11, pp. 73–144, 2002.

C. E. Shannon and W. Weaver, The Mathematical Theory of Communication, The University of Illinois Press, Champaign, Ill, USA, 1949.

M. A. Sabin, U. Augsdörfer, and N. A. Dodgson, “Artifacts in box-spline surfaces,” in Mathematics of Surfaces XI, vol. 3604 of Lecture Notes in Computer Science, pp. 350–363, Springer, Berlin, Germany, 2005.

R. M. Gray, “Toeplitz and circulant matrices: a review,” Foundations and Trends in Communications and Information Theory, vol. 2, no. 3, pp. 155–239, 2006.