International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 4, July August 2013 ISSN 2278-6856

On the Calculation of the Signal-Image Classic-Curvature: A Second Order Derivatives Based Approach
Carlo Ciulla
University for Information Science and Technology "St. Paul the Apostle", Partizanska BB, 6000, Ohrid - Macedonia

Abstract: Given a signal data in either one or in multiple

dimensions, and given a model function fitted to the signal data, it is possible to calculate the curvature through the computation of all of the second order derivatives of the model function using rigorous calculus methodologies. This manuscript emphasizes on the aforementioned statement bringing to the attention that convolution operators used to approximate both of first and second order derivatives of the signal data, or filters used to approximate second order derivatives, do not allow the representation of the curvature in its full geometrical meaning. The geometrical meaning of the curvature of the signal data is that one of the arctangent of the angle formed by the tangent-line to the first order derivative of the modeled signal data. The curvature calculated summing all of the second order derivatives of Hessian of the model function fitted to the data is here termed as classic-curvature. Presentation of qualitative results is given with regard to polynomials B-Spline and Lagrange in two and three dimensions; thus confirming that regardless of the dimensionality of the problem, it is possible to advance to the calculation of the curvature through the computation of all of the second order derivatives of the modeled signal, and to reveal the relationships existing between the modeled signal and the second order derivative.

Key words: Classic-Curvature, Math Model, Signal Data, Signal-Image Processing, Second Order Derivative, Curve Fitting.

1. INTRODUCTION
Current works are mentioned in this manuscript referring to the use of second order derivatives for signal-image interpolation, finite impulse response in digital signal processing, edge detection through zero crossing of digitally sampled data, and signal wavelets representations. The review of the literature is thus made with the intent to list together methods employed so far in order to calculate and use the second order derivative of signal data within the wide literature on signal processing applications. The method of the calculation of the second order derivative proposed here is based on a well defined math model fitted to the signal data, which in the case of the herein presented works, is an interpolation function: either the B-Spline [1]-[2] or the Lagrange polynomial [3]. Thus, the literature review starts with the mention to the works published earlier in [4] where a framework for Volume 2, Issue 4 July August 2013

