Fractional dierentiation for edge detection

Size: px
Start display at page:

Download "Fractional dierentiation for edge detection"

Transcription

1 Signal Processing 83 (2003) Fractional dierentiation for edge detection B. Mathieu, P. Melchior, A. Oustaloup, Ch. Ceyral LAP-UMR 5131 CNRS, Universite Bordeaux 1-ENSEIRB, 351 cours de la Liberation, F33405 Talence cedex, France Received 2 December 2002 Abstract In image processing, edge detection often makes use of integer-order dierentiation operators, especially order 1 used by the gradient and order 2 by the Laplacian. This paper demonstrates how introducing an edge detector based on non-integer (fractional) dierentiation can improve the criterion ofthin detection, or detection selectivity in the case ofparabolic luminance transitions, and the criterion ofimmunity to noise, which can be interpreted in term ofrobustness to noise in general.? 2003 Elsevier B.V. All rights reserved. Keywords: Image processing; Edge detection; Robust edge detector; Noise immunity; Fractional dierentiation 1. Introduction Fractional dierentiation, also called non-integer dierentiation, is not a new concept: it dates back to Cauchy, Riemann, Liouville and Letnikov in the 19th century. Since then, several theoretical physicists and mathematicians have studied fractional dierential equations, especially fractional-order linear dierential equations. See for example the now classic [18], the more formalized [17,19,27] for a thorough mathematical study ofthe equations. In the last two decades, fractional dierentiation has played a very important role in various physical sciences elds, such as mechanics, electricity, chemistry, biology, economics, modelling, time and frequency domains system identication and notably control theory, mechatronics Corresponding author. Tel.: ; fax: address: melchior@lap.u-bordeaux.fr (P. Melchior). URL: and robotics [19,29]. Fractal theory is already used in fractal image compression [1,3,8,9,12,14,15,30]. In image processing, edge detection often makes use ofinteger-order dierentiation operators, especially order 1 used by the gradient and order 2 by the Laplacian [2,4,5,10,13,16,25,26,28,31]. In [20 23], the principles ofnon-integer order dierentiation operators in edge detection is introduced. This paper demonstrates with details how using an edge detector based on fractional dierentiation can improve the criterion ofthin detection, or detection selectivity in the case ofparabolic luminance transitions, and the criterion ofimmunity to noise, which can be interpreted in term ofrobustness to noise in general. This paper also evaluates the improvement ofthe proposed method over Prewitt s gradient. After some denitions in image processing in Section 2 ofthe paper, Section 3 deals with the detection power offractional dierentiation, particularly through an analysis ofthe non-integer derivative function ofa parabolic step-type luminance transition. The derivative order n is considered between 0 and 1, then between 0 and 2. Between 0 and 1 the maximum ofthe /$ - see front matter? 2003 Elsevier B.V. All rights reserved. doi: /s (03)

