# Odd-Ary Approximating Subdivision Schemes and RS Strategy for Irregular Dense Initial Data

Authors: Muhammad Aslam; W. P. Abeysinghe
Journal: ISRN Mathematical Analysis
 (2012)

---

## Abstract

We investigate the implementation of approximating subdivision schemes on noisy or irregular initial control data. Presence of noise in the initial data generates oscillatory curves by subdivision schemes. To reduce or completely eliminate these oscillations, we combine subdivision schemes with other noise removal schemes such as variational regularization method. This setup will allow us to produce the limit curve with less oscillations and still stay as close as possible to the initial data points.


---

## Body

## 1. Introduction

Subdivision has been a very important tool for computer-aided geometric design, image reconstruction, and computer animation. Subdivision schemes can be divided into two categories, interpolating subdivision schemes and approximating subdivision schemes. In interpolating subdivision schemes, more data points are added between the initial or existing data points at each level of subdivision. However, in approximating subdivision schemes existing points are replaced by their approximations and new points are inserted at each level of refinement. As a result we see that approximating schemes generate smoother curve as compared to interpolating subdivision schemes.A general form [1] of univariate n-ary subdivision scheme S which maps set of data points fk={fik}i∈Z into the next refinement level of data points fk+1={fik+1}i∈Z is defined as(1.1)fni+sk+1=∑j∈zβnj+sfi-jk,s=0,1,2,…,n-1,
where the set of coefficients {βi∣i∈Z} is called the mask and n representsthe arity of the subdivision scheme. The previous equation can also be expressed as fk+1=Sfk. A necessary condition for the uniform convergence [2] of n-ary subdivision scheme is(1.2)∑j∈Zβnj+s=1,s=0,1,2,…,n-1.
During the last several years, many subdivision schemes have been developed, and analyses regarding their smoothness and error bounds have been performed [3–7]. It is noted that if initial control data is dense and corrupted with noise then subdivision schemes will generate oscillatory curves and oscillations in the curve depend on the noise level present in the initial data points. There is not much work done on this problem, and we try to address this issue in this paper. In Section 2, we revisit some of the odd point odd-ary approximating subdivision schemes. In Section 3, we measure the performance of subdivision schemes on noisy initial data. Overview of total variational regularization is given in Section 4, and RS strategy and its performance are discussed in Section 5.


## 2. Odd Point Odd-Ary Subdivision Schemes

We have recently introduced a general procedure of constructing a(2n-1)-point (2b+1)-ary parametric approximating subdivision schemes for any integers n≥2, b≥1. These schemes have order of smoothness up to C2n-2+⌊(n-1)/b⌋, where ⌊(n-1)/b⌋ is the largest integer less than (n-1)/b. Brief description of construction procedure is given below.Consider a family of polynomials(2.1)P2n-1,t2b+1(z)=(1+z+z2+⋯+z2b)t∑i=0(2b+1)(2n-1)-2bt-1uizi,
where t=1,2,3,…,(2n-1)+⌈(n-1)/b⌉and⌈(n-1)/b⌉ is the largest integer less than or equal to (n-1)/b(2.2)u(2b+1)n-b(t+1)-1-i=u(2b+1)n-b(t+1)-1+i,i=1,2,…,(2b+1)n-b(t+1)-1,u(2b+1)n-b(t+1)-1=1(2b+1)t-1-2∑i=0(2b+1)n-b(t+1)-2ui.
From (2.1), we get (2n-1)+⌈(n-1)/b⌉ different polynomials P2n-1,t2b+1(z) one for each t. Let α2n-1,t2b+1 denote the sets of coefficients of polynomials P2n-1,t2b+1(z), then these set of coefficients will represent the masks of (2n-1)-point (2b+1)-ary approximating schemes.Forb=1, n=2, and t=3,4 in (2.1), we have the following masks for 3-point ternary subdivision schemes:(2.3)α3,33={u0,u0+19,u0+13,23-2u0,79-2u0,23-2u0,u0+13,u0+19,u0},α3,43=127{1,4,10,16,19,16,10,4,1}.
Similarly, for b=1, n=3, and t=6,7 in (2.1), we have the following masks for 5-point ternary subdivision schemes:
(2.4)α5,63={u0,4u0+135,10u0+635,14u0+2135,11u0+5035,9035-4u0,12635-21u0,14135-30u0,12635-21u0,9035-4u0,11u0+5035,14u0+2135,10u0+635,4u0+135,u0},α5,73=136{1,7,28,77,161,266,357,393,357,266,161,77,28,7,1}.
Masks for 3-point and 5-point quinary schemes can be obtained by a similar approach. Given below are two of the these masks one for 3-point and one for 5-point quinary scheme:
(2.5)α3,35={u0,u0+125,u0+325,u0+625,u0+1025,1525-2u0,1825-2u0,1925-2u0,1825-2u0,1525-2u0,u0+1025,u0+625,u0+325,u0+125,u0},α5,65=155{1,6,21,56,126,246,426,666,951,1246,1506,1686,1751,1686,1506,1246,951,666,426,246,126,56,21,6,1}.
It is to be noted that all the masks given above satisfy the necessary condition for the uniform convergence (1.2) of the subdivision schemes.