the design of discrete multidimensional differentiators was described. As mentioned in [4], it can be argued that the choice of the interpolation function is arbitrary. And thus, since a comparison between interpolation functions is necessary to the extent of the exactness of the solution as well as to the discovery of the relationships between the resulting second order derivative images and the math model fitted to the signal data, we presents here results which show qualitative differences between B-Spline and Lagrange polynomials for what concerns of the classiccurvature images [3] resulting from these two aforementioned classes of interpolation functions. Also in digital signal processing, the use of differentiation of an impulse function is not new and embraces a large literature. In fact, the design of digital differentiators for low frequencies has been reported earlier in [5]-[7]. The large literature existing on the differentiation of an impulse function remarks on the importance of the topic and also brings up the issue that finite differences, employed for instance in convolution operators or Sobel operator, can provide an undesired approximation of the derivative when the signal varies rapidly in relationship to the spacing of the sampling interval [4]. In relationship to this issue, fractional calculus has been used in order to make the design of fractional order digital Finite Impulse Response (FIR) differentiators [8]. Transfer functions of FIR Hilbert transformers were obtained analytically through calculus [9]. Also, using fractional calculus, an Infinite Impulse Response (IIR) type digital fractional order differentiator was proposed using a type of first-order digital differentiators expressed in the second-order IIR form [10]. Other uses of first and second order derivatives in signal processing are in the signal wavelets representations [11][12], and these operators, in relationship to their use in zero crossing operations of images, descends from pioneering works [13]-[14]. Consistently, wavelets are also useful in performing numerical representations of a function off a grid and its first and second order derivatives on a grid [15]. Our contribution in this paper is that one of showing, through the use of calculus, a novel methodology to calculate the classic-curvature of a signal data which has been fitted a math model and such contribution has implications in discrete signal-image processing. Page 158

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 4, July August 2013 ISSN 2278-6856
In the next section the background is presented and the review of the literature is extended. In the results section some sample qualitative results of classic-curvature maps are presented with specific focus on B-Splines and Lagrange polynomials employed to fit the signal data. In the discussion and conclusions section this work is reviewed in reference to the literature concerned with the use of derivatives in signal-image interpolation applications and the novelty of the contribution is highlighted. 1.1 The Curvature Early work in edge detection shows that both of the Laplacian and the second order directional derivative along the gradient were used as differential operators [16]. The aforementioned milestone work indicates that the curvature is calculated when the Laplacian is used, and it also indicates that regularization of differentiation through the use of an interpolation function is not new in literature as it has been employed within the context of edge detection [16]. However the Hessian of a multidimensional function includes also the partial second order derivatives with respect to the covariates of the model function. Recent research on the Sub-pixel Efficacy Region: SREbased Interpolation [17] and just recently in [3] while describing the SRI: Signal Resilient to Interpolation, shows remarkable evidence of the possibility, the feasibility, and the accuracy of the calculation of all of the second order derivatives of the Hessian of the model interpolation function fitted to the signal data, on the basis of basic and simple, however rigorous concepts of calculus. The classic-curvature of a signal or an image in either: one dimension (1D), two dimensions (2D) or three dimensions (3D), is herein defined to be the sum of all the second order derivatives of the signal (image) with respect to the dimensional variables. The geometrical meaning of the classic-curvature is that one of the arctangent of the angle formed by the tangentline to the first order derivative of the signal (image). Both of the classic-curvature and the first order derivatives of the signal are dependent in their math form from the math expression of the polynomial function chosen to approximate (to fit) the signal data. Work published in [18] shows the calculation of the curvature with the support of calculus and the approximation provided through Fourier-based approaches. The use of Taylor Series expansion strategies from earlier work [19] suggests that with rigorous methodology inherited from calculus it is possible to initiate signal-image processing to the use of the curvature such to show visually the second order derivative of the data. The literature reports techniques employed to calculate derivatives of the signal (image) which make use of convolution operators like: (i) the gradient to calculate the second order derivative [20], (ii) compact finite differences [21] and (iii) Volume 2, Issue 4 July August 2013 multidimensional derivative filters [4], to calculate both of first and second order derivatives, and (iv) Sobel operators [22] to calculate the first order derivative. It is also possible to find in the literature approximations of the second order derivatives with applications which are not in signal-image processing [23]-[25]. In concordance with what reported earlier [26], which reminds that it is unlikely to determine true locations of relative extremes in derivatives (thus in digital signals) directly using the sampled values, the herein presented work shows that it is beneficial to fit a math model to the signal data prior to the calculation of all of the second order derivatives. Whereas other work shows that the calculation of the second order derivative is accomplished with the Prewitt gradient operator [20]. The present manuscript shows that it is possible to advance to the use of calculus, in order to calculate the classic-curvature (which comprises of all of the second order derivatives of the Hessian of the model function fitted to the signal data) without approximation.

Figure 1 A 33 33 pixels image depicting a light source of circular nature inside a square of pixels is seen in (a), and the classic-curvature image calculated with the twodimensional B-Spline (re-sampling the misplacement of 0.01 mm along the x axis and of 0.01 mm along the y axis and with the value of the parameter: the 'a' constant equal to -2.54 [3]) is seen in (b). The arrows in (b) indicate the maximal change in classic-curvature occurring at the edges of the square of pixels containing the light source shown in (a). In (c) the value of the misplacement is 0.01 mm along both of the x and the y axis, and in (d) the value of the misplacement is zero along both of the x and the y axis. The value of the parameter the 'a' constant was set to 0.54 to obtain both of the classic-curvature images shown in (c) and (d).