2 2422 B. Mathieu et al. / Signal Processing 83 (2003) derivative does not appear at the inexion point ofthe transition. However, between 1 and 2, not only does it appear at the inexion point, but it also displays a vertical slope ofthe derivative to the right ofthe inexion point abscissa. To increase selectivity even more, a methodical approach, through the generation ofa cusp ofthe derivative at the inexion point abscissa, leads to the synthesis ofa fractional-order robust edge detector. This is referred to CRONE detector (French abbreviation of Contour Robuste d Ordre Non Entier ). Its robustness is to noise, which ensures its ltering function, particularly of high frequencies when using a negative derivative order. Section 3 ofthis paper deals with the spatial description of the CRONE detector. Section 4 analyses the detection selectivity. The compromise between selectivity and immunity to noise is improved in Section 5 by extending the CRONE detector, designed for n ]1; 2[, to a derivative order between 1 and 1. Section 6 deals with the spatial description ofthe CRONE detector, and Section 7 presents the extension ofthe CRONE detector to two dimensions and the comparison ofits performance with respect to Prewitt s gradient. Performance is evaluated using a wide variety ofimages: articial images with and without noise, and real images ofvarious origins (biomedical and industrial) where the noise level is suciently high for their processing to be signicant. 2. Denitions An image can be interpreted as a function of two variables dened within a bounded area, the function s value also being within a bounded interval. One ofthe rst operations to be carried out on an image is its discretization. This is done by spatial sampling ofthe image, and then by quantication of luminous intensity. An image is thus represented by a matrix ofbounded positive integer values. The gradient image ofimage f(i; j), is the matrix ofpositive real values whose elements a ij are the modulus ofthe gradient at point M(i; j) within the denition area ofimage f(i; j). A point ofcontour is generally dened by the in- exion point ofa luminance transition. A contour Fig. 1. The maximum ofthe derivative f (1) (x) determines the abscissa x 0 ofthe inexion point oftransition f(x). can thus be dened as the position ofthe luminance inexion points. The extraction of contour consists in detecting all inexion points ofluminance transitions. This is to reduce the quantity ofinformation contained in an image to a minimum for recognizing shapes. Given that an inexion point is the point where the slope is maximal, its detection can consist in nding the abscissa ofthe maximum ofthe rst derivative (Fig. 1). The contour image ofimage f(i; j) is the positive real value matrix where elements a ij are obtained by thresholding the gradient image. 3. Analysis of the detection power of fractional dierentiation The object ofthis paragraph is to study the fractional derivative applied to a parabolic step-type transition, and in particular to compare the abscissa ofits maximum to that ofthe inexion point ofthe transition. In this study, the derivative order n is considered initially between 0 and 1, and then between 1 and 2. Each ofthese intervals determines a specic shape of the derivative curves. The parabolic transition considered provides an inexion point at abscissa x 0 = 200 (Fig. 2). It is

3 B. Mathieu et al. / Signal Processing 83 (2003) Fig. 2. Parabolic step-type transition where a =1=(2x 2 0 ). described analytically by f(x) with f(x)=0 forx60; (1) f(x)=ax 2 for 0 6 x 6 x 0 ; (2) f(x)= ax 2 +4ax 0 x 2ax 2 0 for x 0 6 x 6 2x 0 ; (3) f(x)=2ax0 2 for x 2x 0 : (4) By applying the Cauchy formalism [6,7], the fractional derivative of f(x), being f n (x), can be written as follows: f (n) (x)=0 forx60; (5) f (n) (x)= f (n) (x)= 2a ( n +3) x n+2 for 0 6 x 6 x 0 ; (6) 4a ( n +3) (x x 0) n+2 + 2a ( n +3) x n+2 for x 0 6 x 6 2x 0 ; (7) f (n) (x)= 4a ( n +3) (x x 0) n a ( n +3) x n+2 2a ( n +3) (x 2x 0) n+2 for x 2x 0 : (8) Fig. 3. Normalized modulus of f (n) (x) for various derivative orders between 0 and 1: the maximum ofthe fractional derivative f (n) (x) no longer determines the abscissa ofthe transition inexion point Derivative order between 0 and 1 In the case where n ]0; 1[, the abscissa ofthe fractional derivative maximum no longer corresponds to that ofthe transition inexion point. The farther n is from 1, the greater the shift (n) to the right ofthe inexion point (Fig. 3). The shift (n) thus dened is determined analytically as follows. If x 1 is the abscissa ofthe maximum of f (n) (x), the rst derivative of f (n) (x) is zero at x 1, i.e. [ ] d dx f(n) (x) =0: (9) x=x 1 In order to show that x 1 is greater than x 0, i.e. that maximum of f (n) (x) is clearly oset to the right of x 0, it suces to express the rst derivative f (n) (x) atx 0 [ d dx f(n) (x) ] x=x 0 = 2a ( n +2) x n+1 0 (10) then to verify that this is positive. This is the case as indicated clearly by relation (10). Thus having shown that x 1 is greater than x 0 and putting forward the hypothesis that x 1 remains inferior to 2x 0, and with f (n) (x) given by (7), Eq. (9) becomes 4a ( n +2) (x 1 x 0 ) n+1 2a + ( n +2) x n+1 1 =0 (11)

4 2424 B. Mathieu et al. / Signal Processing 83 (2003) Fig. 4. Variation ofnormalized shift (n)=(n)=x 0 for n ]0; 1[. Fig. 5. Normalized modulus of f (n) (x) for various derivative orders between 1 and 2: the maximum ofthe derivative off (n) (x) once again determines the abscissa ofthe transition inexion point. from which can be extracted the expression of the shift (n)=x 1 x 0 as a function of x 0, i.e. 1 (n)= 2 1=(1 n) 1 x 0: (12) This result shows that (n) remains inferior to x 0 for n ]0; 1[ and thus validates x 1 ]x 0 ; 2x 0 [. The graph of (n) variation (Fig. 4) shows that the shift increases as n decreases from 1 to 0, thus conrming the interpretation offig. 3. and [ ] d dx f(n) (x) x=x 0 + 4a = lim x x + 0 ( n +2) (x x 0) n+1 2a = + ( n +2) x n+1 (14) 3.2. Derivative order between 1 and 2 In the case where n ]1; 2[, the abscissa ofthe fractional derivative maximum corresponds to that ofthe transition inexion point. As can be seen in Fig. 5, there is no shift (n) as there is for n ]0; 1[. Another remarkable property is the innite slope ofthe derivative to the right ofthe inexion point abscissa (Fig. 5). Thus, for 1 n 2, fractional dierentiation ensures, not only that detection ofthe transition inexion point is achieved (1st property), but also that is highly selective (2nd property). The discontinuity ofthe slope off (n) (x) at x 0 is demonstrated by expressing successively the rst derivative of f (n) (x) on the left and on the right of x 0 i.e., using relation (6) and (7) [ d dx f(n) (x) ] x=x 0 = 2a ( n +2) x n+1 0 (13) the expression thus obtained show the slope discontinuity found in Fig. 5. In order to improve further the detection selectivity ofthe inexion point, the following paragraph shows how to bring in an operator where the response to a parabolic step-type transition presents an innite slope both on the right and on the left ofthe abscissa ofthe inexion point. 4. Detection selectivity 4.1. Denition The direction selectivity ofan inexion point, S N, can be dened as the inverse ofthe bandwidth at N% ofthe detector response maximum, x, (Fig. 6), i.e. S N = 1 x : (15)

5 B. Mathieu et al. / Signal Processing 83 (2003) Fig. 6. The ratio 1=x denes detection selectivity. Fig. 7. Selectivity improvement by creating a cusp. Fig. 8. Stages ofthe adopted approach for 1 n 2: (a) obtained f (n) (x) for increasing x, (b) expected f (n) (x) for decreasing x, (c) obtained f (n) (x) for decreasing x Strategy for increasing selectivity Principle The aim is to improve inexion point detection selectivity. The strategy for achieving such an improvement consists in designing an operator where the response (in this case to a parabolic step) shows a cusp on the inexion point abscissa, i.e., an innite slope on each side ofthis abscissa (Fig. 7) Methodicalapproach to achieve a CRONE detector using a derivative order between 1 and 2 For a derivative order between 1 and 2, we have shown that the slope ofthe derivative is innite on the right ofthe inexion point abscissa when calculated with increasing x (Fig. 8a). Calculating the derivative function with decreasing x could then be expected to provide an innite slope on the left (Fig. 8b). Although the resulting slope is in fact innite, the curve, Fig. 8c, is the opposite offig. 8b. Thus, an adequate solution can be (Fig. 9): rst, to take the opposite ofthe derivative function calculated with decreasing x, second, to add the derivative function calculated with increasing x. This provides cusp. Fig. 9. Construction ofthe response ofthe CRONE detector for 1 n 2: (a) f (n) (x) calculated with increasing x; (b) opposite f (n) (x) calculated with decreasing x; (c) detector response. The procedure thus dened is that used by the CRONE detector, (French abbreviation of Contour Robuste d Ordre Non Entier ). The robustness involved is a measure ofthe immunity to noise and is studied below. The spatial operator which denes this detector, applied to transition f(x), thus subtracts f (n) (x) calculated using decreasing x, from f (n) (x) calculated using increasing x. It is written as D n, the double arrow indicating increasing and decreasing x for dierentiation at order n. Fig. 10 illustrated the selectivity variation as a function of the derivative order by giving the

6 2426 B. Mathieu et al. / Signal Processing 83 (2003) Fig. 10. Normalized modulus of D n f(x) for various derivative orders between 1 and 2 (the f(x) transition is that offig. 2). response ofthe CRONE detector to the parabolic transition offig. 2 for various derivative orders between 1 and 2. It can be seen that selectivity increases with the derivative order and tends toward innity when the orders tends towards 2. Fig. 11. Normalized response ofthe CRONE detector to the parabolic transition offig. 2 for a greater calculation range than the transition width, and for each of two derivative orders between 1 and Improvement of the selectivity/immunity-to-noise compromise 5.1. The selectivity/immunity-to-noise dilemma The selectivity/immunity-to-noise dilemma stems from two contradictory requirements: the detection selectivity ofan inexion point and its insensitivity to transition noise. Increasing one ofthese performances causes the other to decrease. For n ]1; 2[, we have shown that selectivity increases along with the derivative order. However, immunity to noise diminishes along with the derivative order, thus a derivative order as low as possible is preferable, i.e. less than 1, and even less than 0 for generalized (any order) integration Extension of the CRONE detector to a derivative order between 1 and 1 In order to improve the selectivity/immunityto-noise compromise, notably by increasing immunity to noise, an extension ofthe CRONE detector (designed for n ]1; 2[) to derivative orders between 0 and 1, and between 1 and 0, can be achieved by Fig. 12. Normalized response ofthe CRONE detector to the parabolic transition offig. 2 for a narrower calculation range than the transition width, and for each of two derivative orders between 1 and 1. considering that the (n) shift inherent to such orders is cancelled out due to the symmetric character represented spatially by the D n operator. Figs. 11 and 12 illustrate this consideration to be valid. The application ofthe D n operator to the parabolic transition ofthe Fig. 2 for two derivative orders between 1 and 1, shows that the (n) shift seen above (Fig. 3) forn ]0; 1[ is present longer Selectivity IfFig. 12, which corresponds to a mask (41) whose width is less than that ofthe transition, shows that the (n) shift is null, it also illustrates another

7 B. Mathieu et al. / Signal Processing 83 (2003) Fig. 13. Normalized derivative function of the parabolic transition ofthe Fig. 2. property quite as remarkable, that is, for n ] 1; 1[, the CRONE detector conserves comparable selectivity to that achieved using integer order 1 (Fig. 13) Immunity to noise The gain ofthe symbolic operator offractional differentiation s n decreases by 6n db=oct for n ] 1; 0[ (low-pass ltering) whereas it increases by 6 db=oct for n = 1 (high-pass ltering). Thus, for a comparable selectivity of Figs. 12 and 13, a CRONE detector with an order between 1 and 0 can ensure a much better immunity to noise than an order 1 derivative and improves thus the selectivity/immunity-to-noise compromise. This is conrmed by the response ofan order 0:75 CRONE detector to a noise parabolic step (Fig. 14). The gure shows that the detector response peak determines the abscissa ofthe inexion point ofthe transition independently ofthe noise. The detector is therefore robust to noise (cf. Section 4.2.2). Fig. 14. (a) Noisy parabolic step, (b) normalized response ofthe order 0:75 CRONE detector. 6. Spatial characterisation of the crone detector 6.1. Impulse response of D n Fig. 15. Impulse response (causal) ofthe spatial operator D n for Re[n] R. f (n) (x), the fractional derivative of f(x), calculated with increasing x, can be written as D n f(x)=f(x) D n (x) (16) in which D n (x) represents the nth derivative for increasing x ofthe unitary Dirac s impulse (x), i.e. for Re[n] R (Fig. 15) x n 1 for x 0; D n (x)= ( n) 0 f or x 6 0: (17)

8 2428 B. Mathieu et al. / Signal Processing 83 (2003) Fig. 16. Impulse response (anticausal) ofthe spatial operator D n for Re[n] R. f (n) (x), the fractional derivative of f(x), calculated for decreasing x can be written as D n f(x)=f(x) D n (x) (18) in which D n (x) represents the nth derivative for decreasing x ofthe unitary Dirac s impulse (x), i.e. for Re[n] R (Fig. 16) 0 f or x 0; D n (x)= x n 1 (19) for x 0: ( n) The spatial operator D n, as dened in Section 4.2.2, is applied to transition f(x), i.e. D n f(x)=d n f(x) D n f(x) (20) or D n f(x)=f(x) D n (x) f(x) D n (x) (21) or, given the distributivity ofthe convolution product D n f(x)=f(x) (D n (x) D n (x)) (22) or, given, (20) D n f(x)=f(x) D n (x) (23) with D n (x)=d n (x) D n (x) (24) in which D n (x) is the impulse response ofthe spatial operator D n which denes the CRONE detector. Fig. 17. Impulse response (non causal) ofthe CRONE detector for Re[n] R. By including (17) and (19), in relation (24) the analytical expression of D n (x) forre[n] R is obtained D n (x)= x n 1 ( n) x n 1 ( n) or, more concisely for x 0; for x 0 (25) D n (x)= x n 1 sign (x): (26) ( n) Also, the combination offigs. 15 and 16 in accordance with relation (24) provides, still for Re[n] R, the representative graph ofthe impulse variations of the spatial operator D n (Fig. 17). This impulse response has two inherent properties ofany linear edge detector: it is odd, it tends to zero at ±. The rst permits the determination ofan absence ofan inexion point in an area ofconstant levels ofgrey. The latter ensures a reasonable enough level ofthe complexity ofthe calculation. We have now formulated the impulse response of D n with a condition on the derivative order n. The following deals with the more general formulation of D n with no condition on the derivative order n.

9 B. Mathieu et al. / Signal Processing 83 (2003) Formulation of D n f (1) (x), the rst derivative of f(x), calculated with increasing x can be written as D n f(x) f(x h) f(x)= h and f (1) (x) with decreasing x (27) D n f(x) f(x + h) f(x)= (28) h h being innitely small. The introduction ofshift operator q applicable to a concrete function and dened by qf(x)=f(x + h) or q 1 f(x)=f(x h) (29) gives q 1 f(x)=1 f(x) (30) h and D D f(x)=1 q f(x) (31) h and thus D = 1 q 1 (32) h and D = 1 q (33) h so, at order n: ( ) 1 q D n 1 n = (34) h and ( ) n 1 q D n = : (35) h Thus, the spatial operator D n dened by (20), i.e. D n = D n D n gives (36) D n = 1 h n [(1 q 1 ) n (1 q) n ] (37) and, by expanding respectively (1 q 1 ) n and (1 q) n using Newton s binomial formula D n = 1 h n k=0 k n(n 1) (n k +1) ( 1) k! (q k q k ): (38) The application of D n thus formulated at a transition f(x) gives D n f(x)= 1 h n where a k =( 1) k ( n k k=0 ) a k [f(x kh) f(x + kh)]; (39) k n(n 1) (n k +1) =( 1) : (40) k! 7. The CRONE detector in two dimensions 7.1. Extension of the CRONE detector to 2D In order to extract the contours ofan image, one can extend the CRONE detector, designed for one dimension, to two dimensions, then verify the preservation ofits properties. We shall therefore consider the vectorial operator with two independent components, respectively on x and y. Each component is provided by a single dimension CRONE detector where its dening D n operator is spatially truncated, as permitted in practice with unlimited series (38). If N N designates the dimension ofthe image, and 2m + 1 the size ofthe components ofthe mask, the calculation complexity ofeach component is mn 2 multiplications and (2m 1)N 2 additions. The mask corresponding to the horizontal component can be written as [+a m + a 1 0 a 1 a m ] (41)

10 2430 B. Mathieu et al. / Signal Processing 83 (2003) and for the vertical component +a m. +a 1 0 a 1. a m (42) the a k elements being the coecients ofthe Newton s binomial (40). Fig. 18. Non-noisy circular image with parabolic luminance transitions (top: 3D view; bottom: grey level view) Comparison of CRONE detector and Prewitt s gradient performances To verify whether the properties of selectivity and immunity to noise presented in Section 5.2 are maintained in 2D, a wide variety ofimage types need to be tested, including: articial images, on the one hand non-noisy and using a positive derivative order (fractional dierentiation), and on the other hand noisy, using a negative derivative order (fractional integration), real images, where positive or negative derivative orders are chosen depending on the type ofimage treated. Fig. 19. Non-noisy circular image with Gaussian luminance transitions (top: 3D view; bottom: grey level view) Articialimages Simulated images (100 2 pixels and 256 levels of grey) are circular and the luminance transitions are parabolic or Gaussian. Non-noisy images are given in Figs. 18 and 19, and noisy in Figs. 20 and 21. Performance evaluation can be carried out by analyzing the quality ofthe extracted contour, as compared to that obtained using Prewitt s gradient. For each type ofimage, the gures give both a 3D and a level ofgrey version for: luminance L=f(i; j), in which i and j are the pixel coordinates (1 i 100; 1 j 100), gradient image obtained with the Prewitt s gradient, gradient image obtained with the CRONE detector. Fig. 20. Noisy circular image with parabolic luminance transitions (top: 3D view; bottom: grey level view). For non-noisy images where a positive derivative order (between 1 and 2) is used, the gradient image in Fig. 18, obtained from parabolic transition images, displays better selectivity with the CRONE detector.

11 B. Mathieu et al. / Signal Processing 83 (2003) Fig. 22. Biomedical image: echography ofa kidney. Fig. 21. Noisy circular image with Gaussian luminance transitions (top: 3D view; bottom: grey level view). For the Gaussian transition image, Fig. 19, no selectivity dierence can be noted. This is to be expected as CRONE detector selectivity has no particular robustness to transition type. For noisy images where a negative derivative order (between 1 and 0) is used, the gradient images of Figs. 20 and 21 show the CRONE detector to have not only a much better immunity to noise, but also robustness ofthis immunity to transition type. As well as the qualitative analysis providing these comparative performances, the use of Peli and Malah s criteria [24] permits quantitative analysis [11] ofthese performances which are signicantly conrmed, notably through avoiding any visual subjectivity Realimages The real images considered are ofdiverse origins (biomedical and industrial) and are suciently noisy for processing to be signicant. They are taken from the CNRS Image Department data base. As for articial images, performance evaluation can be carried out by analysing the quality ofthe extracted contour, as compared to that obtained using Prewitt s gradient. Also, for each type of image, the gradient image is given for each of the two extraction techniques (Prewitt s and CRONE). The contours ofnoisy images in Figs. 22 and 23 are extracted using a derivative order between 1 and 0. The gradient images displays a much better immunity to noise ofthe CRONE detector. Fig. 23. Industrial image: X-ray revealing ssuring. 8. Conclusion In order to increase the selectivity ofthe edge detection for parabolic step-type luminance transition, a cusp is created on the inexion point abscissa. This is made possible by the synthesis ofa new detector, the CRONE detector, obtained though the generalization ofthe derivative order to include fractional order, and dened by relation (38). The particularity ofthe CRONE detector is that a derivative order between 1 and 2 favours detection selectivity, whereas a derivative order between 1 and 1 favours robustness of immunity to noise; with a selectivity comparable to that ofa rst derivative, the CRONE detector provides improved immunity to noise. The comparison ofits performance with respect to Prewitt s gradient was presented. Performance was evaluated using a wide variety ofimages: articial images with and without noise, and real images ofvarious origins. Performance levels obtained reveal in all cases a better immunity to noise ofthe CRONE detector. As prospects, next works consist in the comparison ofthe CRONE detector with respect to the others modern and robust edge detectors. References [1] M.F. Barnsley, L.P. Hurd, Fractal Image Compression, AK Peters Ltd, Wellesley, MA, 1993.

12 2432 B. Mathieu et al. / Signal Processing 83 (2003) [2] J.F. Canny, A computational approach to edge detection, IEEE Trans. PAMI 8 (6) (1986) [3] G. Cherbit, Fractals: dimensions non entieres et Applications, Editions Masson, Paris, France, [4] J.-P. Cocquerez, S. Philipp, Analyse d images: ltrage et segmentation, Editions Masson, Paris, France, [5] R. Deriche, Using Canny s criteria to derive a recursively implemented optimal edge detector, Internat. J. Comput. Vision 1 (2) (1987) [6] A. Erdelyi, Higher Transcendental Functions, Vol. 1, California Institute of Technology, McGraw-Hill, New York, [7] A. Erdelyi, Operational calculus and generalized functions, Holt, Rinehart and Winston, 1962, Calcul operationnel et fonctions generalisees, Editions Dunod, Paris, [8] F. Family, T. Vicsek, Dynamics offractal Surfaces, World Scientic, Singapore, [9] Y. Fisher, Fractal Image Compression: Theory and Application, Springer, New York, USA, [10] M. Heath, S. Sarkar, T. Sanocki, K. Bowyer, Comparison ofedge detectors: a methodology and initial study, Comput. Vision Image Understanding 69 (1) (1998) 38 54, [11] A.K. Jain, Fundamentals ofdigital Image Processing, Prentice-Hall, Englewood Clis, NJ, [12] A. Le Mehaute, Les geometries fractales, Editions Hermes, Paris, France, [13] J.S. Lim, Two-Dimensional Signal and Image Processing, Prentice-Hall, Englewood Clis, NJ, [14] B. Mandelbrot, Les Fractales, Editions Flammarion, France, [15] B. Mandelbrot, The Fractal Geometry ofnature, Freeman, San Francisco, USA, [16] D. Marr, E. Hidreth, Theory ofedge detection, Proc. Roy. Soc. London B 204 (1982) [17] K.S. Miller, B. Ross, An Introduction to the Fractional Calculus and Fractional Dierential Equations, Wiley-Interscience Publication, New York, [18] K.B. Oldham, J. Spanier, The Fractional Calculus, Academic Press, New York, London, [19] A. Oustaloup, La derivation non entiere: theorie, synthese et applications, Editions Hermes, Paris, France, [20] A. Oustaloup, B. Mathieu, P. Melchior, Edge detection using non integer derivation, Presented at the IEEE European Conference on Circuit Theory and Design (ECCTD 91), Copenhagen, Denmark, September 3 6, [21] A. Oustaloup, B. Mathieu, P. Melchior, Robust edge detector ofnon integer order: the CRONE detector, Presented at the 8th Congres de Cytometrie en Flux et d Analyse d lmage (ACF 91), Mons, Belgique, November 6 8, [22] A. Oustaloup, B. Mathieu, P. Melchior, Edge detection using non integer derivation, Presented at the International Summer School Fractal and Hyperbolic Geometries, Fractional and Fractal Derivatives in Engineering, Applied Physics and Economics, Bordeaux, France, July 3 8, [23] A. Oustaloup, P. Melchior, B. Mathieu, Improvement of contour extraction in image processing, Presented at the 7th Congres de Cytometrie en Flux et d Analyse d lmage (ACF 90), Bordeaux, France, October 10 12, [24] Peli, Malah, A study ofedge detection algorithms, Comput. Graph. Image Process. 20 (1982) [25] W.K. Pratt, Digital Image Processing, Wiley, New York, [26] J.M.S. Prewitt, Object enhancement and extraction, in: B.S. Likin, A. Rosenfeld (Eds.), Picture Processing and Psychopictorics, Academic Press, London, 1970, pp [27] S.G. Samko, A.A. Kilbas, O.I. Marichev, Fractional Integrals and Derivatives, Gordon and Breach Science Publishers, London, [28] J. Shen, S. Castan, An optimal linear operator for step edge detection, CVGIP 54 (1992) [29] H. Takayasu, Fractals in the Physical Sciences, Wiley, New York, [30] C. Tricot, Courbes et dimension fractales, Editions Sciences et Culture, France, [31] D. Ziou, S. Tabbone, Edge detection techniques: an overview, Technical Report, No. 195, Dept. Math & Informatique, Sherbrooke University, 1997.

Detection of signal transitions by order statistics filtering

Detection of signal transitions by order statistics filtering Detection of signal transitions by order statistics filtering A. Raji Images, Signals and Intelligent Systems Laboratory Paris-Est Creteil University, France Abstract In this article, we present a non

More information

A method for modelling and simulation of fractional systems

A method for modelling and simulation of fractional systems Signal Processing 83 (23) 2319 2333 wwwelseviercom/locate/sigpro A method for modelling and simulation of fractional systems T Poinot, J-C Trigeassou Laboratoire d Automatique et d Informatique Industrielle,

More information

Constrained Leja points and the numerical solution of the constrained energy problem

Constrained Leja points and the numerical solution of the constrained energy problem Journal of Computational and Applied Mathematics 131 (2001) 427 444 www.elsevier.nl/locate/cam Constrained Leja points and the numerical solution of the constrained energy problem Dan I. Coroian, Peter

More information

Edge Detection. CS 650: Computer Vision

Edge Detection. CS 650: Computer Vision CS 650: Computer Vision Edges and Gradients Edge: local indication of an object transition Edge detection: local operators that find edges (usually involves convolution) Local intensity transitions are

More information

On reaching head-to-tail ratios for balanced and unbalanced coins

On reaching head-to-tail ratios for balanced and unbalanced coins Journal of Statistical Planning and Inference 0 (00) 0 0 www.elsevier.com/locate/jspi On reaching head-to-tail ratios for balanced and unbalanced coins Tamas Lengyel Department of Mathematics, Occidental

More information

NP-hardness of the stable matrix in unit interval family problem in discrete time

NP-hardness of the stable matrix in unit interval family problem in discrete time Systems & Control Letters 42 21 261 265 www.elsevier.com/locate/sysconle NP-hardness of the stable matrix in unit interval family problem in discrete time Alejandra Mercado, K.J. Ray Liu Electrical and

More information

Numerical Detection of the Lowest Efficient Dimensions for Chaotic Fractional Differential Systems

Numerical Detection of the Lowest Efficient Dimensions for Chaotic Fractional Differential Systems The Open Mathematics Journal, 8, 1, 11-18 11 Open Access Numerical Detection of the Lowest Efficient Dimensions for Chaotic Fractional Differential Systems Tongchun Hu a, b, and Yihong Wang a, c a Department

More information

On the discrete representation of the Laplacian of Gaussian

On the discrete representation of the Laplacian of Gaussian Pattern Recognition 32 (1999) 1463}1472 On the discrete representation of the Laplacian of Gaussian Steve R. Gunn* Image, Speech and Intelligent Systems Group, Department of Electronics and Computer Science,

