Regularity Analysis of Non Uniform Data
|
|
- Harry Gibbs
- 5 years ago
- Views:
Transcription
1 Regularity Analysis of Non Uniform Data Christine Potier and Christine Vercken Abstract. A particular class of wavelet, derivatives of B-splines, leads to fast and ecient algorithms for contours detection of 1D and 2D signals by a discrete dyadic nite multiscale wavelet analysis (Mallat and Zhong). To detect higher order singularities, the multiscale analysis algorithm, with higher order spline wavelets, is very simply expressed in terms of B-splines subdivision and derivation formulas. This formulation allows us to generalize the algorithm for non uniformly sampled data. This algorithm is used to locate the singularities of a function. x1. Introduction The detection of singularities with multiscale transforms has been widely studied not only in mathematics but also in signal processing, computer vision,... For contours detection, the signal can be smoothed, at dierent scales and the edges are found as local extrema of the gradient modulus of the smoothed signal (Canny) or as zero-crossings of the Laplacian of the smoothed signal (Marr and Hilbreth). Mallat and al. [3] showed the equivalence between the Canny edge detector and the local maxima of a wavelet transform modulus detection. The signal regularity, at each point x, is measured by the decay, across scales, of its wavelet coecients centered at x. For this analysis, wavelet transforms with dyadic sampling, particularly orthonormal bases, may introduce distortion since they are not translation invariant. A particular class of wavelet, derivatives of B-splines, leads to fast and ecient algorithms for edges detection of 1D and 2D signals by a discrete dyadic nite scale analysis (Mallat and Zhong). For this class, the scaling function is a quadratic spline if the wavelet is the 1 st derivative of a cubic spline. More generally, a wavelet which is the p th derivative of a smoothing function is well tted to Curves and Surfaces II 1 P. J. Laurent, A. Le Mehaute, and L. L. Schumaker (eds.), pp. 1{4. Copyright oc 1991 by AKPeters, Boston. ISBN All rights of reproduction in any form reserved.
2 2 C. Potier and C. Vercken characterize singularities of (p? 1) th derivative through multiscale analysis using B-spline functions. The two scales dierence equation is a subdivision equation and the wavelet coecients are obtained, at each scale, from the derivation formulas. This formulation allows us to generalize the algorithm to non uniformly sampled data to locate singularities. x2. Dyadic Multiscale Wavelet Transform and Singularities analysis Let be a function 2 L 1 \ L 2 such as the R function x is integrable. The function can be considered as a wavelet if = 0. The dilation of at the scale s is dened by: s(x) = 1 s (x s ) (1) Let f be a function 2 L 1 \ L 2. The wavelet transform W s f(x) of f at a scale s and a position x is dened by the convolution product : W s f(x) = f s (x) (2) The dyadic wavelet transform is the sequence fw 2 j f(x) = f 2 j (x)g j2zz. Mallat[1] showed that the analysis is complete and redundant and f(x) can be recovered from its dyadic wavelet transform if there exist positive constants A and B such as 8! 2 C j A +1?1 j ^(2 j!)j 2 B (3) We now introduce a particular set S(; p) of wavelets for singularities analysis. S(; p) = f j 9 2 C 2p, compactly supported, R dx = 1, = (p) g The function is called the smoothing function. From the denition of S(; p), 2 C p (IR) and is a wavelet with p vanishing moments : Z +1?1 x i (x)dx = 0 0 i < p (4) The wavelet transform of f(x) at a scale s and a position x, veries : Ws p f(x) = f s(x) = f (s p dp (x) dp )(x) = dx p sp dx p (f s)(x) (5) and Ws pf(x) is proportional to the pth derivative of f smoothed by s (x). If f (p?1) has an isolated singularity at x 0, Ws pf has a local maximum at x 0. If 1 is the rst derivative of, 1 is well tted to localize a discontinuity of f (a sharp edge). The local extrema of Ws 1 f(x) correspond to the zero-crossings of Ws 2f(x) and to the inection points of f s(x). More precisely [3], the decay of wavelet moduli across scales depends on the Lipschitz regularity of f. If f 2 L 2 is uniformly Lipschitz < p over ]a; b[, there exists a positive constant K such that, for x 2]a; b[, s > 0 and 2 S(; p): jws p f(x)j Ks (6) To analyze singularities of f (p?1) we use a wavelet 2 S(; p) and study jws pf(x)j=s.
3 Regularity Analysis 3 x3. Discrete Dyadic Wavelet Transform In numerical applications, the input signal fx i ; y i g 0iN?1 is measured at a nite resolution that we call scale s = 1. The input signal S 1 f is a smoothed approximation of f at scale s = 1 and we can write: S 1 f(x) = f (x) (7) R where (x) is a smoothing function verifying (x) = 1 that we call the scaling function. The dilation of the scaling function is dened by equation (1). We suppose that ( x) and ( x ) can be expressed as linear combinations 2 2 of translated (x): ( x n=b 2 ) = n=a n (x? n) and ( x n=d 2 ) = n (x? n) (8) The scaling function can be used at scale 2 j to obtain a smoothed signal S 2 j f(x) = f 2 j (x). The smoothed signal represents the trend of the signal at the scale 2 j whereas W 2 j f(x) = f 2 j (x) represents the details of the signal at the scale 2 j. S 2 j f(x) may be viewed as a low-pass lter and W 2 j f(x) as a high-pass lter. The n discrete dyadicowavelet transform at scale 2 J is the sequence of details W 2 j f = f 2 j (x) and the tendency S 2 f. 1j<J J If fs 2 j f(n) = d j n g n2z are the coecients of the wavelet transform at the scale 2 j, S 2 j+1f(n) and W 2 j+1f(n) can be computed by using relations (8): S 2 j+1f(m) = n=b n=a n d j m?2 j n and W 2 j+1f(m) = n=c n=d n=c n d j m?2 j n (9) x4. Discrete Dyadic Spline Wavelet Transform It is well known that the polynomial splines spaces are well tted to multiscale wavelet transform [2] [5]. A spline function of order a is a piecewise polynomial function of degree a? 1 which is C a?2 for a 2. Its p th derivative may be used to detect singularities of f (p?1) if 2p = a? 2. If the wavelet (x) is the p th derivative of a spline of order 2p + 2, to satisfy (8) must be of the same order k = p + 2 than the scaling function. For example, let be a spline of order 6, and = ". Then is a cubic spline which is C 2 and is well tted to detect discontinuities of degree 1. The splines of order k with minimal support are called B-spline. The cardinal B-spline of order k is B k (x) = B k?1 (x) B 1 (x) where B 1 (x) is the B-spline of order 1 dened on [?1=2; 1=2]. It is dened on knot sequence [?k ; (?k+2) ; : : : ; k ]. Usually the cardinal B-spline B k(x) is dened on knot sequence [0; 1; : : : ; k]. To obtain functions centered on 0, we use translated cardinal B-splines.
4 4 C. Potier and C. Vercken The coecients f n g and f n g can be obtained by using the dilation properties of polynomial B-splines and derivation formulas. If B k denotes the k th order cardinal B-spline dened on knot sequence [?k ; (?k+2) ; : : : ; k ], B k ( x ) is the B-spline of order k dened on knot sequence [?k;?k + 2; : : : ; k]. 2 Then we can write: B k ( x n=k=2 2 ) = n=?k=2 a j B k (x? n) = n=k=2 n=?k=2 1 k B 2 k?1 k (x? n) (10) n + k=2 Similarly, the p th derivative of a (k + p) th order B-spline can be expressed: n=p=2 B (p) k+p (x) = n=?p=2 d j B k (x? n) = n=p n=0 (?1) n p n B k (x? n? p 2 ) (11) In case of regular knot sequence ft i = ig, the coecients fa n g and fd n g depend only on the order k of the spline since p = k? 2. The cardinal B-splines B k (x? i) currently denoted B i;k verify two normalizing relations P i=+1 i=?1 B i;k (x) = 1 and R B i;k (x)dx = 1. Hence, = B k (x) can be taken as scaling function. x5. Irregular Sampling In case of irregular knot sequence ft i g, the B-spline B i;k (x) dened on knots [t i?k=2 ; : : : ; t i+k=2 ] veries no more the relation R B i;k (x)dx = 1. Since we need as scaling function and smoothing function, functions verifying R f(x) = 1, we have to use normalized spline functions with compact support. The spline functions with minimal support verifying this normalizing equation are called the M-splines and denoted M i;k. The relation between B i;k and M i;k is: M i;k (x) = k (t i+k=2? t i?k=2 ) B i;k(x) (12) The relation corresponding to the relation (8) that expresses the scaling function 2s in terms of s, may be obtained by applying the subdivision formulae on B i;k dened on knot sequence [: : : ; t i?2 ; t i ; t i+2 ; : : :] if k is even and on knot sequence [: : : ; t i?1 ; t i+1 ; : : :] if k is odd. The subdivision is made by introducing one knot in each interval [1]. We obtain the coecients fa i;n g and then the coecients fh i;n g are obtained by using the relation (12): B i;k ( x n=k=2 2 ) = n=?k=2 a i;n B i+n;k (x) ; M i;k ( x n=k=2 2 ) = n=?k=2 h i;n M i+n;k (x) (13)
5 Regularity Analysis 5 Obviously, the coecients h i;n verify the fundamental relation: j=k=2 P j=?k=2 h i;j = 1 R R because M i;k (x)dx = 1 and M i;k ( x )dx = 1 for all i and k. 2 The subdivision is made at each scale s = 2 j and we obtain coecients that depend on the position i and on scale s = 2 j. For example, if k = 4 the relation between coecients a s i;n and hs i;n at scale s is: and the coecients h s i;n are: h s i;n = a s (t i+(2+n)s? t i?(2?n)s ) i;n (t i+4s? t i?4s ) (14) h s i;?2 = (t i?s? t i?4s )(t i?3s? t i?4s ) (t i+2s? t i?4s )(t i+4s? t i?4s ) h s i;?1 = (t i?s? t i?4s )(t i+s? t i?3s ) (t i+2s? t i?4s )(t i+4s? t i?4s ) h s i;0 = 1 - h s i;?2 - hs i;?1 - hs i;1 - hs i;2 h s i;1 = (t i+4s? t i+s )(t i+3s? t i?s ) (t i+4s? t i?2s )(t i+4s? t i?4s ) h s i;2 = (t i+4s? t i+s )(t i+4s? t i+3s ) (t i+4s? t i?2s )(t i+4s? t i?4s ) Coecients gi;n s at scale s are given by derivation formulae: g s = 30s 2 i;?1 (t i+3s? t i?3s )(t i+2s? t i?3s ) g s 30s 2 i;1 = (t i+3s? t i?3s )(t i+3s? t i?2s ) g s i;0 =?(g s i;?1 + gs i;1 ) Figure 1: (a) M 4 ( x) and h 2 im i;4 (x) dened on knots [1; 2:4; 3; 3:4; 4; 5; 7; 8; 9:5], (b) M 6 "(x) and g i M i;4 (x) dened on same knots.
6 6 C. Potier and C. Vercken Fig. 1(a) represents the cubic M-spline M 4 ( x ) dened on knot sequence 2 [1; 3; 4; 7; 9:5]. To obtain relation (13) we have introduced knots [2:4; 3:4; 5; 8]. We have drawn fh i M i (x)g i=1;4 where functions M i (x) are dened on ve successive knots. Fig. 1(b) represents the function M 6 " (x) where M 6 is dened on knots sequence [1; 2:4; 3; 3:4; 4; 5; 7] and the functions fg i M i (x)g i=1;3 Practically, if the subdivision schemes are applied from the coarse to the ne grid the discrete sequences converge - to a B-spline for an initial sequence yi 0 = i0 - to for an initial sequence yi 0 = d i At each step, we compute values y p+1 j by: y p+1 2i = n a 2(i?n);2n y p i?n y p+1 2i+1 = n a 2(i?n);n y p i?n coecients a i;j verifying n a 2(i?n);2n = 1 n a 2(i?n);n = 1 (15) Figure 2: Subdivision converging to x6. Discontinuity Detection In practice, the original discrete data have a nite number N of values. To solve the border problems, the signal is periodized by symmetry at each extremity as in a cosine transform. This periodization often introduce articial discontinuity at the borders and the periodization should depend on the shape of the signal at the border. We have compared the wavelet transform analysis on uniform sampling and on irregular sampling. Fig. 3(a) represents the discrete wavelet transform of the function f(x) = sin(2x) + jsin(8=3x)j for x 2 [0:2; 1:7] uniformly sampled on N = 256 points ft i g. To analyze the singularities of 1 st derivative of these data, we use the wavelet = M " 6 and the scaling function = M 4.
7 Regularity Analysis 7 s=1 s=1 s=2 s=2 s=4 s=4 (a) (b) Figure 3: (a) jw s f(x)j=s on regular sampling at scale s = 1; 2 and 4 and (b) on irregular sampling at same scale. Fig. 3(a) shows the wavelet transform computed at scale s = 1; 2 and 4. At each scale the local maxima have the same locations. On Fig. 3(b), the function is sampled on points t i verifying t i+1? t i = (1 + i ) h where i is a uniform random variable 2 [?0:2; 0:2]. At each scale, we compute: y 2s m = n=2 n=?2 h s i;n ys m?2 j n and v 2s m = n=1 n=?1 g s i;n ys m?2 j n The values fv 2s m g m=1;n are the wavelet coecients at scale s. Fig. 3(b) represents the wavelet transform computed at scale s = 1; 2 and 4. At scale 1, we can see a very oscillating function between two successive peaks corresponding to the maxima of Fig. 3(a). At scale 2, the function W s f is more smooth and at scale 4, the wavelet transform on irregular sampling looks like the wavelet transform obtained on regular sampling. Irregular sampling behaves as if it were noise. The number of maxima ndue to noise and their modulus decrease when scale increases. To distinguish a local maximum due to a singularity from a local maximum due to the noise, we compute the wavelet coecients at a few scales. The useful maxima remain stable in location and modulus. The values of the maxima are shown to be constant at each scale if the wavelet transform is computed exactly and not by discretization. To correct the error due to the discretization process [3][4], we have to normalize the
8 8 C. Potier and C. Vercken wavelet coecients at each scale s = 2 j by a factor that corresponds to the maximum modulus of the discrete wavelet transform of f(x) = x p?1 + if the analyzing wavelet is the p th derivative of a B-spline. Tab.1 gives the normalizing coecients for various wavelet analysis computed on regular sampling. On irregular sampling, the coecients which depend on the knot values, could be computed at each point. scale s=1 s=2 s=4 s=8 s=16 = B 0 4 = B = B " 6 = B Tab. 1: Normalizing coecients x7. Concluding remarks This multiscale wavelet analysis allows us to localize the singularities of irregularly sampled data. This algorithm is very fast and very ecient and depends only on the number N of data points. After the singularities localization, one can use appropriate functions to approximate the data. For approximation, the basis functions may be chosen as B-spline with multiple knots at each points where we have detected a singularity and simple knot elsewhere, the knot multiplicity corresponding to the degree of the singularity. References 1. Goldman R., Blossoming and Knot Insertion Algorithms for B-spline Curves, CAGD, 7 (1990), 69{ Mallat S., A Theory for Multiresolution Signal Decomposition : the Wavelet Representation, IEEE Trans. on PAMI, 11 (1989), 674{ Mallat S. and Hwang W., Singularity Detection and Processing with Wavelets, IEEE Trans. on Information Theory 38 (1992), 617{ Unser M., Aldroubi A. and Eden M., Fast B-spline Transforms for Continuous Image Representation and Interpolation, IEEE Trans. on PAMI, 13 (1991), 277{ Unser M. and Aldroubi A., Polynomial splines and Wavelets: A signal Processing Perspective, in Wavelets : A tutorial, C.K.Chui (eds.), Academic Press, (1991). Christine Potier and Christine Vercken Telecom Paris 46 rue Barrault 74634, Paris Cedex13, FRANCE Christine.Potier@ inf.enst.fr Christine.Vercken@ inf.enst.fr
X.-P. HANG ETAL, FROM THE WAVELET SERIES TO THE DISCRETE WAVELET TRANSFORM Abstract Discrete wavelet transform (DWT) is computed by subband lters bank
X.-P. HANG ETAL, FROM THE WAVELET SERIES TO THE DISCRETE WAVELET TRANSFORM 1 From the Wavelet Series to the Discrete Wavelet Transform the Initialization Xiao-Ping hang, Li-Sheng Tian and Ying-Ning Peng
More informationA Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings
Scientific Papers, University of Latvia, 2010. Vol. 756 Computer Science and Information Technologies 207 220 P. A Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings
More informationSpline curves. in polar and Cartesian coordinates. Giulio Casciola and Serena Morigi. Department of Mathematics, University of Bologna, Italy
Spline curves in polar and Cartesian coordinates Giulio Casciola and Serena Morigi Department of Mathematics, University of Bologna, Italy Abstract. A new class of spline curves in polar coordinates has
More informationSurface pasting is a hierarchical modeling technique that. places feature surface atop base surface with approximate continuity.
Better Pasting via Quasi-Interpolation Blair Conrad and Stephen Mann Abstract Surface pasting is a hierarchical modeling technique that places feature surface atop base surface with approximate continuity
More informationconsisting of compact sets. A spline subdivision scheme generates from such
Spline Subdivision Schemes for Compact Sets with Metric Averages Nira Dyn and Elza Farkhi Abstract. To dene spline subdivision schemes for general compact sets, we use the representation of spline subdivision
More informationShift-invariance in the Discrete Wavelet Transform
Shift-invariance in the Discrete Wavelet Transform Andrew P. Bradley Cooperative Research Centre for Sensor Signal and Information Processing, School of Information Technology and Electrical Engineering,
More informationErasing Haar Coefficients
Recap Haar simple and fast wavelet transform Limitations not smooth enough: blocky How to improve? classical approach: basis functions Lifting: transforms 1 Erasing Haar Coefficients 2 Page 1 Classical
More informationTime frequency analysis Besov spaces Multigrid. Surfaces Subband filtering. Integral equations Splines Coherent states. Subdivision Transient analysis
Morning Section: Introductory Material Building Your Own Wavelets at Home Wim Sweldens and Peter Schroder Chapter 1 First Generation Wavelets 1.1 Introduction Wavelets have been making an appearance in
More informationEECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
More informationlecture 10: B-Splines
9 lecture : -Splines -Splines: a basis for splines Throughout our discussion of standard polynomial interpolation, we viewed P n as a linear space of dimension n +, and then expressed the unique interpolating
More informationRational Bezier Surface
Rational Bezier Surface The perspective projection of a 4-dimensional polynomial Bezier surface, S w n ( u, v) B i n i 0 m j 0, u ( ) B j m, v ( ) P w ij ME525x NURBS Curve and Surface Modeling Page 97
More informationA Wavelet Tour of Signal Processing The Sparse Way
A Wavelet Tour of Signal Processing The Sparse Way Stephane Mallat with contributions from Gabriel Peyre AMSTERDAM BOSTON HEIDELBERG LONDON NEWYORK OXFORD PARIS SAN DIEGO SAN FRANCISCO SINGAPORE SYDNEY»TOKYO
More informationWavelet based multiscale analysis for feature detection on images C. Ducottet Λ J. Fayolle y M. Chouvellon z T. Fournel x F. Trunde Abstract In this paper, we present afeature detection and characterization
More informationNeed for Parametric Equations
Curves and Surfaces Curves and Surfaces Need for Parametric Equations Affine Combinations Bernstein Polynomials Bezier Curves and Surfaces Continuity when joining curves B Spline Curves and Surfaces Need
More informationCHAPTER 6 DETECTION OF MASS USING NOVEL SEGMENTATION, GLCM AND NEURAL NETWORKS
130 CHAPTER 6 DETECTION OF MASS USING NOVEL SEGMENTATION, GLCM AND NEURAL NETWORKS A mass is defined as a space-occupying lesion seen in more than one projection and it is described by its shapes and margin
More informationNatural Quartic Spline
Natural Quartic Spline Rafael E Banchs INTRODUCTION This report describes the natural quartic spline algorithm developed for the enhanced solution of the Time Harmonic Field Electric Logging problem As
More information8 Piecewise Polynomial Interpolation
Applied Math Notes by R. J. LeVeque 8 Piecewise Polynomial Interpolation 8. Pitfalls of high order interpolation Suppose we know the value of a function at several points on an interval and we wish to
More informationRemark. Jacobs University Visualization and Computer Graphics Lab : ESM4A - Numerical Methods 331
Remark Reconsidering the motivating example, we observe that the derivatives are typically not given by the problem specification. However, they can be estimated in a pre-processing step. A good estimate
More informationDiscrete Cubic Interpolatory Splines
Publ RIMS, Kyoto Univ. 28 (1992), 825-832 Discrete Cubic Interpolatory Splines By Manjulata SHRIVASTAVA* Abstract In the present paper, existence, uniqueness and convergence properties of a discrete cubic
More informationA new 8-node quadrilateral spline finite element
Journal of Computational and Applied Mathematics 195 (2006) 54 65 www.elsevier.com/locate/cam A new 8-node quadrilateral spline finite element Chong-Jun Li, Ren-Hong Wang Institute of Mathematical Sciences,
More informationComputation of interpolatory splines via triadic subdivision
Computation of interpolatory splines via triadic subdivision Valery A. Zheludev and Amir Z. Averbuch Abstract We present an algorithm for computation of interpolatory splines of arbitrary order at triadic
More informationRational Bezier Curves
Rational Bezier Curves Use of homogeneous coordinates Rational spline curve: define a curve in one higher dimension space, project it down on the homogenizing variable Mathematical formulation: n P(u)
More informationEdge Detection with Hessian Matrix Property Based on Wavelet Transform
Journal of Sciences, Islamic Republic of Iran 26(2): 163-170 (2015) University of Tehran, ISSN 1016-1104 http://jsciencesutacir Edge Detection with Hessian Matrix Property Based on Wavelet Transform N
More informationHandout 4 - Interpolation Examples
Handout 4 - Interpolation Examples Middle East Technical University Example 1: Obtaining the n th Degree Newton s Interpolating Polynomial Passing through (n+1) Data Points Obtain the 4 th degree Newton
More informationBaltzer Journals 31 January 1996 The multiplicity of a spline zero Carl de Boor Computer Sciences Department University of Wisconsin-Madison 1210 West
Baltzer Journals 31 January 1996 The multiplicity of a spline zero Carl de Boor Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison WI 563706-1685 USA E-mail: deboor@cs.wisc.edu
More information2) For any triangle edge not on the boundary, there is exactly one neighboring
Triangulating Trimmed NURBS Surfaces Chang Shu and Pierre Boulanger Abstract. This paper describes techniques for the piecewise linear approximation of trimmed NURBS surfaces. The problem, called surface
More informationAdvanced Geometric Modeling CPSC789
Advanced Geometric Modeling CPSC789 Fall 2004 General information about the course CPSC 789 Advanced Geometric Modeling Fall 2004 Lecture Time and Place ENF 334 TR 9:30 10:45 Instructor : Office: MS 618
More informationWAVELET TRANSFORM BASED FEATURE DETECTION
WAVELET TRANSFORM BASED FEATURE DETECTION David Bařina Doctoral Degree Programme (1), DCGM, FIT BUT E-mail: ibarina@fit.vutbr.cz Supervised by: Pavel Zemčík E-mail: zemcik@fit.vutbr.cz ABSTRACT This paper
More informationWavelet Transform Fusion Several wavelet based techniques for fusion of -D images have been described in the literature [4, 5, 6, 7, 8, 3]. In all wav
-D Image Fusion by Multiscale Edge Graph Combination S. G. Nikolov, D. R. Bull, C. N. Canagarajah Image Communications Group Centre for Communications Research University of Bristol, Merchant Venturers
More informationAN EFFICIENT APPROACH FOR IMPROVING CANNY EDGE DETECTION ALGORITHM
AN EFFICIENT APPROACH FOR IMPROVING CANNY EDGE DETECTION ALGORITHM Shokhan M. H. Department of Computer Science, Al-Anbar University, Iraq ABSTRACT Edge detection is one of the most important stages in
More informationDaubechies Wavelets and Interpolating Scaling Functions and Application on PDEs
Daubechies Wavelets and Interpolating Scaling Functions and Application on PDEs R. Schneider F. Krüger TUB - Technical University of Berlin November 22, 2007 R. Schneider F. Krüger Daubechies Wavelets
More informationspline structure and become polynomials on cells without collinear edges. Results of this kind follow from the intrinsic supersmoothness of bivariate
Supersmoothness of bivariate splines and geometry of the underlying partition. T. Sorokina ) Abstract. We show that many spaces of bivariate splines possess additional smoothness (supersmoothness) that
More informationA Practical Review of Uniform B-Splines
A Practical Review of Uniform B-Splines Kristin Branson A B-spline is a convenient form for representing complicated, smooth curves. A uniform B-spline of order k is a piecewise order k Bezier curve, and
More information[2]. Recently, a direct connection between wavelet thresholding and Besov spaces was revealed through the formulation of signal estimation as a variat
MULTIPLE BASIS WAVELET DENOISING USING BESOV PROJECTIONS Hyeokho Choi and Richard Baraniuk Department of Electrical and Computer Engineering, Rice University, Houston, T 77251{1892, USA ABSTRACT Wavelet-based
More informationlinearize discretize Galerkin optimize sample
Fairing by Finite Dierence Methods Leif Kobbelt Abstract. We propose an ecient and exible scheme to fairly interpolate or approximate the vertices of a given triangular mesh. Instead of generating a piecewise
More information3. Lifting Scheme of Wavelet Transform
3. Lifting Scheme of Wavelet Transform 3. Introduction The Wim Sweldens 76 developed the lifting scheme for the construction of biorthogonal wavelets. The main feature of the lifting scheme is that all
More informationPoint Lattices in Computer Graphics and Visualization how signal processing may help computer graphics
Point Lattices in Computer Graphics and Visualization how signal processing may help computer graphics Dimitri Van De Ville Ecole Polytechnique Fédérale de Lausanne Biomedical Imaging Group dimitri.vandeville@epfl.ch
More information{ N V :number of vertices of a polygon { N B :number of boundary points of a shape { N C :number of FD coecients used in shape reconstruction { V i :t
Modied Fourier Descriptors for Shape Representation { A Practical Approach Yong Rui, Alfred C. She, and Thomas S. Huang? Beckman Institute, University of Illinois at Urbana-Champaign Urbana, IL 6181, USA
More informationUniversitat Hamburg, Fachbereich Informatik, Arbeitsbereich Kognitive Systeme. Vogt-Kolln-Str. 30, D Hamburg, Germany
Reducing False Detections in Extracting 3D Anatomical Point Landmarks? Sonke Frantz, Karl Rohr, and H. Siegfried Stiehl Universitat Hamburg, Fachbereich Informatik, Arbeitsbereich Kognitive Systeme Vogt-Kolln-Str.
More informationEdge detection. Goal: Identify sudden. an image. Ideal: artist s line drawing. object-level knowledge)
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded in the edges More compact than pixels Ideal: artist
More informationGeneralizing the C 4 Four-directional Box Spline to Surfaces of Arbitrary Topology Luiz Velho Abstract. In this paper we introduce a new scheme that g
Generalizing the C 4 Four-directional Box Spline to Surfaces of Arbitrary Topology Luiz Velho Abstract. In this paper we introduce a new scheme that generalizes the four-directional box spline of class
More informationME 261: Numerical Analysis Lecture-12: Numerical Interpolation
1 ME 261: Numerical Analysis Lecture-12: Numerical Interpolation Md. Tanver Hossain Department of Mechanical Engineering, BUET http://tantusher.buet.ac.bd 2 Inverse Interpolation Problem : Given a table
More informationDefense Technical Information Center Compilation Part Notice
UNCLASSIFIED Defense Technical Information Center Compilation Part Notice ADPO 11969 TITLE: Building Adaptive Multiresolution Schemes within Harten's Framework DISTRIBUTION: Approved for public release,
More informationIEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 8, NO. 12, DECEMBER Image Representations Using Multiscale Differential Operators.
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 8, NO. 12, DECEMBER 1999 1757 Image Representations Using Multiscale Differential Operators Yu-Ping Wang Abstract Differential operators have been widely used
More informationA Spline-Wavelet Image Decomposition for a Dierence Engine P. C. Marais 1, E. H. Blake Department of Computer Science, University of Cape Town, Rondeb
A Spline-Wavelet Image Decomposition for a Dierence Engine P. C. Marais 1, E. H. Blake Department of Computer Science, University of Cape Town, Rondebosch 7700, RSA A. A. M. Kuijk CWI, Department of Interactive
More informationMar. 20 Math 2335 sec 001 Spring 2014
Mar. 20 Math 2335 sec 001 Spring 2014 Chebyshev Polynomials Definition: For an integer n 0 define the function ( ) T n (x) = cos n cos 1 (x), 1 x 1. It can be shown that T n is a polynomial of degree n.
More informationPolynomials tend to oscillate (wiggle) a lot, even when our true function does not.
AMSC/CMSC 460 Computational Methods, Fall 2007 UNIT 2: Spline Approximations Dianne P O Leary c 2001, 2002, 2007 Piecewise polynomial interpolation Piecewise polynomial interpolation Read: Chapter 3 Skip:
More informationIn some applications it may be important that the extrema of the interpolating function are within the extrema of the given data.
Shape-preserving piecewise poly. interpolation In some applications it may be important that the extrema of the interpolating function are within the extrema of the given data. For example: If you the
More informationMost shapes are simply too complicated to dene using a single Bezier curve. A spline curve is
Chapter 5 B-SPLINE CURVES Most shapes are simply too complicated to dene using a single Bezier curve. A spline curve is a sequence of curve segments that are connected together to form a single continuous
More informationDEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING DS7201 ADVANCED DIGITAL IMAGE PROCESSING II M.E (C.S) QUESTION BANK UNIT I 1. Write the differences between photopic and scotopic vision? 2. What
More informationAn Introduction to B-Spline Curves
An Introduction to B-Spline Curves Thomas W. Sederberg March 14, 2005 1 B-Spline Curves Most shapes are simply too complicated to define using a single Bézier curve. A spline curve is a sequence of curve
More informationFebruary 2017 (1/20) 2 Piecewise Polynomial Interpolation 2.2 (Natural) Cubic Splines. MA378/531 Numerical Analysis II ( NA2 )
f f f f f (/2).9.8.7.6.5.4.3.2. S Knots.7.6.5.4.3.2. 5 5.2.8.6.4.2 S Knots.2 5 5.9.8.7.6.5.4.3.2..9.8.7.6.5.4.3.2. S Knots 5 5 S Knots 5 5 5 5.35.3.25.2.5..5 5 5.6.5.4.3.2. 5 5 4 x 3 3.5 3 2.5 2.5.5 5
More informationLet v be a vertex primed by v i (s). Then the number f(v) of neighbours of v which have
Let v be a vertex primed by v i (s). Then the number f(v) of neighbours of v which have been red in the sequence up to and including v i (s) is deg(v)? s(v), and by the induction hypothesis this sequence
More informationUNSTRUCTURED GRIDS ON NURBS SURFACES. The surface grid can be generated either in a parameter. surfaces. Generating grids in a parameter space is
UNSTRUCTURED GRIDS ON NURBS SURFACES Jamshid Samareh-Abolhassani 1 Abstract A simple and ecient computational method is presented for unstructured surface grid generation. This method is built upon an
More informationConvergence of C 2 Deficient Quartic Spline Interpolation
Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 4 (2017) pp. 519-527 Research India Publications http://www.ripublication.com Convergence of C 2 Deficient Quartic Spline
More informationLecture VIII. Global Approximation Methods: I
Lecture VIII Global Approximation Methods: I Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Global Methods p. 1 /29 Global function approximation Global methods: function
More information08 - Designing Approximating Curves
08 - Designing Approximating Curves Acknowledgement: Olga Sorkine-Hornung, Alexander Sorkine-Hornung, Ilya Baran Last time Interpolating curves Monomials Lagrange Hermite Different control types Polynomials
More informationImportant Properties of B-spline Basis Functions
Important Properties of B-spline Basis Functions P2.1 N i,p (u) = 0 if u is outside the interval [u i, u i+p+1 ) (local support property). For example, note that N 1,3 is a combination of N 1,0, N 2,0,
More informationAn Optimization Method Based On B-spline Shape Functions & the Knot Insertion Algorithm
An Optimization Method Based On B-spline Shape Functions & the Knot Insertion Algorithm P.A. Sherar, C.P. Thompson, B. Xu, B. Zhong Abstract A new method is presented to deal with shape optimization problems.
More informationInterpolation with complex B-splines
Interpolation with complex B-splines Brigitte Forster Fakultät für Informatik und Mathematik Universität Passau Brigitte Forster (Passau) Bernried 2016 1 / 32 The first part of a story in three chapters
More informationComparison between Various Edge Detection Methods on Satellite Image
Comparison between Various Edge Detection Methods on Satellite Image H.S. Bhadauria 1, Annapurna Singh 2, Anuj Kumar 3 Govind Ballabh Pant Engineering College ( Pauri garhwal),computer Science and Engineering
More informationGeneralised Mean Averaging Interpolation by Discrete Cubic Splines
Publ. RIMS, Kyoto Univ. 30 (1994), 89-95 Generalised Mean Averaging Interpolation by Discrete Cubic Splines By Manjulata SHRIVASTAVA* Abstract The aim of this work is to introduce for a discrete function,
More informationLecture 7: Most Common Edge Detectors
#1 Lecture 7: Most Common Edge Detectors Saad Bedros sbedros@umn.edu Edge Detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the
More informationLocalization in Graphs. Richardson, TX Azriel Rosenfeld. Center for Automation Research. College Park, MD
CAR-TR-728 CS-TR-3326 UMIACS-TR-94-92 Samir Khuller Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park, MD 20742-3255 Localization in Graphs Azriel
More informationLECTURE NOTES - SPLINE INTERPOLATION. 1. Introduction. Problems can arise when a single high-degree polynomial is fit to a large number
LECTURE NOTES - SPLINE INTERPOLATION DR MAZHAR IQBAL 1 Introduction Problems can arise when a single high-degree polynomial is fit to a large number of points High-degree polynomials would obviously pass
More informationJoe Warren. Rice University
Subdivision methods for geometric design Joe Warren Department of Computer Science Rice University November 5, 995 Contents Introduction 5 Subdivision methods for uniform B-splines. Degree zero B-splines
More informationCS 450 Numerical Analysis. Chapter 7: Interpolation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationInterpolation by Spline Functions
Interpolation by Spline Functions Com S 477/577 Sep 0 007 High-degree polynomials tend to have large oscillations which are not the characteristics of the original data. To yield smooth interpolating curves
More informationEdge Detection by Multi-Dimensional Wavelets
Edge Detection by Multi-Dimensional Wavelets Marlana Anderson, Chris Brasfield, Pierre Gremaud, Demetrio Labate, Katherine Maschmeyer, Kevin McGoff, Julie Siloti August 1, 2007 Abstract It is well known
More informationFour equations are necessary to evaluate these coefficients. Eqn
1.2 Splines 11 A spline function is a piecewise defined function with certain smoothness conditions [Cheney]. A wide variety of functions is potentially possible; polynomial functions are almost exclusively
More informationBézier Splines. B-Splines. B-Splines. CS 475 / CS 675 Computer Graphics. Lecture 14 : Modelling Curves 3 B-Splines. n i t i 1 t n i. J n,i.
Bézier Splines CS 475 / CS 675 Computer Graphics Lecture 14 : Modelling Curves 3 n P t = B i J n,i t with 0 t 1 J n, i t = i=0 n i t i 1 t n i No local control. Degree restricted by the control polygon.
More informationLearning Two-Dimensional Shapes using Wavelet Local Extrema
Learning Two-Dimensional Shapes using Wavelet Local Extrema tyuichi NAKAMURA t Institute of Information Sciences and Electronics University of Tsukuba Tsukuba City, 305, JAPAN STsu t omu Y 0 SHID A $ Communications
More informationAMS527: Numerical Analysis II
AMS527: Numerical Analysis II A Brief Overview of Finite Element Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao SUNY Stony Brook AMS527: Numerical Analysis II 1 / 25 Overview Basic concepts Mathematical
More informationalong the curves is usually an image of edge points that represent simple incomplete shapes. These edge points are represented as a binary image with
Multiple Contour Finding and Perceptual Grouping using Minimal Paths Laurent D. COHEN CEREMADE, UMR 7534, Universite Paris-Dauphine 75775 Paris cedex 16, France; Email: cohen@ceremade.dauphine.fr Abstract
More informationThe use of the Spectral Properties of the Basis Splines in Problems of Signal Processing
The use of the Spectral Properties of the Basis Splines in Problems of Signal Processing Zaynidinov Hakim Nasiritdinovich, MirzayevAvazEgamberdievich, KhalilovSirojiddinPanjievich Doctor of Science, professor,
More informationHighly Symmetric Bi-frames for Triangle Surface Multiresolution Processing
Highly Symmetric Bi-frames for Triangle Surface Multiresolution Processing Qingtang Jiang and Dale K. Pounds Abstract In this paper we investigate the construction of dyadic affine (wavelet) bi-frames
More informationA family of Non-Oscillatory, 6 points, Interpolatory subdivision scheme
A family of Non-Oscillatory, 6 points, Interpolatory subdivision scheme Rosa Donat, Sergio López-Ureña, Maria Santágueda Universitat de València. Universitat Jaume I. Bernried, February 29 - March 4, 2016
More informationA CONSTRUCTION OF SECOND GENERATION WAVELETS WIM SWELDENS. May 1995, Revised November To appear in SIAM Journal on Mathematical Analysis
THE LIFTING SCHEME: CONSTRUCTION OF SECOND GENERTION WVELETS WIM SWELDENS May 1995, Revised November 1996 To appear in SIM Journal on Mathematical nalysis bstract. We present the lifting scheme, a simple
More informationEdge and local feature detection - 2. Importance of edge detection in computer vision
Edge and local feature detection Gradient based edge detection Edge detection by function fitting Second derivative edge detectors Edge linking and the construction of the chain graph Edge and local feature
More informationA general matrix representation for non-uniform B-spline subdivision with boundary control
A general matrix representation for non-uniform B-spline subdivision with boundary control G. Casciola a, L. Romani a a Department of Mathematics, University of Bologna, P.zza di Porta San Donato 5, 40127
More informationDigital Image Processing. Chapter 7: Wavelets and Multiresolution Processing ( )
Digital Image Processing Chapter 7: Wavelets and Multiresolution Processing (7.4 7.6) 7.4 Fast Wavelet Transform Fast wavelet transform (FWT) = Mallat s herringbone algorithm Mallat, S. [1989a]. "A Theory
More information99 International Journal of Engineering, Science and Mathematics
Journal Homepage: Applications of cubic splines in the numerical solution of polynomials Najmuddin Ahmad 1 and Khan Farah Deeba 2 Department of Mathematics Integral University Lucknow Abstract: In this
More informationFitting Uncertain Data with NURBS
Fitting Uncertain Data with NURBS Wolfgang Heidrich, Richard Bartels, George Labahn Abstract. Fitting of uncertain data, that is, fitting of data points that are subject to some error, has important applications
More information(Spline, Bezier, B-Spline)
(Spline, Bezier, B-Spline) Spline Drafting terminology Spline is a flexible strip that is easily flexed to pass through a series of design points (control points) to produce a smooth curve. Spline curve
More informationIssues with Curve Detection Grouping (e.g., the Canny hysteresis thresholding procedure) Model tting They can be performed sequentially or simultaneou
an edge image, nd line or curve segments present Given the image. in Line and Curves Detection 1 Issues with Curve Detection Grouping (e.g., the Canny hysteresis thresholding procedure) Model tting They
More informationEdge and Texture. CS 554 Computer Vision Pinar Duygulu Bilkent University
Edge and Texture CS 554 Computer Vision Pinar Duygulu Bilkent University Filters for features Previously, thinking of filtering as a way to remove or reduce noise Now, consider how filters will allow us
More informationFebruary 23 Math 2335 sec 51 Spring 2016
February 23 Math 2335 sec 51 Spring 2016 Section 4.1: Polynomial Interpolation Interpolation is the process of finding a curve or evaluating a function whose curve passes through a known set of points.
More informationSolution: filter the image, then subsample F 1 F 2. subsample blur subsample. blur
Pyramids Gaussian pre-filtering Solution: filter the image, then subsample blur F 0 subsample blur subsample * F 0 H F 1 F 1 * H F 2 { Gaussian pyramid blur F 0 subsample blur subsample * F 0 H F 1 F 1
More informationCS 475 / CS Computer Graphics. Modelling Curves 3 - B-Splines
CS 475 / CS 675 - Computer Graphics Modelling Curves 3 - Bézier Splines n P t = i=0 No local control. B i J n,i t with 0 t 1 J n,i t = n i t i 1 t n i Degree restricted by the control polygon. http://www.cs.mtu.edu/~shene/courses/cs3621/notes/spline/bezier/bezier-move-ct-pt.html
More informationAN ALGORITHM FOR BLIND RESTORATION OF BLURRED AND NOISY IMAGES
AN ALGORITHM FOR BLIND RESTORATION OF BLURRED AND NOISY IMAGES Nader Moayeri and Konstantinos Konstantinides Hewlett-Packard Laboratories 1501 Page Mill Road Palo Alto, CA 94304-1120 moayeri,konstant@hpl.hp.com
More informationContents 1 Introduction 3 2 Edge Denition 3 3 Properties of Edge Detectors Smoothing of the Image Image Die
Edge Detection Techniques - An Overview Djemel Ziou Salvatore Tabbone Departement de math et informatique Crin - Cnrs/Inria Lorraine Universite de Sherbrooke 54506 Vandoeuvre-Les-Nancy Quebec, Canada,
More informationx[n] x[n] c[n] z -1 d[n] Analysis Synthesis Bank x [n] o d[n] Odd/ Even Split x[n] x [n] e c[n]
Roger L. Claypoole, Jr. and Richard G. Baraniuk, Rice University Summary We introduce and discuss biorthogonal wavelet transforms using the lifting construction. The lifting construction exploits a spatial{domain,
More informationARTIFICIAL INTELLIGENCE LABORATORY. A.I. Memo No August, Extracting Salient Curves from Images: An Analysis of the Saliency Network
MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LABORATORY A.I. Memo No. 55 August, 995 Extracting Salient Curves from Images: An Analysis of the Saliency Network T. D. Alter Ronen Basri
More information2D Spline Curves. CS 4620 Lecture 13
2D Spline Curves CS 4620 Lecture 13 2008 Steve Marschner 1 Motivation: smoothness In many applications we need smooth shapes [Boeing] that is, without discontinuities So far we can make things with corners
More informationOther Linear Filters CS 211A
Other Linear Filters CS 211A Slides from Cornelia Fermüller and Marc Pollefeys Edge detection Convert a 2D image into a set of curves Extracts salient features of the scene More compact than pixels Origin
More informationAdaptive and Smooth Surface Construction by Triangular A-Patches
Adaptive and Smooth Surface Construction by Triangular A-Patches Guoliang Xu Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, Beijing, China Abstract
More informationEDGE DETECTION IN MEDICAL IMAGES USING THE WAVELET TRANSFORM
EDGE DETECTION IN MEDICAL IMAGES USING THE WAVELET TRANSFORM J. Petrová, E. Hošťálková Department of Computing and Control Engineering Institute of Chemical Technology, Prague, Technická 6, 166 28 Prague
More informationInstitute of Telecommunications. We study applications of Gabor functions that are considered in computer vision systems, such as contour
Applications of Gabor Filters in Image Processing Sstems Rszard S. CHORA S Institute of Telecommunications Universit of Technolog and Agriculture 85-791 Bdgoszcz, ul.s. Kaliskiego 7 Abstract: - Gabor's
More information2D Spline Curves. CS 4620 Lecture 18
2D Spline Curves CS 4620 Lecture 18 2014 Steve Marschner 1 Motivation: smoothness In many applications we need smooth shapes that is, without discontinuities So far we can make things with corners (lines,
More informationMultiscale Detection of Curvilinear Structures in -D and 3-D Image Data Th. M. Koller, G. Gerig, G. Szekely, and D. Dettwiler Communication Technology Laboratory, Image Science, ETH-Zentrum, CH-89 Zurich,
More information