In order to illustrate the concept of the classic-curvature, Figure 1 shows a 33 33 pixels image in (a) and the classic-curvature of the image in (b). The classiccurvature shown in (a) was calculated with the twodimensional B-Spline [3] while re-sampling of 0.01 mm Page 159

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 4, July August 2013 ISSN 2278-6856
along the x axis and of 0.01 mm along the y axis. The pixel intensity in the image is constant and equal to zero except for the central part where the pixel intensity follows a circular pattern with the brightest pixel located at the center. Consistently with what seen in (a), the classic-curvature is constant (see white in (b) and black in (c) and in (d)) inside the portion of the image where the pixel intensity is zero (outside the central part indicated by the arrows), and behaves consistently with the pixel intensity seen in (a). More specifically, the maximal change in classiccurvature is at the edges (see arrows in (b), (c) and (d)) between the zero valued region of the image and the signal (see (a)), and such maximal change is abrupt along the horizontal edge and smoother along the vertical edge, consistently with the pixel intensity map at the edges of the image in (a). The difference in the black and white mapping of the classic-curvature between the image shown in (b) and the images shown in (c) and (d) is attributable to the value of the parameter the 'a' constant [3] which was set to -2.54 in (b) and 0.54 in both of (c) and (d). 0, 0), f(0, -1, 0), f (0, 0, -1), f (-1, -1, 0), f (-1, 0, -1), f (0, -1, -1), f (-1, 1, 0), f (-1, 0, 1), f (0, -1, 1), f (1, -1, 0), f (0, 1, -1), f (1, 0, -1), f (-1, -1, 1), f (-1, 1, -1), f (1, -1, -1), f (-1, 1, 1), f (1, -1, 1), f (1, 1, -1), f (-1, -1, -1). LGR3(x, y, z) = f (0, 0, 0) + 1 [ (1/2) (x + y + z)3 (x + y + z)2 1/2 (x + y + z) + 1 ] + 2 [ -(1/6) (x + y + z)3 + (x + y + z)2 - (11/6) (x + y + z) + 1 ] (1) where the coefficients 1 and 2 are: 1 = [ f (-1, 0, 1) + f (-1, 0, 0) + f (1, 0, 0) + f (1, 0, -1) + f (-1, -1, 1) + f (-1, -1,0) + f (1, -1, 0) + f (1, -1, -1) + f (1, 1, 1) + f (-1, 1, 0) + f (1, 1, 0) + f (1, 1, -1) ] (2) 2 = [ f (-1, 0, 1) + f (0, 0, 1) + f (1, 0, 1) + f (-1, 0, 0) + f (1, 0, 0) + f (-1, 0, -1) + f (0, 0, -1) + f (1, 0, -1) + f (-1, 1, 1) + f (0, -1, 1) + f (1, -1, 1) + f (-1, -1, 0) + f(0, -1, 0) + f (1, -1, 0) + f (-1, -1, -1) + f (0, -1, -1) + f (1, -1, -1) + f (-1, 1, 1) + f (0, 1, 1) + f (1, 1, 1) + f (-1, 1, 0) + f (0, 1, 0) + f (1, 1, 0) + f (-1, 1, -1) + f (0, 1, -1) + f (1, 1, -1)] (3) Let us demonstrate the assertions given hereto follow in equation (4): (2 (LGR3 (x, y, z) ) /x2 ) = (2 (LGR3(x, y, z) ) /y2) = (2 (LGR3 (x, y, z) ) /z2 ) = (2 (LGR3(x, y, z) ) /xy) = (2 (LGR3 (x, y, z) ) /yx) = (2 (LGR3(x, y, z) ) /xz) = (2 (LGR3 (x, y, z) ) /zx) = (2 (LGR3(x, y, z) ) /yz) = (2 (LGR3 (x, y, z) ) /zy) (4) ( (LGR3(x, y, z) ) /x) = { f (0, 0, 0) + 1 [ (1/2) (x + y + z)3 (x + y + z)2 1/2 (x + y + z) + 1 ] + 2 [ -(1/6) (x + y + z)3 + (x + y + z)2 - (11/6) (x + y + z) + 1 ] }/x = { 1 [ (1/2) (x + y + z)3 /x (x + y + z)2 /x 1/2 (x + y + z) / x ] + 2 [ -(1/6) (x + y + z)3 /x + (x + y + z)2 /x - (11/6) (x + y + z) /x ] } = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ (3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] } (5) ( (LGR3(x, y, z) ) /y) = { f (0, 0, 0) + 1 [ (1/2) (x + y + z)3 (x + y + z)2 1/2 (x + y + z) + 1 ] + 2 [ -(1/6) (x + y + z)3 + (x + y + z)2 - (11/6) (x + y + z) + 1 ] }/y = { 1 [ (1/2) (x + y + z)3 /y (x + y + z)2 /y 1/2 (x + y + z) /y ] + 2 [ - (1/6) (x + y + z)3 /y + (x + y + z)2 /y - (11/6) (x + y + z) /y] } = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ (3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] } (6) Page 160