More information

Taylor series based nite dierence approximations of higher-degree derivatives

Taylor series based nite dierence approximations of higher-degree derivatives Journal of Computational and Applied Mathematics 54 (3) 5 4 www.elsevier.com/locate/cam Taylor series based nite dierence approximations of higher-degree derivatives Ishtiaq Rasool Khan a;b;, Ryoji Ohba

More information

Minimum and maximum values *

Minimum and maximum values * OpenStax-CNX module: m17417 1 Minimum and maximum values * Sunil Kumar Singh This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 In general context, a

More information

On the Designing of Fractional Order FIR Differentiator Using Radial Basis Function and Window

On the Designing of Fractional Order FIR Differentiator Using Radial Basis Function and Window On the Designing of Fractional Order FIR Differentiator Using Radial Basis Function and Window Manjeet Kumar Digital Signal Processing Laboratory, Room No. 135, ECE Division, Netaji Subhas Institute of

More information

Approximating fractional derivatives through the generalized mean

Approximating fractional derivatives through the generalized mean Approximating fractional derivatives through the generalized mean J.A. Tenreiro Machado, Alexandra M. Galhano, Anabela M. Oliveira, József K. Tar a b s t r a c t This paper addresses the calculation of

More information

2 P. L'Ecuyer and R. Simard otherwise perform well in the spectral test, fail this independence test in a decisive way. LCGs with multipliers that hav