## 3. Performance over Irregular Initial Polygon

Subdivision schemes have been successful in finding smooth curves and surfaces from the regular or noise free data points. However, they do not have the same performance if the initial data or control points are dense and corrupted with noise. Subdivision schemes on irregular or noisy control points will generate oscillatory curves. Figure1 explains this phenomenon.(a) Initial polygon (noisy or irregular data points) and curves generated by 3-point ternary scheme (4th level) in (2.3) with mask α3,43 and (b) same initial polygon and curve generated by 5-point ternary scheme (4th level) in (2.4) with mask α5,73. Oscillations at 4th level of subdivision schemes are significant.
(a)(b)In order to measure the performance of subdivision schemes on irregular initial data points, we are defining mathematical error function as follows. Letf represent the initial data point and g represent the data obtained after applying subdivision transform S, that is, g=Sf. We define an error function eλ as(3.1)eλ=(1-λ)‖f-g‖22+λTV(g)
for some parameter 0<λ<1 and TV(g)=∑i=1n-1|g(i+1)-g(i)|, for g∈Rn.Second term in (3.1) represents a measure of smoothness and the first term is a least square error term. Since g=Sf, both f and g are vectors of different lengths. For example, if S is ternary subdivision scheme and f∈Rn then g∈R3n and we have ∥f-g∥22=∑i=1n|f(i)-g(3i-1)|2 and similarly, if S is quinary then ∥f-g∥22=∑i=1n|f(i)-g(5i-2)|2. Least square error term for interpolating subdivision schemes is zero because of the retention of initial data in the new data.In practice, subdivision schemes with small number of points and smaller arity are preferred, therefore, we limit our analysis to 3-point and 5-point ternary and quinary subdivision schemes. We present comparison of Ternary and Quinary approximating subdivision schemes on their performance on the initial noisy control points. Withλ=1/2  in (3.1), we have computed error function for ternary and quinary schemes at different subdivision levels to the irregular initial data shown in Figure 1. Our results are shown in Figure 2. It is evident that 5-point schemes have better performance than 3-point subdivision schemes on noisy initial data.Comparison: graphs of error functioneλ are shown against subdivision levels for the initial polygon (noisy initial data) shown in Figure 1. We used λ=1/2, masks for ternary schemes α3,43 and α3,43 in (2.3) and (2.4) and masks for quinary schemes α3,35 (with u0=1/50) and α5,65 in (2.5).
(a)(b)


## 4. Regularization Method