2. METHODS
To conceptualize a method on the basis of the qualitative results shown in this work, it takes to consider that signal processing techniques employed in various tasks such as for instance in signal reconstruction, in image segmentation, in signal interpolation, usually require to fit a model to the signal data and such model is mathematically well defined such that for example the math models treated in this manuscript, which were BSpline and Lagrange polynomials. Fitting the math model to the signal data is indeed an advantage which needs not be lost when convolution operators are used in order to calculate the second order derivative of the model function through approximation. Indeed, calculus provides the methodology to derive the values of the classic-curvature without approximation. Still approximation is present into the resulting classiccurvature image data because of the arbitrary choice of the math model however the approximation is not propagated through the additional computation of the convolution, and this is an advantage of the method herein presented. For convenience of the reader is here shown the math deduction of the classic-curvature while fitting the trivariate cubic Lagrange interpolation function to the signal data. In the result sections, specifically in Figures 2 and 5, are presented the qualitative results showing the classic-curvature images obtained with the formulae herein reported. Let us consider the cubic Lagrange LGR3 (x, y, z) function (1) with the following (3 3 3) neighboring pixels [3]: f (0, 0, 0), f (1, 0, 0), f (0, 1, 0), f (0, 0, 1), f (1, 1, 0), f (1, 0, 1), f (0, 1, 1), f (1, 1, 1), f (-1, Volume 2, Issue 4 July August 2013

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 4, July August 2013 ISSN 2278-6856
( (LGR3(x, y, z) ) /z) = { f (0, 0, 0) + 1 [ (1/2) (x + y + z)3 (x + y + z)2 1/2 (x + y + z) + 1 ] + 2 [ -(1/6) (x + y + z)3 + (x + y + z)2 - (11/6) (x + y + z) + 1 ] }/z = { 1 [ (1/2) (x + y + z)3 /z (x + y + z)2 /z 1/2 (x + y + z) /z ] + 2 [ - (1/6) (x + y + z)3 /z + (x + y + z)2 /z - (11/6) (x + y + z) /z] } = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ (3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] } (7) (2 (LGR3(x, y, z) ) /x2) = ( ( (LGR 3(x, y, z) ) /x) /x) = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ -(3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] }/x = { 1 [ 3 (x + y + z) 2 ] + 2 [ - (x + y + z) + 2 ] } (8) (2 (LGR3(x, y, z) ) /xy) = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ - (3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] } /y = { 1 [ 3 (x + y + z) 2 ] + 2 [ - (x + y + z) + 2 ] } (9) (2 (LGR3(x, y, z) ) /yx) = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ -(3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] } /x = { 1 [ 3 (x + y + z) 2 ] + 2 [ - (x + y + z) + 2 ] } (10) (2 (LGR3(x, y, z) ) /y2) = ( ( (LGR 3(x, y, z) ) /y) /y) = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ (3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] }/y = { 1 [ 3 (x + y + z) 2 ] + 2 [ - (x + y + z) + 2 ] } (11) (2 (LGR3(x, y, z) ) /yz) = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ -(3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] }/z = { 1 [ 3 (x + y + z) 2 ] + 2 [ - (x + y + z) + 2 ] } (12) (2 (LGR3(x, y, z) ) /zy) = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ -(3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] }/y = { 1 [ 3 (x + y + z) 2 ] + 2 [ - (x + y + z) + 2 ] } (13) (2 (LGR3(x, y, z) ) /z2) = ( ( (LGR 3(x, y, z) ) /z) /z) = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ (3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] }/z = Volume 2, Issue 4 July August 2013 Figure 2 The Original Magnetic Resonance Imaging (MRI) T2 weighted data (fat imaged in dark and water imaged in bright) is Courtesy of: R. S. Swenson, www.Dartmouth.edu /~rswenson/ Atlas (top row). The classic-curvature maps obtained with polynomials without the embedding (WE) of the pixel to re-sample (middle row) and with the embedding (With E) of the pixel to re-sample (bottom row) [3]. These images were calculated re-sampling with the cubic trivariate (3D) Lagrange formula (see equation 17). Reprinted with permission from [3]. Page 161 { 1 [ 3 (x + y + z) 2 ] + 2 [ - (x + y + z) + 2 ] } (14) (2 (LGR3 (x, y, z) ) /xz) = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ -(3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] } /z = { 1 [ 3 (x + y + z) 2 ] + 2 [ - (x + y + z) + 2 ] } (15) (2 (LGR3 (x, y, z) ) /zx) = { 1 [ (3/2) (x + y + z)2 2 (x + y + z) 1/2 ] + 2 [ -(3/6) (x + y + z)2 + 2 (x + y + z) - (11/6) ] } /x = { 1 [ 3 (x + y + z) 2 ] + 2 [ - (x + y + z) + 2 ] } (16) Finally, the classic-curvature is: (x, y, z) = (2 (LGR3(x, y, z) ) /x2 ) + (2 (LGR3(x, y, z) ) /y2 ) + (2 (LGR3(x,y, z) ) /z2) + (2 (LGR3(x, y, z) ) /xy) + (2 (LGR3(x, y, z) ) /yx) + (2 (LGR3(x, y, z) ) /xz) + (2 (LGR3(x, y, z) ) /zx) + (2 (LGR3(x, y, z) ) /yz) + (2 (LGR3(x, y, z) ) /zy) = 9 { 1 [ 3 (x + y + z) 2 ] + 2 [ - (x + y + z) + 2 ] } (17) Validation of the concept brought to the attention through this manuscript is possible while referring to the geometrical meaning of the second order derivative of a model function [3]. As previously stated and herein

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 4, July August 2013 ISSN 2278-6856
consistently with their math model definition. Such consistency is a consequence of the fact that the classiccurvature is computed from the second order derivatives of the math model fitted to the signal data. The methodology used here is applicable to any signals and in any dimensions, provided that the math model employed to fit the signal data has the property of second order differentiability, which is that one of the existence of non null second order derivatives.