2 P. L'Ecuyer and R. Simard otherwise perform well in the spectral test, fail this independence test in a decisive way. LCGs with multipliers that hav Beware of Linear Congruential Generators with Multipliers of the form a = 2 q 2 r Pierre L'Ecuyer and Richard Simard Linear congruential random number generators with Mersenne prime modulus and multipliers

More information

Feature Extraction and Image Processing

Feature Extraction and Image Processing Feature Extraction and Image Processing Second edition Mark S. Nixon Alberto S. Aguado :*авш JBK IIP AMSTERDAM BOSTON HEIDELBERG LONDON NEW YORK OXFORD PARIS SAN DIEGO SAN FRANCISCO SINGAPORE SYDNEY TOKYO

More information

Image Gradients and Gradient Filtering Computer Vision

Image Gradients and Gradient Filtering Computer Vision Image Gradients and Gradient Filtering 16-385 Computer Vision What is an image edge? Recall that an image is a 2D function f(x) edge edge How would you detect an edge? What kinds of filter would you use?

More information

Intrinsic diculties in using the. control theory. 1. Abstract. We point out that the natural denitions of stability and

Intrinsic diculties in using the. control theory. 1. Abstract. We point out that the natural denitions of stability and Intrinsic diculties in using the doubly-innite time axis for input-output control theory. Tryphon T. Georgiou 2 and Malcolm C. Smith 3 Abstract. We point out that the natural denitions of stability and