In this section, we revisit variational regularization method which is widely used for noise removal in image processing and other applications. Suppose we are given a noisy signalf and we are interested in finding its noise-free approximation. The most successful and commonly used method to solve this problem is total variation regularization approach [8–10] and is given by(4.1)gθ=arg⁡min⁡g∈Rn{12‖f-g‖22+θTV(g)}
for some parameter θ>0, where gθ is the approximation of f and subject to the penalty function TV(g). Here TV(g) approximates the total variation of the function g and it is defined in the previous section.First term in (4.1) describes the closeness of regularized solutions with f and the second term penalizes those solutions which have high oscillations. For our computations, we used Newton’s method to find gθ and L-curve method to select parameter θ. For more details about implementation and parameter selection processes, we may refer to [9]. This method is extensively explored and implemented for noise removal, image restoration, and other applications [8–10].Figure3(a) shows a noisy signal and its approximation by regularization method with θ=.1. Noise in the approximated signal by regularization method is almost gone, but resulting curve is not smooth at certain locations where it appears to have big jumps. On the other hand curves obtained by subdivision schemes as shown in Figure 1 are smoother but effects of noise can be seen in the form of oscillations.Comparison: (a) initial polygon (noisy) and approximation curve by regularization method and (b) same initial polygon and approximation curve by RS strategy, that is, regularization combined with subdivision scheme (5-point ternary at 1st level with maskα3,43).
(a)(b)


## 5. RS Strategy and Numerical Results

We have noted that subdivision schemes produce oscillatory curves for the noisy initial data and regularization approach lacks smoothness at certain points. Therefore, we have combined these two approaches into the following two-step strategy and it is called regularization + subdivision or RS strategy.Letf be the given initial noisy polygon.Regularization Step: Find approximation gθ of f as given in (4.1);Subdivision Step: Apply subdivision transform S to gθ, that is find Sgθ.We choose two examples to explain the results by RS strategy: one example with open irregular initial control polygon shown in Figure3(b) and second example of closed irregular initial control polygon shown in Figure 4(b). In our implementation, we used θ=.1 in the regularization step and 5-point ternary subdivision schemes at 1st level in subdivision step. Improvement by RS strategy can be easily seen by comparing Figures 4(a) and 4(b) and similarly Figures 1(b) and 3(b). Subdivision step of RS strategy is repeated for the curve obtained in Figure 3(a), with 5-point ternary and 5-point quinary subdivision schemes. Results are shown in Figure 5.Comparison: (a) Initial irregular polygon and approximation curve generated by 5-point ternary subdivision scheme at 1st level; (b) Initial irregular polygon and approximation curve generated by RS strategy (with 5-point ternary subdivision for one level).
(a)(b)Comparison: (a) Initial irregular polygon and two approximation curves (one generated with 5-point ternary at 2nd level and second approximation curve generated by RS strategy); (b) Initial irregular polygon and two approximation curves (one generated with 5-point quinary at 2nd level and second approximation curve generated by RS strategy).
(a)(b)We have done performance analysis of RS strategy by using the error function defined by (3.1) and compared it with ternary and quinary subdivision schemes. Results obtained at different levels of subdivision (for the initial noisy data shown in Figure 1) are shown in Figure 6. Error function for RS strategy gives the same value for all levels of subdivision. It means that for RS strategy only one level of subdivision is enough and its performance is much better than subdivision schemes.Comparison: (a) graphs of error functioneλ (with λ=1/2) are given for 3-point, 5-point ternary schemes, and RS strategy (for both 3-point and 5-point ternary subdivision schemes); (b) graphs of error function eλ (with λ=1/2) are given for 3-point, 5-point quinary schemes, and RS strategy (for both 3-point and 5-point quinary schemes).
(a)(b)


## 6. Conclusion

In this paper, we presented a criterion for performance analysis of subdivision schemes over noisy initial control polygon and showed that 5-point ternary and quinary schemes performed better than 3-point ternary and quinary subdivision schemes. Further we defined RS strategy by combining total variational regularization with subdivision schemes. Our results showed that RS strategy outperformed subdivision schemes for noisy and dense initial data points.



---

*Source: 745096-2012-06-11.xml*