Figure 3 The original Magnetic Resonance Imaging data in shown in (a). One-dimensional and two-dimensional cubic B-Spline classic-curvature processing: (b) and (c) respectively. One-dimensional and two-dimensional cubic Lagrange classic-curvature processing: (d) and (e) respectively.

3. RESULTS
The research results presented herein show that the use of the classic-curvature is possible through the use a unified approach [3] and more specifically focuses on the following polynomials fitted to the signal data: 2D and 3D third degree Lagrange polynomials (thus in the dimensional variables (x, y) and (x, y z)), and 2D and 3D second and third degree B-Splines (quadratic and cubic). Thus, emphasis is given to the relationships existing between the math of the model fitted to the data and the resulting classic-curvature images. Figure 2, representative of the classic-curvature image obtained through the second order derivatives of the model interpolation function (the 3D cubic Lagrange polynomial) fitted to the data sets, shows the results in the middle and lower rows. The images shown in the top row are the originals, while in both of the middle row and the lower row were calculated with equation (17) while resampling at the misplacement of 0.048 mm, 0.049 mm and 0.051 mm along the three directions x, y and z respectively. Two details of similarity between the original Magnetic Resonance Imaging (MRI) T2 weighted images and the classic-curvature maps are highlighted in the figure and they are shown in the column at the left by means of the arrow and in the column at the right by means of the rectangle. The MRI data shown in Figure 3 in (a) belongs to the OASIS database: www.oasis-brains.org [27]-[32]. The classic-curvature images in Figures 3(b) and 3(c) are obtained fitting the two-dimensional cubic B-Spline to the signal data and re-sampling along the x direction (see (b)) and along both of x and y directions (see (c)), in either case of the misplacement of 0.01 mm. In Figure 3 in (d) and in (e) are shown the classiccurvature image obtained fitting and re-sampling along the x direction (see (d)) and along both of x and y directions (see (e)), in either case of the misplacement of 0.01 mm with the two-dimensional cubic Lagrange polynomial. The transformation used to re-sample the image in (a) prior to obtain the classic-curvature image shown in (b) and (d) comprises of a single translation of 0.01 mm along the x axis; and the transformation used to resample the image in (a) prior to obtain the classiccurvature images shown in (c) and (e) comprises of two translations (along the x and y axis respectively). The Page 162

Figure 4 Magnetic Resonance Imaging of the motor cortex. The original MRI seen in (1) through (6) is courtesy of Casa di Cure Triolo-Zancla, Palermo Italy. Reprinted with permission from [3].