More information

Slide a window along the input arc sequence S. Least-squares estimate. σ 2. σ Estimate 1. Statistically test the difference between θ 1 and θ 2

Slide a window along the input arc sequence S. Least-squares estimate. σ 2. σ Estimate 1. Statistically test the difference between θ 1 and θ 2 Corner Detection 2D Image Features Corners are important two dimensional features. Two dimensional image features are interesting local structures. They include junctions of dierent types Slide 3 They

More information

Relative Irradiance. Wavelength (nm)

Relative Irradiance. Wavelength (nm) Characterization of Scanner Sensitivity Gaurav Sharma H. J. Trussell Electrical & Computer Engineering Dept. North Carolina State University, Raleigh, NC 7695-79 Abstract Color scanners are becoming quite

More information

Performance Comparison of Two Implementations of the Leaky. LMS Adaptive Filter. Scott C. Douglas. University of Utah. Salt Lake City, Utah 84112

Performance Comparison of Two Implementations of the Leaky. LMS Adaptive Filter. Scott C. Douglas. University of Utah. Salt Lake City, Utah 84112 Performance Comparison of Two Implementations of the Leaky LMS Adaptive Filter Scott C. Douglas Department of Electrical Engineering University of Utah Salt Lake City, Utah 8411 Abstract{ The leaky LMS

More information

size within a local area. Using the image as a matched lter, a nite number of scales are searched within a local window to nd the wavelet coecients th

size within a local area. Using the image as a matched lter, a nite number of scales are searched within a local window to nd the wavelet coecients th In Proceeding of the 3rd International Workshop on Digital Mammography Chicago, U.S.A. 1996, pp. 447-450 Segmentation of Masses Using Continuous Scale Representations Andrew Laine a, Walter Huda b, Dongwei

More information

Mahmoud M. El-Borai a, Abou-Zaid H. El-Banna b, Walid H. Ahmed c a Department of Mathematics, faculty of science, Alexandria university, Alexandria.

Mahmoud M. El-Borai a, Abou-Zaid H. El-Banna b, Walid H. Ahmed c a Department of Mathematics, faculty of science, Alexandria university, Alexandria. International Journal of Basic & Applied Sciences IJBAS-IJENS Vol:13 No:01 52 On Some Fractional-Integro Partial Differential Equations Mahmoud M. El-Borai a, Abou-Zaid H. El-Banna b, Walid H. Ahmed c

More information

Machine vision. Summary # 4. The mask for Laplacian is given

Machine vision. Summary # 4. The mask for Laplacian is given 1 Machine vision Summary # 4 The mask for Laplacian is given L = 0 1 0 1 4 1 (6) 0 1 0 Another Laplacian mask that gives more importance to the center element is L = 1 1 1 1 8 1 (7) 1 1 1 Note that the

More information

Total Variation Image Edge Detection

Total Variation Image Edge Detection Total Variation Image Edge Detection PETER NDAJAH Graduate School of Science and Technology, Niigata University, 8050, Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-28, JAPAN ndajah@telecom0.eng.niigata-u.ac.jp

More information

Butterworth Filter Properties

Butterworth Filter Properties OpenStax-CNX module: m693 Butterworth Filter Properties C. Sidney Burrus This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 3. This section develops the properties

More information

Laplacian Filters. Sobel Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters

Laplacian Filters. Sobel Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters Sobel Filters Note that smoothing the image before applying a Sobel filter typically gives better results. Even thresholding the Sobel filtered image cannot usually create precise, i.e., -pixel wide, edges.

More information

Spurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics

Spurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics

More information

Approximation of the Karhunen}Loève transformation and its application to colour images

Approximation of the Karhunen}Loève transformation and its application to colour images Signal Processing: Image Communication 6 (00) 54}55 Approximation of the Karhunen}Loève transformation and its application to colour images ReH mi Kouassi, Pierre Gouton*, Michel Paindavoine Laboratoire

More information

ON THE COMPLEXITY OF SOLVING THE GENERALIZED SET PACKING PROBLEM APPROXIMATELY. Nimrod Megiddoy

ON THE COMPLEXITY OF SOLVING THE GENERALIZED SET PACKING PROBLEM APPROXIMATELY. Nimrod Megiddoy ON THE COMPLEXITY OF SOLVING THE GENERALIZED SET PACKING PROBLEM APPROXIMATELY Nimrod Megiddoy Abstract. The generalized set packing problem (GSP ) is as follows. Given a family F of subsets of M = f mg

More information

Generalization Of The Secant Method For Nonlinear Equations

Generalization Of The Secant Method For Nonlinear Equations Applied Mathematics E-Notes, 8(2008), 115-123 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Generalization Of The Secant Method For Nonlinear Equations Avram Sidi

More information

Machine vision, spring 2018 Summary 4

Machine vision, spring 2018 Summary 4 Machine vision Summary # 4 The mask for Laplacian is given L = 4 (6) Another Laplacian mask that gives more importance to the center element is given by L = 8 (7) Note that the sum of the elements in the

More information

Realization of set functions as cut functions of graphs and hypergraphs

Realization of set functions as cut functions of graphs and hypergraphs Discrete Mathematics 226 (2001) 199 210 www.elsevier.com/locate/disc Realization of set functions as cut functions of graphs and hypergraphs Satoru Fujishige a;, Sachin B. Patkar b a Division of Systems

More information

arxiv: v1 [math.ca] 28 Feb 2014

arxiv: v1 [math.ca] 28 Feb 2014 Communications in Nonlinear Science and Numerical Simulation. Vol.18. No.11. (213) 2945-2948. arxiv:142.7161v1 [math.ca] 28 Feb 214 No Violation of the Leibniz Rule. No Fractional Derivative. Vasily E.

More information

MATH The Derivative as a Function - Section 3.2. The derivative of f is the function. f x h f x. f x lim

MATH The Derivative as a Function - Section 3.2. The derivative of f is the function. f x h f x. f x lim MATH 90 - The Derivative as a Function - Section 3.2 The derivative of f is the function f x lim h 0 f x h f x h for all x for which the limit exists. The notation f x is read "f prime of x". Note that

More information

The Time-Scaled Trapezoidal Integration Rule for Discrete Fractional Order Controllers

The Time-Scaled Trapezoidal Integration Rule for Discrete Fractional Order Controllers The Time-Scaled Trapezoidal Integration Rule for Discrete Fractional Order Controllers Chengbin Ma and Yoichi Hori Electrical Control System Engineering, Information & System Division, Institute of Industrial

More information

Minimal enumerations of subsets of a nite set and the middle level problem

Minimal enumerations of subsets of a nite set and the middle level problem Discrete Applied Mathematics 114 (2001) 109 114 Minimal enumerations of subsets of a nite set and the middle level problem A.A. Evdokimov, A.L. Perezhogin 1 Sobolev Institute of Mathematics, Novosibirsk

More information

System Identification of Thermal Transfers Inside the Lungs Using Fractional Models

System Identification of Thermal Transfers Inside the Lungs Using Fractional Models System of Thermal Transfers Inside the Lungs Using Fractional Models Pierre Melchior*, Mathieu Pellet*, Youssef Abdelmoumen** Alain Oustaloup* *IMS UMR 528 CNRS Université de Bordeaux, IPB/ENSEIRB-MATMECA,

More information