Figure 5 The three-dimensional cubic Lagrange classiccurvature of the MRI seen in Figure 4 is shown in (1) through (6). Reprinted with permission from [3]. recalled, the geometrical meaning of the second order derivative of the signal data is that of the arctangent of the angle formed by the tangent-line to the first order derivative of the modeled signal data, and in this regard, the classic-curvature images shown here, present a high level of details comparable to the original image. The key in the manifestation of the similarities between original and classic-curvature images descends from the nature of math model fitted to the data. In fact, when the math model fits the data with good degree of approximation such as the cases herein reported of the BSplines and the Lagrange polynomials, it descends that the classic-curvature images resemble the original images Volume 2, Issue 4 July August 2013

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 4, July August 2013 ISSN 2278-6856
transformations applied to the images in Figures 1, 2, 3 and 5 are virtual shift-rotations [3]. Figure 4 shows the original Magnetic Resonance Imaging data and to derive the classic-curvature images (shown in Figure 5), the three-dimensional cubic Lagrange interpolation function was fitted and the signal data resampled of the misplacement of 0.096 mm, 0.099 mm and 0.103 mm along the x, y and z directions respectively. In Figure 5, is shown the main characteristic of the classic-curvature images which is that one of depicting the original signal (image) features. of signal-image processing. In this regard, this work presents a comparison between the classic-curvature images obtained while fitting both of B-Spline and Lagrange polynomial functions. The advantage of the method herein presented for the calculation of the classic-curvature is that the method is not subject to approximation likewise convolution operators. However, the calculation of the classiccurvature can introduce some bias due to the arbitrary choice of the model fitted to the signal data. Nevertheless, it is due to recall that the method does not necessarily require re-sampling of the signal data. As to if the image needs re-sampling depends on the formulation of the classic-curvature. In fact, the example shown in Figure 1 offers the classic-curvature map also in absence of resampling (see Figure 1(d) which is obtained with the classic-curvature formula descending from the parametric two-dimensional B-Spline [3]). Also, in the threedimensional case, as it can be seen in equation (17), the classic-curvature does not necessarily necessitates values of misplacements x, y and z to be used in order to resample the image.

4. DISCUSSION AND CONCLUSIONS

To the extent of this manuscript: (i) the model fitted to the signal data is an interpolation function and (ii) rigorous calculus methods are employed to calculate the classic-curvature of the modeled signal data. The discussion of the qualitative results herein presented is geared towards the use of the derivatives of a model function in signal-processing applications such as interpolation. Within the context of the design of univariate interpolation functions, a method that computes the coefficient of the third order polynomial interpolator on the basis of the first order derivatives was reported in [33]. Work published in [34] had reported a novel set of interpolation kernels which make use of the second order derivatives in order to keep the Fourier Transform of the interpolation kernel as flat as possible and so to minimize the change in Fourier properties of the resulting signal after interpolation. It is worth noting the works reported in [35]-[37] in order to set a general line of research providing explicit expressions of the error bound for interpolation functions which depends on the second order derivative of the interpolator. Within the context of non-uniform resampling, derivatives of the interpolation functions (BSplines in the specifics) have been used as energy to minimize in order to reduce the interpolation error [38]. Along the process of reduction of the interpolation error the same authors achieved optimization of the grid of knots (space domain grid points) through the minimization of error bounds dependent on derivatives of the interpolation function. Second order derivatives of the parametric description of the curve were recently employed in order to device smoothing Splines to be used for segmentation [39]-[40]. In the present works the second order derivatives are used in order to calculate the classic-curvature images of signal data fitted and re-sampled with the math models B-Spline and Lagrange polynomials. The contribution of this paper is therefore: (i) to present to the attention of the reader a novel methodology, through the use of calculus, to calculate the second order derivatives of mathematically modeled data, and (ii) to show the resulting classic-curvature images. The implications of this work are multiple into the realm Volume 2, Issue 4 July August 2013