On Mean Curvature Diusion in Nonlinear Image Filtering. Adel I. El-Fallah and Gary E. Ford. University of California, Davis. Davis, CA

On Mean Curvature Diusion in Nonlinear Image Filtering. Adel I. El-Fallah and Gary E. Ford. University of California, Davis. Davis, CA On Mean Curvature Diusion in Nonlinear Image Filtering Adel I. El-Fallah and Gary E. Ford CIPIC, Center for Image Processing and Integrated Computing University of California, Davis Davis, CA 95616 Abstract

More information

New Lyapunov Krasovskii functionals for stability of linear retarded and neutral type systems

New Lyapunov Krasovskii functionals for stability of linear retarded and neutral type systems Systems & Control Letters 43 (21 39 319 www.elsevier.com/locate/sysconle New Lyapunov Krasovskii functionals for stability of linear retarded and neutral type systems E. Fridman Department of Electrical

More information

The Fourier transform and finite differences: an exposition and proof. of a result of Gary H. Meisters and Wolfgang M. Schmidt

The Fourier transform and finite differences: an exposition and proof. of a result of Gary H. Meisters and Wolfgang M. Schmidt he Fourier transform and finite differences: an exposition and proof of a result of Gary H. Meisters and Wolfgang M. Schmidt Rodney Nillsen, University of Wollongong, New South Wales 1. Introduction. In

More information

A NEW METHOD FOR CHARACTERIZING LACE BASED ON A FRACTAL INDEX

A NEW METHOD FOR CHARACTERIZING LACE BASED ON A FRACTAL INDEX A NEW METHOD FOR CHARACTERIZING LACE BASED ON A FRACTAL INDEX A. Bigand Université du Littoral, BP 649 62228 CALAIS Cedex Tél. : 03 21 46 36 91 Fax : 03 21 46 06 86 e-mail : Andre.Bigand@lasl-gw.univ-littoral.fr

More information

Maximally Flat Lowpass Digital Differentiators

Maximally Flat Lowpass Digital Differentiators Maximally Flat Lowpass Digital Differentiators Ivan W. Selesnick August 3, 00 Electrical Engineering, Polytechnic University 6 Metrotech Center, Brooklyn, NY 0 selesi@taco.poly.edu tel: 78 60-36 fax: 78

More information

Null controllable region of LTI discrete-time systems with input saturation

Null controllable region of LTI discrete-time systems with input saturation Automatica 38 (2002) 2009 2013 www.elsevier.com/locate/automatica Technical Communique Null controllable region of LTI discrete-time systems with input saturation Tingshu Hu a;, Daniel E. Miller b,liqiu

More information

On the Concept of Local Fractional Differentiation

On the Concept of Local Fractional Differentiation On the Concept of Local Fractional Differentiation Xiaorang Li, Matt Davison, and Chris Essex Department of Applied Mathematics, The University of Western Ontario, London, Canada, N6A 5B7 {xli5,essex,mdavison}@uwo.ca

More information

arxiv: v2 [math.ca] 8 Nov 2014

arxiv: v2 [math.ca] 8 Nov 2014 JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0894-0347(XX)0000-0 A NEW FRACTIONAL DERIVATIVE WITH CLASSICAL PROPERTIES arxiv:1410.6535v2 [math.ca] 8 Nov 2014 UDITA

More information

Anumerical and analytical study of the free convection thermal boundary layer or wall jet at

Anumerical and analytical study of the free convection thermal boundary layer or wall jet at REVERSED FLOW CALCULATIONS OF HIGH PRANDTL NUMBER THERMAL BOUNDARY LAYER SEPARATION 1 J. T. Ratnanather and P. G. Daniels Department of Mathematics City University London, England, EC1V HB ABSTRACT Anumerical

More information

Math 1270 Honors ODE I Fall, 2008 Class notes # 14. x 0 = F (x; y) y 0 = G (x; y) u 0 = au + bv = cu + dv

Math 1270 Honors ODE I Fall, 2008 Class notes # 14. x 0 = F (x; y) y 0 = G (x; y) u 0 = au + bv = cu + dv Math 1270 Honors ODE I Fall, 2008 Class notes # 1 We have learned how to study nonlinear systems x 0 = F (x; y) y 0 = G (x; y) (1) by linearizing around equilibrium points. If (x 0 ; y 0 ) is an equilibrium

More information

Research Article Denoising Algorithm Based on Generalized Fractional Integral Operator with Two Parameters

Research Article Denoising Algorithm Based on Generalized Fractional Integral Operator with Two Parameters Hindawi Publishing Corporation Discrete Dynamics in Nature and Society Volume 212, Article ID 529849, 14 pages doi:11155/212/529849 Research Article Denoising Algorithm Based on Generalized Fractional

More information

PolyGamma Functions of Negative Order

PolyGamma Functions of Negative Order Carnegie Mellon University Research Showcase @ CMU Computer Science Department School of Computer Science -998 PolyGamma Functions of Negative Order Victor S. Adamchik Carnegie Mellon University Follow

More information

Image Compression using DPCM with LMS Algorithm

Image Compression using DPCM with LMS Algorithm Image Compression using DPCM with LMS Algorithm Reenu Sharma, Abhay Khedkar SRCEM, Banmore -----------------------------------------------------------------****---------------------------------------------------------------

More information

Kjersti Aas Line Eikvil Otto Milvang. Norwegian Computing Center, P.O. Box 114 Blindern, N-0314 Oslo, Norway. sharp reexes was a challenge. machine.

Kjersti Aas Line Eikvil Otto Milvang. Norwegian Computing Center, P.O. Box 114 Blindern, N-0314 Oslo, Norway. sharp reexes was a challenge. machine. Automatic Can Separation Kjersti Aas Line Eikvil Otto Milvang Norwegian Computing Center, P.O. Box 114 Blindern, N-0314 Oslo, Norway e-mail: Kjersti.Aas@nr.no Tel: (+47) 22 85 25 00 Fax: (+47) 22 69 76

More information

1 More concise proof of part (a) of the monotone convergence theorem.

1 More concise proof of part (a) of the monotone convergence theorem. Math 0450 Honors intro to analysis Spring, 009 More concise proof of part (a) of the monotone convergence theorem. Theorem If (x n ) is a monotone and bounded sequence, then lim (x n ) exists. Proof. (a)

More information

October 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable

October 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable International Journal of Wavelets, Multiresolution and Information Processing c World Scientic Publishing Company Polynomial functions are renable Henning Thielemann Institut für Informatik Martin-Luther-Universität

More information

Validating an A Priori Enclosure Using. High-Order Taylor Series. George F. Corliss and Robert Rihm. Abstract

Validating an A Priori Enclosure Using. High-Order Taylor Series. George F. Corliss and Robert Rihm. Abstract Validating an A Priori Enclosure Using High-Order Taylor Series George F. Corliss and Robert Rihm Abstract We use Taylor series plus an enclosure of the remainder term to validate the existence of a unique

More information

Pade approximants and noise: rational functions

Pade approximants and noise: rational functions Journal of Computational and Applied Mathematics 105 (1999) 285 297 Pade approximants and noise: rational functions Jacek Gilewicz a; a; b;1, Maciej Pindor a Centre de Physique Theorique, Unite Propre

More information

The Time-Scaled Trapezoidal Integration Rule for Discrete Fractional Order Controllers

The Time-Scaled Trapezoidal Integration Rule for Discrete Fractional Order Controllers Nonlinear Dynamics 38: 171 18, 24. C 24 Kluwer Academic Publishers. Printed in the Netherlands. The Time-Scaled Trapezoidal Integration Rule for Discrete Fractional Order Controllers CHENGBIN MA and YOICHI

More information

Elena Gogovcheva, Lyubomir Boyadjiev 1 Dedicated to Professor H.M. Srivastava, on the occasion of his 65th Birth Anniversary Abstract

Elena Gogovcheva, Lyubomir Boyadjiev 1 Dedicated to Professor H.M. Srivastava, on the occasion of his 65th Birth Anniversary Abstract FRACTIONAL EXTENSIONS OF JACOBI POLYNOMIALS AND GAUSS HYPERGEOMETRIC FUNCTION Elena Gogovcheva, Lyubomir Boyadjiev 1 Dedicated to Professor H.M. Srivastava, on the occasion of his 65th Birth Anniversary

More information

Learning with Ensembles: How. over-tting can be useful. Anders Krogh Copenhagen, Denmark. Abstract

Learning with Ensembles: How. over-tting can be useful. Anders Krogh Copenhagen, Denmark. Abstract Published in: Advances in Neural Information Processing Systems 8, D S Touretzky, M C Mozer, and M E Hasselmo (eds.), MIT Press, Cambridge, MA, pages 190-196, 1996. Learning with Ensembles: How over-tting

More information

A Stable Finite Dierence Ansatz for Higher Order Dierentiation of Non-Exact. Data. Bob Anderssen and Frank de Hoog,

A Stable Finite Dierence Ansatz for Higher Order Dierentiation of Non-Exact. Data. Bob Anderssen and Frank de Hoog, A Stable Finite Dierence Ansatz for Higher Order Dierentiation of Non-Exact Data Bob Anderssen and Frank de Hoog, CSIRO Division of Mathematics and Statistics, GPO Box 1965, Canberra, ACT 2601, Australia

More information

Ridge analysis of mixture response surfaces

Ridge analysis of mixture response surfaces Statistics & Probability Letters 48 (2000) 3 40 Ridge analysis of mixture response surfaces Norman R. Draper a;, Friedrich Pukelsheim b a Department of Statistics, University of Wisconsin, 20 West Dayton

More information

Sequences and series

Sequences and series Sequences and series Jean-Marie Dufour McGill University First version: March 1992 Revised: January 2002, October 2016 This version: October 2016 Compiled: January 10, 2017, 15:36 This work was supported

More information

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................

More information

Rotation, scale and translation invariant digital image watermarking. O'RUANAIDH, Joséph John, PUN, Thierry. Abstract

Rotation, scale and translation invariant digital image watermarking. O'RUANAIDH, Joséph John, PUN, Thierry. Abstract Proceedings Chapter Rotation, scale and translation invariant digital image watermarking O'RUANAIDH, Joséph John, PUN, Thierry Abstract A digital watermark is an invisible mark embedded in a digital image

More information

Applied Mathematics Letters. A reproducing kernel method for solving nonlocal fractional boundary value problems

Applied Mathematics Letters. A reproducing kernel method for solving nonlocal fractional boundary value problems Applied Mathematics Letters 25 (2012) 818 823 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml A reproducing kernel method for

More information

Edge Detection. Introduction to Computer Vision. Useful Mathematics Funcs. The bad news

Edge Detection. Introduction to Computer Vision. Useful Mathematics Funcs. The bad news Edge Detection Introduction to Computer Vision CS / ECE 8B Thursday, April, 004 Edge detection (HO #5) Edge detection is a local area operator that seeks to find significant, meaningful changes in image

More information

Boxlets: a Fast Convolution Algorithm for. Signal Processing and Neural Networks. Patrice Y. Simard, Leon Bottou, Patrick Haner and Yann LeCun

Boxlets: a Fast Convolution Algorithm for. Signal Processing and Neural Networks. Patrice Y. Simard, Leon Bottou, Patrick Haner and Yann LeCun Boxlets: a Fast Convolution Algorithm for Signal Processing and Neural Networks Patrice Y. Simard, Leon Bottou, Patrick Haner and Yann LeCun AT&T Labs-Research 100 Schultz Drive, Red Bank, NJ 07701-7033

More information

Object Recognition Using Local Characterisation and Zernike Moments

Object Recognition Using Local Characterisation and Zernike Moments Object Recognition Using Local Characterisation and Zernike Moments A. Choksuriwong, H. Laurent, C. Rosenberger, and C. Maaoui Laboratoire Vision et Robotique - UPRES EA 2078, ENSI de Bourges - Université

More information

AN OBJECTIVE AND SUBJECTIVE EVALUATION OF EDGE DETECTION METHODS IN IMAGES

AN OBJECTIVE AND SUBJECTIVE EVALUATION OF EDGE DETECTION METHODS IN IMAGES Philips J. Res. 46, 57-94, 1991 R 1249 AN OBJECTIVE AND SUBJECTIVE EVALUATION OF EDGE DETECTION METHODS IN IMAGES by J. A. C. BERNSEN Philips Research Laboratories, PO Box 80000, 5600JA Eindhoven, The

More information

Comparing the homotopy types of the components of Map(S 4 ;BSU(2))

Comparing the homotopy types of the components of Map(S 4 ;BSU(2)) Journal of Pure and Applied Algebra 161 (2001) 235 243 www.elsevier.com/locate/jpaa Comparing the homotopy types of the components of Map(S 4 ;BSU(2)) Shuichi Tsukuda 1 Department of Mathematical Sciences,

More information

below, kernel PCA Eigenvectors, and linear combinations thereof. For the cases where the pre-image does exist, we can provide a means of constructing

below, kernel PCA Eigenvectors, and linear combinations thereof. For the cases where the pre-image does exist, we can provide a means of constructing Kernel PCA Pattern Reconstruction via Approximate Pre-Images Bernhard Scholkopf, Sebastian Mika, Alex Smola, Gunnar Ratsch, & Klaus-Robert Muller GMD FIRST, Rudower Chaussee 5, 12489 Berlin, Germany fbs,

More information

The local fractional Hilbert transform in fractal space

The local fractional Hilbert transform in fractal space The local fractional ilbert transform in fractal space Guang-Sheng Chen Department of Computer Engineering, Guangxi Modern Vocational Technology College, echi,guangxi, 547000, P.. China E-mail address:

More information

Weak solutions for some quasilinear elliptic equations by the sub-supersolution method

Weak solutions for some quasilinear elliptic equations by the sub-supersolution method Nonlinear Analysis 4 (000) 995 100 www.elsevier.nl/locate/na Weak solutions for some quasilinear elliptic equations by the sub-supersolution method Manuel Delgado, Antonio Suarez Departamento de Ecuaciones

More information

ON THE C-LAGUERRE FUNCTIONS

ON THE C-LAGUERRE FUNCTIONS ON THE C-LAGUERRE FUNCTIONS M. Ishteva, L. Boyadjiev 2 (Submitted by... on... ) MATHEMATIQUES Fonctions Specialles This announcement refers to a fractional extension of the classical Laguerre polynomials.

More information

A Fast Algorithm for. Nonstationary Delay Estimation. H. C. So. Department of Electronic Engineering, City University of Hong Kong

A Fast Algorithm for. Nonstationary Delay Estimation. H. C. So. Department of Electronic Engineering, City University of Hong Kong A Fast Algorithm for Nonstationary Delay Estimation H. C. So Department of Electronic Engineering, City University of Hong Kong Tat Chee Avenue, Kowloon, Hong Kong Email : hcso@ee.cityu.edu.hk June 19,

More information

Spatial autoregression model:strong consistency

Spatial autoregression model:strong consistency Statistics & Probability Letters 65 (2003 71 77 Spatial autoregression model:strong consistency B.B. Bhattacharyya a, J.-J. Ren b, G.D. Richardson b;, J. Zhang b a Department of Statistics, North Carolina

More information

Long and Short Memory in Economics: Fractional-Order Difference and Differentiation

Long and Short Memory in Economics: Fractional-Order Difference and Differentiation IRA-International Journal of Management and Social Sciences. 2016. Vol. 5. No. 2. P. 327-334. DOI: 10.21013/jmss.v5.n2.p10 Long and Short Memory in Economics: Fractional-Order Difference and Differentiation

More information

A f = A f (x)dx, 55 M F ds = M F,T ds, 204 M F N dv n 1, 199 !, 197. M M F,N ds = M F ds, 199 (Δ,')! = '(Δ)!, 187

A f = A f (x)dx, 55 M F ds = M F,T ds, 204 M F N dv n 1, 199 !, 197. M M F,N ds = M F ds, 199 (Δ,')! = '(Δ)!, 187 References 1. T.M. Apostol; Mathematical Analysis, 2nd edition, Addison-Wesley Publishing Co., Reading, Mass. London Don Mills, Ont., 1974. 2. T.M. Apostol; Calculus Vol. 2: Multi-variable Calculus and

More information

p(z)

p(z) Chapter Statistics. Introduction This lecture is a quick review of basic statistical concepts; probabilities, mean, variance, covariance, correlation, linear regression, probability density functions and

More information

Fractional Quantum Mechanics and Lévy Path Integrals

Fractional Quantum Mechanics and Lévy Path Integrals arxiv:hep-ph/9910419v2 22 Oct 1999 Fractional Quantum Mechanics and Lévy Path Integrals Nikolai Laskin Isotrace Laboratory, University of Toronto 60 St. George Street, Toronto, ON M5S 1A7 Canada Abstract

More information

Linear Regression and Its Applications

Linear Regression and Its Applications Linear Regression and Its Applications Predrag Radivojac October 13, 2014 Given a data set D = {(x i, y i )} n the objective is to learn the relationship between features and the target. We usually start

More information

Entropy for intuitionistic fuzzy sets

Entropy for intuitionistic fuzzy sets Fuzzy Sets and Systems 118 (2001) 467 477 www.elsevier.com/locate/fss Entropy for intuitionistic fuzzy sets Eulalia Szmidt, Janusz Kacprzyk Systems Research Institute, Polish Academy of Sciences ul. Newelska

More information

Automatica, 33(9): , September 1997.

Automatica, 33(9): , September 1997. A Parallel Algorithm for Principal nth Roots of Matrices C. K. Koc and M. _ Inceoglu Abstract An iterative algorithm for computing the principal nth root of a positive denite matrix is presented. The algorithm

More information

ing a minimal set of layers, each describing a coherent motion from the scene, which yield a complete description of motion when superposed. Jepson an

ing a minimal set of layers, each describing a coherent motion from the scene, which yield a complete description of motion when superposed. Jepson an The Structure of Occlusion in Fourier Space S. S. Beauchemin Dept. of Computer Science The University of Western Ontario London, Canada N6A 5B7 e-mail: beau@csd.uwo.ca J. L. Barron Dept. of Computer Science

More information

Lecture 04 Image Filtering

Lecture 04 Image Filtering Institute of Informatics Institute of Neuroinformatics Lecture 04 Image Filtering Davide Scaramuzza 1 Lab Exercise 2 - Today afternoon Room ETH HG E 1.1 from 13:15 to 15:00 Work description: your first

More information

Discrimination power of measures of comparison

Discrimination power of measures of comparison Fuzzy Sets and Systems 110 (000) 189 196 www.elsevier.com/locate/fss Discrimination power of measures of comparison M. Rifqi a;, V. Berger b, B. Bouchon-Meunier a a LIP6 Universite Pierre et Marie Curie,

More information

Counterexamples to witness conjectures. Notations Let E be the set of admissible constant expressions built up from Z; + ;?;;/; exp and log. Here a co

Counterexamples to witness conjectures. Notations Let E be the set of admissible constant expressions built up from Z; + ;?;;/; exp and log. Here a co Counterexamples to witness conjectures Joris van der Hoeven D pt. de Math matiques (b t. 45) Universit Paris-Sud 91405 Orsay CEDEX France August 15, 003 Consider the class of exp-log constants, which is

More information

SYSTEM RECONSTRUCTION FROM SELECTED HOS REGIONS. Haralambos Pozidis and Athina P. Petropulu. Drexel University, Philadelphia, PA 19104

SYSTEM RECONSTRUCTION FROM SELECTED HOS REGIONS. Haralambos Pozidis and Athina P. Petropulu. Drexel University, Philadelphia, PA 19104 SYSTEM RECOSTRUCTIO FROM SELECTED HOS REGIOS Haralambos Pozidis and Athina P. Petropulu Electrical and Computer Engineering Department Drexel University, Philadelphia, PA 94 Tel. (25) 895-2358 Fax. (25)

More information

ε ε

ε ε The 8th International Conference on Computer Vision, July, Vancouver, Canada, Vol., pp. 86{9. Motion Segmentation by Subspace Separation and Model Selection Kenichi Kanatani Department of Information Technology,

More information

Numerical Integration exact integration is not needed to achieve the optimal convergence rate of nite element solutions ([, 9, 11], and Chapter 7). In

Numerical Integration exact integration is not needed to achieve the optimal convergence rate of nite element solutions ([, 9, 11], and Chapter 7). In Chapter 6 Numerical Integration 6.1 Introduction After transformation to a canonical element,typical integrals in the element stiness or mass matrices (cf. (5.5.8)) have the forms Q = T ( )N s Nt det(j

More information

SECTION FOR DIGITAL SIGNAL PROCESSING DEPARTMENT OF MATHEMATICAL MODELLING TECHNICAL UNIVERSITY OF DENMARK Course 04362 Digital Signal Processing: Solutions to Problems in Proakis and Manolakis, Digital

More information

Stabilization of fractional positive continuous-time linear systems with delays in sectors of left half complex plane by state-feedbacks

Stabilization of fractional positive continuous-time linear systems with delays in sectors of left half complex plane by state-feedbacks Control and Cybernetics vol. 39 (2010) No. 3 Stabilization of fractional positive continuous-time linear systems with delays in sectors of left half complex plane by state-feedbacks by Tadeusz Kaczorek

More information

DIFFERENTIATION RULES

DIFFERENTIATION RULES 3 DIFFERENTIATION RULES DIFFERENTIATION RULES We have: Seen how to interpret derivatives as slopes and rates of change Seen how to estimate derivatives of functions given by tables of values Learned how

More information

New concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space

New concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space Lesson 6: Linear independence, matrix column space and null space New concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space Two linear systems:

More information

Fuzzy Limits of Functions

Fuzzy Limits of Functions Fuzzy Limits of Functions Mark Burgin Department of Mathematics University of California, Los Angeles 405 Hilgard Ave. Los Angeles, CA 90095 Abstract The goal of this work is to introduce and study fuzzy

More information

LECTURE 15 + C+F. = A 11 x 1x1 +2A 12 x 1x2 + A 22 x 2x2 + B 1 x 1 + B 2 x 2. xi y 2 = ~y 2 (x 1 ;x 2 ) x 2 = ~x 2 (y 1 ;y 2 1

LECTURE 15 + C+F. = A 11 x 1x1 +2A 12 x 1x2 + A 22 x 2x2 + B 1 x 1 + B 2 x 2. xi y 2 = ~y 2 (x 1 ;x 2 ) x 2 = ~x 2 (y 1 ;y 2  1 LECTURE 5 Characteristics and the Classication of Second Order Linear PDEs Let us now consider the case of a general second order linear PDE in two variables; (5.) where (5.) 0 P i;j A ij xix j + P i,

More information

Yet Another Riemann Hypothesis

Yet Another Riemann Hypothesis Yet Another Riemann Hypothesis Linas Vepstas 2 October 2004; revised 3 December 200 Abstract This short note presents a peculiar generalization of the Riemann hypothesis, as the

More information

Polyexponentials. Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH

Polyexponentials. Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH Polyexponentials Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH 45810 k-boyadzhiev@onu.edu 1. Introduction. The polylogarithmic function [15] (1.1) and the more general

More information

Construction ofnew extremal self-dual codes

Construction ofnew extremal self-dual codes Discrete Mathematics 263 (2003) 81 91 www.elsevier.com/locate/disc Construction ofnew extremal self-dual codes T. Aaron Gulliver a;, Masaaki Harada b, Jon-Lark Kim c a Department of Electrical and Computer

More information

Lifting to non-integral idempotents

Lifting to non-integral idempotents Journal of Pure and Applied Algebra 162 (2001) 359 366 www.elsevier.com/locate/jpaa Lifting to non-integral idempotents Georey R. Robinson School of Mathematics and Statistics, University of Birmingham,

More information

Gravitational potential energy *

Gravitational potential energy * OpenStax-CNX module: m15090 1 Gravitational potential energy * Sunil Kumar Singh This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 The concept of potential

More information

The geometric and physical interpretation of fractional order derivatives of polynomial functions

The geometric and physical interpretation of fractional order derivatives of polynomial functions The geometric and physical interpretation of fractional order derivatives of polynomial functions M.H. Tavassoli, A. Tavassoli, M.R. Ostad Rahimi Abstract. In this paper, after a brief mention of the definitions

More information