5. ACKNOWLEDGEMENTS
Hereto publishing findings that benefit from OASIS data (http://www.oasis-brains.org/), we are due to mention the following grant numbers: P50 AG05681, P01 AG03991, R01 AG021910, P20 MH071616, U24 RR021382 (http://www.oasis-brains.org/app/template/ UsageAgreement.vm). The author is very grateful to the Rector of the University for Information Science and Technology: Professor Ninoslav Marina, and also to Professor Reza Malekian at the University for Information Science and Technology; for the suggestions provided at the aim to improve the presentation style of this manuscript. Equations (1) through (17) reference the works published in [3] in chapter 2 pages: 66-67.

REFERENCES
[1] M. Unser, A. Aldroubi, M. Eden, B-spline signal processing: Part I theory IEEE Transactions on Signal Processing, 41(2), pp. 821-833, 1993a. [2] M. Unser, A. Aldroubi, M. Eden, B-spline signal processing: Part II efficient design and applications IEEE Transactions on Signal Processing, 41(2), pp. 834-848, 1993b. [3] C. Ciulla, Signal resilient to interpolation: An exploration on the approximation properties of the mathematical functions. CreateSpace Publisher pp. 1336, 2012. [4] H. Farid, E.P. Simoncelli, Differentiation of discrete multidimensional signals IEEE Transactions on Image Processing, 13(4), pp. 496-508, 2004. [5] B. Kumar, S.C. Dutta Roy, Design of digital differentiators for low frequencies Proceedings of the IEEE, 76(3), pp. 287-289, 1988. Page 163

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 4, July August 2013 ISSN 2278-6856
[6] J. Le Bihan, Coefficients of FIR digital differentiators and Hilbert transformers for midband frequencies IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 43(3), pp. 272-274, 1996. [7] I.W. Selesnick, Maximally flat low-pass digital differentiators IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 49(3), pp. 219-223, 2002. [8] C-C. Tseng, Design of fractional order digital FIR differentiators IEEE Signal Processing Letters, 8(3), pp. 77-79, 2001. [9] S-C. Pei, P-H. Wang, Closed-form design of maximally flat FIR Hilbert transformers differentiators and fractional delayers by power series expansion IEEE Transactions on Circuits and Systems Part I: Fundamental Theory and Applications, 48(4), pp. 389-398, 2001. [10] Y.Q. Chen, B.M. Vinagre, A new IIR-type digital fractional order differentiator Signal Processing, 83 pp. 2359-2365, 2003 [11] I. Daubechies, Orthonormal bases of compactly supported wavelets Comm. Pure Appl. Math., 41 pp. 909-996, 1988. [12] S. Mallat, S. Zhong, Characterization of signals from multiscale edges IEEE Trans. Patt. Anal. Machine Intell., 14(7), pp. 710-732, 1992. [13] D. Marr, E. Hildreth, Theory of edge detection Proc. Royal Soc., London 207, pp. 187-217, 1980 [14] J. Canny, A computational approach to edge detection IEEE Trans. Patt. Anal. Machine Intell., PAMI-8, pp. 689-698, 1986. [15] G.W. Wei, Quasi wavelets and quasi interpolating wavelets Chemical Physics Letters, 296, pp. 215222, 1988. [16] V. Torre, T.A. Poggio, On edge detection IEEE Trans. Patt. Anal. Machine Intell., PAMI-8, pp. 147163, 1986. [17] C. Ciulla, Improved signal and image interpolation in biomedical applications: The case of magnetic resonance imaging (MRI). Medical Information Science Reference IGI Global Publisher Hershey PA U.S.A., 2009. [18] L.F. Estrozi, L-G. Rios-Filho, A. Gomes, C. Bianchi R. Jr.b. Marcondes Cesar, L. Da Fontoura Costa, 1D and 2D Fourier-based approaches to numeric curvature estimation and their comparative performance assessment Digital Signal Processing, 13, pp. 172197, 2003. [19] J. Abate, C. Bishof, L. Roh, A. Carle, Algorithms and design for a second-order automatic differentiation module Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation ACM, 1997. [20] J. Prewitt, Object enhancement and extraction In: Picture Processing and Psychopictorics B. Lipkin and A Rosenfeld Eds. New York: Academic, pp. 75-149, 1970. Volume 2, Issue 4 July August 2013 [21] S.K. Lele, Compact difference schemes with spectral-like resolution Journal of Computational Physics, 103, pp. 16-42, 1992. [22] Y. Cha, S. Kim, The error-amended sharp edge (EASE) scheme for image zooming IEEE Transactions on Image Processing, 16(6), pp. 14961505, 2007. [23] J.B. Hiriart-Urruty, Approximating a second-order directional derivative for non-smooth convex functions SIAM Journal on Control and Optimization, 20(6), pp. 783-807, 1982. [24] J.B. Hiriart-Urruty, Calculus rules on the approximate second-order directional derivative of a convex function SIAM Journal on Control and Optimization, 22(3), pp. 381-404, 1984. [25] N. Mai-Duy, T. Tran-Cong, Approximation of function and its derivatives using radial basis function networks Applied Mathematical Modelling, 27(3), pp. 197-220, 2003. [26] R.M. Haralick, Digital step edges from zero crossing of second directional derivatives IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-6(1), pp. 58-68, 1984. [27] R.L. Buckner, D. Head, J. Parker, A.F. Fotenos, D. Marcus, J.C. Morris, A.Z. Snyder, A unified approach for morphometric and functional data analysis in young old and demented adults using automated atlas-based head size normalization: Reliability and validation against manual measurement of total intracranial volume Neuroimage, 23(2), pp. 724-738, 2004. [28] A.F. Fotenos, A.Z. Snyder, L.E. Girton, J.C. Morris, R.L. Buckner, Normative estimates of crosssectional and longitudinal brain volume decline in aging and AD Neurology, 64, pp. 1032-1039, 2005. [29] D.S. Marcus, T. H. Wang, J. Parker, J.G. Csernansky, J. C. Morris, R. L. Buckner, Open Access Series of Imaging Studies (OASIS): Crosssectional MRI data in young middle aged nondemented and demented older adults Journal of Cognitive Neuroscience, 19(9), pp. 1498-1507, 2007. [30] J.C. Morris, The clinical dementia rating (CDR): current version and scoring rules Neurology, 43(11), pp. 2412b-2414b, 1993. [31] E.H. Rubin, M. Storandt, J.P. Miller, D.A. Kinscherf, E.A. Grant, J.C. Morris, L.A. Berg, A prospective study of cognitive function and onset of dementia in cognitively healthy elders Archives of Neurology, 55(3), pp. 395-401, 1998. [32] Y. Zhang, M. Brady, S. Smith, Segmentation of brain MR images through a hidden Markov random field model and the expectation maximization algorithm IEEE Transactions on Medical Imaging, 20(1), pp. 45-57, 2001. [33] H. Akima, A method of univariate interpolation that has the accuracy of a third-degree polynomial ACM Transactions on Mathematical Software, 17(3), pp. 341-366, 1991. Page 164

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 4, July August 2013 ISSN 2278-6856
[34] C.G. Appledorn, A new approach to the interpolation of sampled data IEEE Transactions on Medical Imaging, 5(3), pp. 369-376, 1996. [35] S. Waldron, A multivariate form of Hardys inequality and Lp-error bounds for multivariate Lagrange interpolation schemes SIAM J. Math. Anal., 28, pp. 233-258, 1997. [36] S. Waldron, The error in linear interpolation at the vertices of a simplex SIAM J Numer. Anal., 35, pp. 1191-1200, 1998. [37] S. Waldron, Minimally supported error representations and approximation by the constants Numer. Math., 85, pp. 469-484, 2000. [38] X. Deng, T.S. Denney, On optimizing knot positions for multidimensional B-spline models In: Proceedings of SPIE, 5299, pp. 175-186, 2004. [39] F. Precioso, M. Barlaud, T. Blu, M. Unser, Smoothing B-spline active contour for fast and robust image and video segmentation Proceedings of the International Conference on Image Processing, Spain 1, pp. 137-140, 2003. [40] F. Precioso, M. Barlaud, T. Blu, U. Unser, Robust real-time segmentation of images and videos using a smooth-spline snake-based algorithm IEEE Transactions on Image Processing, 14(7), pp. 910924, 2005.

AUTHOR
Carlo Ciulla had been undergraduate and graduate student at the University of Palermo, Italy, RUTGERS University, U.S.A. and the New Jersey Institute of Technology, U.S.A. from the year 1987 to the year 2002. He has earned the following graduate degrees: Laurea in Management Engineering (1994, Italy); an M.S. in Information Systems and a Ph.D. in Computer and Information Science (2000, 2002, U.S.A.). Following the completion of the Doctoral degree, Carlo's former academic appointments were: Research Associate at Yale University (2002-2003); Postdoctoral Scholar at the University of Iowa (2004-2005); Postdoctoral Scholar at Wayne State University (2005-2007); Assistant Professor of Computer Science at Lane College (2007-2009). During the years 2009-2012 Carlo was a self employed scholar whom devoted his time to his research interest related to the development of innovative methods of signal interpolation and also to the development of educational software for students. In September 2012 Carlo joined as Assistant Professor of Computer Science, the University for Information Science and Technology in Ohrid, Macedonia.

Volume 2, Issue 4 July August 2013

Page 165