Edge Detections Using Box Spline Tight Frames
|
|
- Alannah Day
- 6 years ago
- Views:
Transcription
1 Edge Detections Using Box Spline Tight Frames Ming-Jun Lai 1) Abstract. We present a piece of numerical evidence that box spline tight frames are very useful for edge detection of images. Comparsion with standard wavelet and Laplace methods for edge detection is given to demonstrate the effectiveness of box spline tight frames. 1. Introduction There are many wavelet-frames available in the literature. See, e.g., [Ron and Shen 98a], [Ron and Shen 98b], [Chui, Jetter, and Stöckler 98], [Chui and He 01], [Chui and He 02], [Chui, He and Stöckler 02], and [Daubechies, Han, Ron and Shen 03]. It is interesting to see how well wavelet frames can help for image processing. We choose to study the nonseparable tight frames based on box splines which are recently constructed in [Lai and Stöckler 06]. In their paper, Lai and Stöckler provided a simple recipe for constructing multivariate tight frames. Also, they show that tight frames based on three and four direction box splines can be easily constructed. Several examples of tight frames based on box splines were constructed. More examples of box spline tight frames can be found in [Nam 05]. We implement some of these examples of box spline tight frames and use them for edge detection of images. The purpose of this paper is to report that the box spline tight frames are excellent for edge detection. Comparison with the standard wavelet method and a traditional Laplace method for edge detection is given. The comparison shows the box spline tight frames detect edges much more effectively. We shall use many examples to demonstrate the advantage although we do not know how to prove the phenomenon. One of heuristic arguments is that the filter length of box spline tight framelets is shortest among all refinable functions which have the same regularity as the box spline. Also, the box spline tight frames work well for image denoising. We shall report the advantages elsewhere (cf. [Nam 05]). The paper is organized as follows. We first review the concept of tight-frames and construction of tight frames in the multivariate setting. Especially, we present in detail tight framelets associated with one of box spline functions. These consist of Section 2. In 3, we present our edge detection experiments using the wavelet and wavelet-frame method. The method can be described as follows. At first we 1) Department of Mathematics, The University of Georgia, Athens, GA 30602, mjlai@math.uga.edu. This research is partly supported by the National Scicence Foundation under grant EAR and DMS
2 decompose an image into several levels of subimages consisting of a low-pass part and many high-pass parts. Then we set the low-pass part of the image into zero block, and reconstruct the image using the zero block and other high-pass parts at all levels. The reconstructed image is the edges of the image. In addition to our box spline tight frames, we use the tensor products of the well-known Haar wavelet, Daubechies D4 wavelet, and biorthogonal 9/7 wavelets for edge detection. Also, we use a traditional edge detection method called the Laplace method (cf. [Lim 90]) for the comparsion of the effectiveness of all these methods. Many sets of numerical examples are shown. From these experiments, we can conclude that the box spline tight frames work very well. Finally we note that there are many edge detection methods available in the literature and/or on the internet. We have no resoures to compare them all. Interested reader may compare their favorable method against the method of box spline tight frame to see which one works better. 2. Box spline Tight-Frames We begin with the definition of tight-frames based on multiresolution approximation of L 2 (IR 2 ). Given a function ψ L 2 (IR 2 ), we set Let Ψ be a finite subset of L 2 (IR 2 ) and ψ j,k (y) = 2 j ψ(2 j y k). Λ(Ψ) := {ψ j,k, ψ Ψ, j Z, k Z 2 }. Definition 2.1. We say that Λ(Ψ) is a frame if there exist two positive numbers A and B such that A f 2 L 2 (IR 2 ) f, g 2 B f 2 L 2 (IR 2 ) for all f L 2 (IR 2 ). g Λ(Ψ) Definition 2.2. Λ(Ψ) is a tight frame if it is a frame with A = B. In this case, after a renormalization of the g s in Ψ, we have f, g 2 = f 2 L 2 (IR 2 ) for all f L 2 (IR 2 ). g Λ(Ψ) It is known (cf. [Daubechies 92]) that when Λ(Ψ) is a tight frame, any f L 2 (IR 2 ) can be recovered from g Λ(Ψ), i.e. f = g Λ(Ψ) f, g g, f L 2 (IR 2 ). 2
3 Let φ L 2 (IR 2 ) be a compactly supported refinable function, i.e., ˆφ(ω) = P(ω/2)ˆφ(ω/2) where P(ω) is a trigonometric polynomial in e iω. P is often called the mask of refinable function φ. We look for Q i (trigonometric polynomial) such that P(ω)P(ω + l) + r Q i (ω)q i (ω + l) = i=0 { 1, if l = 0, 0, l {0, 1} 2 π\{0}. (2.1) The conditions (2.1) are called the Unitary Extension Principle (UEP) in [Daubechies, Han, Ron and Shen 03]. With these Q i s we can define wavelet frame generators or framelets ψ (i) defined in terms of the Fourier transform by ˆψ (i) (ω) = Q i (ω/2)ˆφ(ω/2), i = 1,..., r. (2.2) Then, if φ belongs to Lip α with α > 0, Ψ = {ψ (i), i = 1,..., r} generates a tight frame, i.e., Λ(Ψ) is a tight wavelet frame (cf. [Lai and Stöckler 06]). Furthermore, letting Q be a rectangular matrix defined by Q 1 (ξ, η) Q 1 (ξ + π, η) Q 1 (ξ, η + π) Q 1 (ξ + π, η + π) Q Q = 2 (ξ, η) Q 2 (ξ + π, η) Q 2 (ξ, η + π) Q 2 (ξ + π, η + π), Q 3 (ξ, η) Q 3 (ξ + π, η) Q 3 (ξ + π, η) Q 3 (ξ + π, η + π) Q 4 (ξ, η) Q 4 (ξ + π, η) Q 4 (ξ + π, η) Q 4 (ξ + π, η + π) and P = (P(ξ, η), P(ξ + π, η), P(ξ, η + π), P(ξ + π, η + π)) T, (2.1) is simply Q Q = I 4 4 PP T. (2.3) The construction of tight wavelet frames is to find Q satisfying (2.3). It is observed in [Lai and Stöckler 06] that Q can be easily found if P satisfies the QMF condition, i.e., P T P = 1. In this case, Q has a very simple expression. (See [Lai and Stöckler 06] for detail.) Next we note that the mask P of many refinable functions φ satisfies the following sub-qmf condition l {0,1} 2 π P(ω + l) 2 1. (2.4) In particular, for bivariate box splines on three or four direction mesh, the mask will satisfy (2.4). We now borrow a theorem from [Lai and Stöckler 06] to construct tigth framelets. 3
4 Theorem 2.3. Suppose that P satisfies the sub-qmf condition (2.4). Suppose that there exists Laurent polynomials P 1,..., P N such that m {0,1} 2 P m (ω) 2 + N P i (ω) 2 = 1. (2.5) Then there exist 4 + N compactly supported tight frame generators with wavelet masks Q m, m = 1,..., 4 + N such that P, Q m, m = 1,..., 4 + N satisfy (2.3). Note that the proof of Theorem 2.3 is constructive. In fact, let us include it here for convenience. Proof: We define the combined column vector P = ( P m (2ω); m {0, 1} d, Pi (2ω);, 1 i N) T of size (2 d + N) and the matrix i=1 Q := I (2d +N) (2 d +N) P P. Note that all entries of P and Q are π-periodic. Identity (3.6) implies that Q Q = Q, and this gives P P + Q Q = I (2d +N) (2 d +N). Restricting to the first principle 2 d 2 d blocks in the above matrices, we have P P + Q Q = I 2 d 2d, (3.7) where P = M P was already defined before and Q denotes the first 2 d (2 d + N) block matrix of Q. By (3.2), we have P = M P, and (3.7) yields which is (2.4). Thus we let PP + M Q(M Q) = I 2 d 2 d, Q = M Q. Then the first row [Q 1,..., Q 2 d +N] of Q gives the desired trigonometric functions for compactly supported tight wavelet frame generators. The form Q = [Q i (ω +l)] is inherited from M, since the entries of Q are π-periodic. This completes the proof. The method in the proof leads us to the construction of Q m and hence, tight framelets ψ (m), m = 1,, 4+N. Let us use bivariate box splines to illustrate how to construct ψ (m) s. We first recall the definition of bivariate box spline functions on four direction mesh. Set e 1 = (1, 0), e 2 = (0, 1), e 3 = e 1 + e 2, e 4 = e 1 e 2 to be direction vectors and let D be a set of these vectors with some repetitions. The box spline φ D associated with direction set D may be defined in terms of refinable equation by ˆφ D (ω) = P D ( ω 2 )ˆφ D ( ω 2 ) 4
5 where P D is the mask associated with φ defined by P D (ω) = 1 + e iξ ω. 2 ξ D See [Chui 88] and [de Boor, Höllig, and Riemenschneider 93] for many properties of box splines. For explicit polynomial representation of bivariate box splines, see [Lai 92]. Note that the mask P D satisfies (2.4). Using the constructive method, we construct these Q m and their associated tight framelets ψ m for many box spline functions on three and four direction meshes. In this paper we mainly present an example of tight framelets based on box spline φ See [Nam 05] for tight framelets associated with other box spline functions. Example 1. Consider the three directional box spline φ 1,1,1. It is easy to see that 1 l {0,1} 2 π Thus, we let P 1,1,1 (ω + l) 2 = cos(2ω 1) 1 8 cos(2ω 2) 1 8 cos(2ω 1 + 2ω 2 ). P 1 (ω) = 6 8 (1 eiω 1 ), and P 2 (ω) = 2 8 (2 eiω 2 e i(ω 1+ω 2 ) ). Clearly, we have l {0,1} 2 π P 1,1,1 (ω + l) P i (2ω) 2 = 1. Thus, we can apply the constructive steps in the proof of Theorem 2. to get 6 tight frame masks Q i, i = 1,, 6. We have implemented the constructive steps in a symbolic algebra software Maple and found these Q i s. We note that the constructive procedure in [Chui and He 01] yields 7 tight frame generators. For box spline φ 2211 with D = {e 1, e 1, e 2, e 2, e 3, e 4 }, the graph of φ 2211 is shown in Fig. 1. we have It is easy to check that i=1 ( ) 2 ( ) 2 ( ) ( 1 + e1 1 + e2 1 + e3 1 + e4 P 2211 (ω) = ). 1 l {0,1} 2 π P 2211 (ω + l) 2 = 4 P i (ω) 2, i=1 5
6 Fig. 1. Box spline φ 2211 where P 1 (ω) = (1 e4iω 1 ), P 2 (ω) = ( e2iω ) e 4iω 2 P 3 (ω) = e4iω ei(4ω 1+2ω 2 ) e2i(ω 1+ω 2 ), and P 4 (ω) = e4iω e2iω ei(2ω 1+4ω 2 ). Hence, we will have 8 tight frame generators using the constructive steps in the proof of Theorem 2.3. These 8 tight frames ψ m which can be expressed in terms of Fourier transform by ψ m (ω) = Q m (ω/2) φ 2211 (ω/2), where Q m, m = 1,, 8 are given in terms of coefficient matrix as follows: Q 1 = 6
7 8 6 c jk e ijω e ikξ with j=0 k=0 [c jk ] 0 j 8 0 k 6 = , 6 6 Q 2 = c jk e ijω e ikξ with j=0 k=0 [c jk ] 0 j 6 0 k = , Q 3 = c jk e ijω e ikξ with j=0 k=0 [c jk ] 0 j 8 0 k = ,
8 Q 4 = Q 5 = 6 j=0 k=0 8 j=0 k=0 [c jk ] 0 j 8 0 k 8 and Q 6 = 8 c jk e ijω e ikξ with [c jk ] 0 j 6 0 k = , c jk e ijω e ikξ with = , j=0 k=0 8 c jk e ijω e ikξ with [c jk ] 0 j 8 = k Q 7 has a complicated expression which is omitted here just for simplicity. (The authors are willing to provide its numerical values upon request.) Finally, we have 8
9 Q 8 = 8 j=0 k=0 5 c jk e ijω e ikξ with [c jk ] 0 j 8 0 k 5 = These coefficient matrices are high-pass filters associated with low-pass filter P They satisfy (2.3) which is an exact reconstruction condition. The graphs of these eight tight framelets are as shown in Fig Fig. 2. Box spline tight framelet ψ 1 and ψ 2 3. Numerical Experiments We shall use the tight frame based on box spline B 2211 for edge detection in the following experiments. Many other box spline tight frames have the similar effectiveness. To comparison for the effectiveness of edge detection, we also use tensor products of Haar wavelet, Daubechies D4 wavelet, and biorthogonal 9/7 wavelet which is famous for its application in FBI finger print compression. In addition, we use the so-called Laplace method (cf. [Lim 92, p.486]), a traditional method for edge detection. The wavelet method for edge detection can described as follows. We use 9
10 Fig. 3. Box spline tight framelet ψ3 and ψ4 Fig. 4. Box spline tight framelet ψ5 and ψ6 a wavelet or wavelet-frame to decompose an image into many levels of subimages which consist of a low-pass part and several high-pass parts of the image. Setting the low-pass part to be zero submatrix and using the high-pass parts, we reconstruct the image back. The reconstructed image is the edges of the image. For box spline tight-frame, we only do one level of decomposition. For other standard wavelets (Haar, Daubechies, biorthogonal 9/7 wavelets), we do 1, 2, 3 levels of decomposition dependent on the images. For some images, e.g. the finger print image, we must do 3 levels of decomposition while for many other images, one or two levels of decomposition are enough. We choose the best edge representation among three levels of decompositions to present in the report. To present the edges clearly, we normalize the reconstructed image into the standard grey level between 0 to 255 and use two thresholds 245 and 250 to divide 10
11 Fig. 5. Box spline tight framelet ψ 7 and ψ 8 the pixel values into two major groups. That is, if a pixel value is bigger than 250, it is set to be 255. If a pixel value is less than 245, it is set to be zero. Narrowing the two thresholds would either loss many detailed edges or thicken the edges. Also, all reconstructed edges have been treated for isolated dots. That is, any isolated nonzero pixel value is removed. The experiments consist of ten different images. For each image, we use 3 standard wavelets, box spline tight frame based on φ 2211, and the Laplace method to detect edges. The edges are shown in Figs Among the ten images, box spline tight frame detects edge more effectively in all images, comparing to the edges detected by tensor products of three wavelets. It detects edge better than the Laplace method in many images, especially when edges are curve. References 1. C. de Boor, K. Hölig, S. Riememschneider, Box Splines, Springer Verlag, New York, C. K. Chui, Multivariate Splines, SIAM Publications, Philedalphia, C. K. Chui and W. He, Construction of multivariate tight frames via Kronecter products, Appl. Comp. Harmonic Anal. 11(2001), C. K. Chui and W. He, Compactly supported tight frames associated with refinable functions, Appl. Comp. Harmonic Anal. 8(2000), C. K. Chui and W. He, Construction of multivariate tight fra mes via Kronecker products, Appl. Comp. Harmonic Anal. 11(2001), C. K. Chui, W. He, and J. Stöckler, Compactly supported tight and sibling frames with maximum vanishing moments, Appl. Comp. Harmonic Anal., 13 (2002), C. K. Chui, K. Jetter, J. Stöckler, Wavelets and frames on the four-directional 11
12 mesh. in Wavelets: theory, algorithms, and applications, Academic Press, San Diego, CA, 1994, pp I. Daubechies, Ten Lectures on Wavelets, SIAM Publications, Philedalphia, I. Daubechies, B. Han, A. Ron, Z. W. Shen, Framelets: MRA-based constructions of wavelet frames, Appl. Comp. Harmonic Anal., 14 (2003), M. J. Lai, Fortran subroutines for B-nets of box splines on three and four directional meshes, Numerical Algorithm, 2(1992), M. J. Lai and K. Nam, Image de-noising by using box spline tight-frames, manuscript, M. J. Lai and J. Stöckler, Construction of Compactly Supported Tight Frames, Applied Comput. Harm. Analysis See mjlai/pub.html for a copy. 13. J. S. Lim, Two-dimension Signal and Image Processing, Prentice Hall, New Jersey, K. Nam, Box Spline Tight Framelets for Image Processing, Ph.D. Dissertation, University of Georgia, under preparation, A. Ron and Z. W. Shen, Compactly supported tight affine spline frames in L 2 (R d ), Math. Comp. 67(1998), A. Ron and Z. W. Shen, Construction of compactly supported affine frames in L 2 (R d ), in Advances in Wavelets, K. S. Lau (ed.), Springer-Verlag, New York, 1998,
13 Fig. 6. The original image and edges detected using Haar wavelet Fig. 7. The edges detected using box spline tight frame (left) and Daubechies wavelet (right) Fig. 8. The edges detected by the Laplace method (left) and the biorthogonal 9/7 wavelet(right) 13
14 Fig. 9. The original image and edges detected using Haar wavelet Fig. 10. The edges detected using box spline tight frame (left) and Daubechies wavelet (right) Fig. 11. The edges detected by the Laplace method (left) and the biorthogonal 9/7 wavelet(right) 14
15 Fig. 12. The original image and edges detected using Haar wavelet Fig. 13. The edges detected using box spline tight frame (left) and Daubechies wavelet (right) Fig. 14. The edges detected by the Laplace method (left) and the biorthogonal 9/7 wavelet(right) 15
16 Fig. 15. The original image and edges detected using Haar wavelet Fig. 16. The edges detected using box spline tight frame (left) and Daubechies wavelet (right) Fig. 17. The edges detected by the Laplace method (left) and the biorthogonal 9/7 wavelet(right) 16
17 Fig. 18. The original image and edges detected using Haar wavelet Fig. 19. The edges detected using box spline tight frame (left) and Daubechies wavelet (right) Fig. 20. The edges detected by the Laplace method (left) and the biorthogonal 9/7 wavelet(right) 17
18 Fig. 21. The original image and edges detected using Haar wavelet Fig. 22. The edges detected using box spline tight frame (left) and Daubechies wavelet (right) Fig. 23. The edges detected by the Laplace method (left) and the biorthogonal 9/7 wavelet(right) 18
19 Fig. 24. The original image and edges detected using Haar wavelet Fig. 25. The edges detected using box spline tight frame (left) and Daubechies wavelet (right) Fig. 26. The edges detected by the Laplace method (left) and the biorthogonal 9/7 wavelet(right) 19
20 Fig. 27. The original image and edges detected using Haar wavelet Fig. 28. The edges detected using box spline tight frame (left) and Daubechies wavelet (right) Fig. 29. The edges detected by the Laplace method (left) and the biorthogonal 9/7 wavelet(right) 20
21 Fig. 30. The original image and edges detected using Haar wavelet Fig. 31. The edges detected using box spline tight frame(left) and Daubechies wavelet(right) Fig. 32. The edges detected by the Laplace method (left) and the biorthogonal 9/7 wavelet(right) 21
22 Fig. 33. The original image and edges detected using Haar wavelet Fig. 34. The edges detected using box spline tight frame(left) and Daubechies wavelet(right) Fig. 35. The edges detected by the Laplace method (left) and the biorthogonal 9/7 wavelet(right) 22
BOX SPLINE WAVELET FRAMES FOR IMAGE EDGE ANALYSIS
BOX SPLINE WAVELET FRAMES FOR IMAGE EDGE ANALYSIS WEIHONG GUO AND MING-JUN LAI Abstract. We present a new box spline wavelet frame and apply it for image edge analysis. The wavelet frame is constructed
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 informationCOMPACTLY SUPPORTED TIGHT AFFINE SPLINE FRAMES IN L 2 (R d ) AMOS RON AND ZUOWEI SHEN
MATHEMATICS OF COMPUTATION Volume 67, Number 1, January 1998, Pages 191 07 S 005-5718(98)00898-9 COMPACTLY SUPPORTED TIGHT AFFINE SPLINE FRAMES IN L (R d ) AMOS RON AND ZUOWEI SHEN Abstract. The theory
More informationTight Wavelet Frame Decomposition and Its Application in Image Processing
ITB J. Sci. Vol. 40 A, No., 008, 151-165 151 Tight Wavelet Frame Decomposition an Its Application in Image Processing Mahmu Yunus 1, & Henra Gunawan 1 1 Analysis an Geometry Group, FMIPA ITB, Banung Department
More informationFourier transform of Bernstein Bézier polynomials
Illinois Wesleyan University From the SelectedWorks of Tian-Xiao He 27 Fourier transform of Bernstein Bézier polynomials Tian-Xiao He, Illinois Wesleyan University Charles K. Chui Qingtang Jiang Available
More informationApplications of Wavelets and Framelets
Applications of Wavelets and Framelets Bin Han Department of Mathematical and Statistical Sciences University of Alberta, Edmonton, Canada Present at 2017 International Undergraduate Summer Enrichment
More informationFourier Transform of Bernstein-Bézier Polynomials
Fourier Transform of Bernstein-Bézier Polynomials Charles. K. Chui, Tian-Xiao He 2, and Qingtang Jiang 3 Department of Mathematics and Computer Science University of Missouri-St. Louis, St. Louis, MO 632,
More informationC 1 Quintic Spline Interpolation Over Tetrahedral Partitions
C 1 Quintic Spline Interpolation Over Tetrahedral Partitions Gerard Awanou and Ming-Jun Lai Abstract. We discuss the implementation of a C 1 quintic superspline method for interpolating scattered data
More informationRefinable bivariate quartic and quintic C 2 -splines for quadrilateral subdivisions
Refinable bivariate quartic and quintic C 2 -splines for quadrilateral subdivisions Charles K. Chui, Qingtang Jiang Department of Mathematics and Computer Science University of Missouri St. Louis St. Louis,
More informationMatrix-valued 4-point Spline and 3-point Non-spline Interpolatory Curve Subdivision Schemes
Matrix-valued 4-point Spline and -point Non-spline Interpolatory Curve Subdivision Schemes Charles K. Chui, Qingtang Jiang Department of Mathematics and Computer Science University of Missouri St. Louis
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn Michael S. Floater Kai Hormann Abstract. We present a new four-point subdivision scheme that generates C 2 curves.
More informationCoE4TN3 Image Processing. Wavelet and Multiresolution Processing. Image Pyramids. Image pyramids. Introduction. Multiresolution.
CoE4TN3 Image Processing Image Pyramids Wavelet and Multiresolution Processing 4 Introduction Unlie Fourier transform, whose basis functions are sinusoids, wavelet transforms are based on small waves,
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn School of Mathematical Sciences Tel Aviv University Michael S. Floater Department of Informatics University of
More informationHarmonic Spline Series Representation of Scaling Functions
Harmonic Spline Series Representation of Scaling Functions Thierry Blu and Michael Unser Biomedical Imaging Group, STI/BIO-E, BM 4.34 Swiss Federal Institute of Technology, Lausanne CH-5 Lausanne-EPFL,
More informationEvaluation of Loop Subdivision Surfaces
Evaluation of Loop Subdivision Surfaces Jos Stam Alias wavefront, Inc. 8 Third Ave, 8th Floor, Seattle, WA 980, U.S.A. jstam@aw.sgi.com Abstract This paper describes a technique to evaluate Loop subdivision
More informationApplication of Daubechies Wavelets for Image Compression
Application of Daubechies Wavelets for Image Compression Heydari. Aghile 1,*, Naseri.Roghaye 2 1 Department of Math., Payame Noor University, Mashad, IRAN, Email Address a_heidari@pnu.ac.ir, Funded by
More informationNormals of subdivision surfaces and their control polyhedra
Computer Aided Geometric Design 24 (27 112 116 www.elsevier.com/locate/cagd Normals of subdivision surfaces and their control polyhedra I. Ginkel a,j.peters b,,g.umlauf a a University of Kaiserslautern,
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 informationDepartment of Mathematics and Computer Science University of Missouri St. Louis St. Louis, MO 63121
Triangular 7 and Quadrilateral 5 Subdivision Schemes: Regular Case Charles K. Chui 1, Qingtang Jiang 2 3, Rokhaya N. Ndao Department of Mathematics and Computer Science University of Missouri St. Louis
More informationNormals of subdivision surfaces and their control polyhedra
Normals of subdivision surfaces and their control polyhedra I. Ginkel, a, J. Peters b, and G. Umlauf a, a University of Kaiserslautern, Germany b University of Florida, Gainesville, FL, USA Abstract For
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 informationReversible Wavelets for Embedded Image Compression. Sri Rama Prasanna Pavani Electrical and Computer Engineering, CU Boulder
Reversible Wavelets for Embedded Image Compression Sri Rama Prasanna Pavani Electrical and Computer Engineering, CU Boulder pavani@colorado.edu APPM 7400 - Wavelets and Imaging Prof. Gregory Beylkin -
More informationInterpolation and Splines
Interpolation and Splines Anna Gryboś October 23, 27 1 Problem setting Many of physical phenomenona are described by the functions that we don t know exactly. Often we can calculate or measure the values
More informationData-Driven Tight Frame for Multi-Channel Images and Its Application to Joint Color-Depth Image Reconstruction
Data-Driven Tight Frame for Multi-Channel Images and Its Application to Joint Color-Depth Image Reconstruction Jin Wang Jian-Feng Cai Abstract In image restoration, we usually assume that the underlying
More information. Construction of Compactly Supported Ane Frames in L (IR d ) wavelet been found satisfactory, other wavelet constructions, together with the MRA fram
Construction of Compactly Supported Ane Frames in L (IR d ) Amos Ron and Zuowei Shen. Wavelet Frames: What and Why? Since the publication, less than ten years ago, of Mallat's paper on Multiresoltion Analysis
More informationRECENTLY frames or redundant expansions of signals
2126 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 6, JUNE 2006 Interpolatory Frames in Signal Space Amir Z. Averbuch, Valery A. Zheludev, Tamir Cohen Abstract We present a new family of frames,
More informationOn the Dimension of the Bivariate Spline Space S 1 3( )
On the Dimension of the Bivariate Spline Space S 1 3( ) Gašper Jaklič Institute of Mathematics, Physics and Mechanics University of Ljubljana Jadranska 19, 1000 Ljubljana, Slovenia Gasper.Jaklic@fmf.uni-lj.si
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 informationRectangular Matrix Multiplication Revisited
JOURNAL OF COMPLEXITY, 13, 42 49 (1997) ARTICLE NO. CM970438 Rectangular Matrix Multiplication Revisited Don Coppersmith IBM Research, T. J. Watson Research Center, Yorktown Heights, New York 10598 Received
More informationDeficient Quartic Spline Interpolation
International Journal of Computational Science and Mathematics. ISSN 0974-3189 Volume 3, Number 2 (2011), pp. 227-236 International Research Publication House http://www.irphouse.com Deficient Quartic
More informationDesign of Orthogonal Graph Wavelet Filter Banks
Design of Orthogonal Graph Wavelet Filter Banks Xi ZHANG Department of Communication Engineering and Informatics The University of Electro-Communications Chofu-shi, Tokyo, 182-8585 JAPAN E-mail: zhangxi@uec.ac.jp
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 informationWavelets An Introduction
Wavelets An Introduction Christian Lessig Abstract Wavelets are used in a wide range of applications such as signal analysis, signal compression, finite element methods, differential equations, and integral
More informationNew Basis Functions and Their Applications to PDEs
Copyright c 2007 ICCES ICCES, vol.3, no.4, pp.169-175, 2007 New Basis Functions and Their Applications to PDEs Haiyan Tian 1, Sergiy Reustkiy 2 and C.S. Chen 1 Summary We introduce a new type of basis
More informationVolume Data Interpolation using Tensor Products of Spherical and Radial Splines
Volume Data Interpolation using Tensor Products of Spherical and Radial Splines V. Baramidze and M. J. Lai Abstract. Trivariate splines solve a special case of scattered data interpolation problem in the
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationOptimal Quasi-Interpolation by Quadratic C 1 -Splines on Type-2 Triangulations
Optimal Quasi-Interpolation by Quadratic C 1 -Splines on Type-2 Triangulations Tatyana Sorokina and Frank Zeilfelder Abstract. We describe a new scheme based on quadratic C 1 -splines on type-2 triangulations
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 informationTensor products in a wavelet setting
Chapter 8 Tensor products in a wavelet setting In Chapter 7 we defined tensor products in terms of vectors, and we saw that the tensor product of two vectors is in fact a matrix. The same construction
More informationContourlets and Sparse Image Expansions
Contourlets and Sparse Image Expansions Minh N. Do Department of Electrical and Computer Engineering University of Illinois, Urbana IL 61801 ABSTRACT Recently, the contourlet transform 1 has been developed
More informationarxiv: v1 [math.co] 25 Sep 2015
A BASIS FOR SLICING BIRKHOFF POLYTOPES TREVOR GLYNN arxiv:1509.07597v1 [math.co] 25 Sep 2015 Abstract. We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff
More informationPacked Integer Wavelet Transform Constructed by Lifting Scheme
1496 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 10, NO. 8, DECEMBER 2000 Packed Integer Wavelet Transform Constructed by Lting Scheme Chengjiang Lin, Bo Zhang, and Yuan F. Zheng
More informationImage Compression Algorithm for Different Wavelet Codes
Image Compression Algorithm for Different Wavelet Codes Tanveer Sultana Department of Information Technology Deccan college of Engineering and Technology, Hyderabad, Telangana, India. Abstract: - This
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 informationWavelet-Galerkin Solutions of One and Two Dimensional Partial Differential Equations
VOL 3, NO0 Oct, 202 ISSN 2079-8407 2009-202 CIS Journal All rights reserved http://wwwcisjournalorg Wavelet-Galerkin Solutions of One and Two Dimensional Partial Differential Equations Sabina, 2 Vinod
More informationMatrix-Nullspace Wavelet Construction. Subendran Sivalingam
Matrix-Nullspace Wavelet Construction Subendran Sivalingam September 30, 1994 Abstract Wavelets have been a very popular topic of conversation in many scientific and engineering gatherings these days.
More informationOutline Introduction Problem Formulation Proposed Solution Applications Conclusion. Compressed Sensing. David L Donoho Presented by: Nitesh Shroff
Compressed Sensing David L Donoho Presented by: Nitesh Shroff University of Maryland Outline 1 Introduction Compressed Sensing 2 Problem Formulation Sparse Signal Problem Statement 3 Proposed Solution
More informationParameterization for curve interpolation
Working title: Topics in Multivariate Approximation and Interpolation 101 K. Jetter et al., Editors c 2005 Elsevier B.V. All rights reserved Parameterization for curve interpolation Michael S. Floater
More informationBernstein-Bezier Splines on the Unit Sphere. Victoria Baramidze. Department of Mathematics. Western Illinois University
Bernstein-Bezier Splines on the Unit Sphere Victoria Baramidze Department of Mathematics Western Illinois University ABSTRACT I will introduce scattered data fitting problems on the sphere and discuss
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 informationPOLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if
POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :
More informationFully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon
Fully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon Tamal Pramanick 1,a) 1 Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati
More informationContourlets: Construction and Properties
Contourlets: Construction and Properties Minh N. Do Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign www.ifp.uiuc.edu/ minhdo minhdo@uiuc.edu Joint work with
More informationOn the deviation of a parametric cubic spline interpolant from its data polygon
Computer Aided Geometric Design 25 (2008) 148 156 wwwelseviercom/locate/cagd On the deviation of a parametric cubic spline interpolant from its data polygon Michael S Floater Department of Computer Science,
More informationDe-Noising with Spline Wavelets and SWT
De-Noising with Spline Wavelets and SWT 1 Asst. Prof. Ravina S. Patil, 2 Asst. Prof. G. D. Bonde 1Asst. Prof, Dept. of Electronics and telecommunication Engg of G. M. Vedak Institute Tala. Dist. Raigad
More informationMultiscale 3-D texture segmentation: Isotropic Representations
Multiscale 3-D texture segmentation: Isotropic Representations Saurabh Jain Department of Mathematics University of Houston March 28th 2008 2008 Spring Southeastern Meeting Special Session on Wavelets,
More informationCLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS
CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS B.Vanajakshi Department of Electronics & Communications Engg. Assoc.prof. Sri Viveka Institute of Technology Vijayawada, India E-mail:
More informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationA NEW PROOF OF THE SMOOTHNESS OF 4-POINT DESLAURIERS-DUBUC SCHEME
J. Appl. Math. & Computing Vol. 18(2005), No. 1-2, pp. 553-562 A NEW PROOF OF THE SMOOTHNESS OF 4-POINT DESLAURIERS-DUBUC SCHEME YOUCHUN TANG, KWAN PYO KO* AND BYUNG-GOOK LEE Abstract. It is well-known
More informationElement Quality Metrics for Higher-Order Bernstein Bézier Elements
Element Quality Metrics for Higher-Order Bernstein Bézier Elements Luke Engvall and John A. Evans Abstract In this note, we review the interpolation theory for curvilinear finite elements originally derived
More informationModule 9 : Numerical Relaying II : DSP Perspective
Module 9 : Numerical Relaying II : DSP Perspective Lecture 36 : Fast Fourier Transform Objectives In this lecture, We will introduce Fast Fourier Transform (FFT). We will show equivalence between FFT and
More informationarxiv: v1 [math.co] 13 Aug 2017
Strong geodetic problem in grid like architectures arxiv:170803869v1 [mathco] 13 Aug 017 Sandi Klavžar a,b,c April 11, 018 Paul Manuel d a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia
More informationMatrix-valued Subdivision Schemes for Generating Surfaces with Extraordinary Vertices
Matrix-valued Subdivision Schemes for Generating Surfaces with Extraordinary Vertices Charles K. Chui, Qingtang Jiang Department of Mathematics & Computer Science University of Missouri St. Louis St. Louis,
More informationComments on the randomized Kaczmarz method
Comments on the randomized Kaczmarz method Thomas Strohmer and Roman Vershynin Department of Mathematics, University of California Davis, CA 95616-8633, USA. strohmer@math.ucdavis.edu, vershynin@math.ucdavis.edu
More informationQuery by Fax for Content-Based Image Retrieval
Query by Fax for Content-Based Image Retrieval Mohammad F. A. Fauzi and Paul H. Lewis Intelligence, Agents and Multimedia Group, Department of Electronics and Computer Science, University of Southampton,
More informationCPSC 535 Assignment 1: Introduction to Matlab and Octave
CPSC 535 Assignment 1: Introduction to Matlab and Octave The goal of this assignment is to become familiar with Matlab and Octave as tools for scientific investigation. Matlab, a product of Mathworks,
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 informationA Low-power, Low-memory System for Wavelet-based Image Compression
A Low-power, Low-memory System for Wavelet-based Image Compression James S. Walker Department of Mathematics University of Wisconsin Eau Claire Truong Q. Nguyen Department of Electrical and Computer 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 informationCHAPTER 3 WAVELET DECOMPOSITION USING HAAR WAVELET
69 CHAPTER 3 WAVELET DECOMPOSITION USING HAAR WAVELET 3.1 WAVELET Wavelet as a subject is highly interdisciplinary and it draws in crucial ways on ideas from the outside world. The working of wavelet in
More informationADAPTIVE LOW RANK AND SPARSE DECOMPOSITION OF VIDEO USING COMPRESSIVE SENSING
ADAPTIVE LOW RANK AND SPARSE DECOMPOSITION OF VIDEO USING COMPRESSIVE SENSING Fei Yang 1 Hong Jiang 2 Zuowei Shen 3 Wei Deng 4 Dimitris Metaxas 1 1 Rutgers University 2 Bell Labs 3 National University
More informationA Tool for Hierarchical Representation and Visualization of Time-Varying Data
A Tool for Hierarchical Representation and Visualization of Time-Varying Data Pak Chung Wong R. Daniel Bergeron pcw@cs.unh.edu rdb@cs.unh.edu Department of Computer Science University of New Hampshire
More informationSurface Approximation and Interpolation via Matrix SVD
Surface Approximation and Interpolation via Matrix SVD Andrew E. Long and Clifford A. Long Andy Long (longa@nku.edu) is at Northern Kentucky University. He received his Ph.D. in applied mathematics at
More informationWavelet based Keyframe Extraction Method from Motion Capture Data
Wavelet based Keyframe Extraction Method from Motion Capture Data Xin Wei * Kunio Kondo ** Kei Tateno* Toshihiro Konma*** Tetsuya Shimamura * *Saitama University, Toyo University of Technology, ***Shobi
More informationCHAPTER 3 DIFFERENT DOMAINS OF WATERMARKING. domain. In spatial domain the watermark bits directly added to the pixels of the cover
38 CHAPTER 3 DIFFERENT DOMAINS OF WATERMARKING Digital image watermarking can be done in both spatial domain and transform domain. In spatial domain the watermark bits directly added to the pixels of the
More informationMOST attention in the literature of network codes has
3862 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 8, AUGUST 2010 Efficient Network Code Design for Cyclic Networks Elona Erez, Member, IEEE, and Meir Feder, Fellow, IEEE Abstract This paper introduces
More informationInterval-Vector Polytopes
Interval-Vector Polytopes Jessica De Silva Gabriel Dorfsman-Hopkins California State University, Stanislaus Dartmouth College Joseph Pruitt California State University, Long Beach July 28, 2012 Abstract
More informationCOMPUTABILITY THEORY AND RECURSIVELY ENUMERABLE SETS
COMPUTABILITY THEORY AND RECURSIVELY ENUMERABLE SETS JOSHUA LENERS Abstract. An algorithm is function from ω to ω defined by a finite set of instructions to transform a given input x to the desired output
More informationA digital pretopology and one of its quotients
Volume 39, 2012 Pages 13 25 http://topology.auburn.edu/tp/ A digital pretopology and one of its quotients by Josef Šlapal Electronically published on March 18, 2011 Topology Proceedings Web: http://topology.auburn.edu/tp/
More informationImage coding based on multiband wavelet and adaptive quad-tree partition
Journal of Computational and Applied Mathematics 195 (2006) 2 7 www.elsevier.com/locate/cam Image coding based on multiband wavelet and adaptive quad-tree partition Bi Ning a,,1, Dai Qinyun a,b, Huang
More informationFractal Compression. Related Topic Report. Henry Xiao. Queen s University. Kingston, Ontario, Canada. April 2004
Fractal Compression Related Topic Report By Henry Xiao Queen s University Kingston, Ontario, Canada April 2004 Fractal Introduction Fractal is first introduced in geometry field. The birth of fractal geometry
More informationBlock-based Thiele-like blending rational interpolation
Journal of Computational and Applied Mathematics 195 (2006) 312 325 www.elsevier.com/locate/cam Block-based Thiele-like blending rational interpolation Qian-Jin Zhao a, Jieqing Tan b, a School of Computer
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationWinning Positions in Simplicial Nim
Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:
More informationRedundant Wavelet Filter Banks on the Half-Axis with Applications to Signal Denoising with Small Delays
Redundant Banks on the Half-Axis with Applications to Signal Denoising with Small Delays François Chaplais, Panagiotis Tsiotras and Dongwon Jung Abstract A wavelet transform on the negative half real axis
More informationMaple as an Instructional Tool
Maple as an Instructional Tool Terence A. Weigel 1 Abstract Computer algebra software such as Maple is an important component of the engineer s toolkit, much as are Matlib, MathCAD and Excel. However,
More informationOn the maximum rank of completions of entry pattern matrices
Linear Algebra and its Applications 525 (2017) 1 19 Contents lists available at ScienceDirect Linear Algebra and its Applications wwwelseviercom/locate/laa On the maximum rank of completions of entry pattern
More informationEvolved Multi-resolution Transforms for Optimized Image Compression and Reconstruction under Quantization
Evolved Multi-resolution Transforms for Optimized Image Compression and Reconstruction under Quantization FRANK W. MOORE Mathematical Sciences Department University of Alaska Anchorage CAS 154, 3211 Providence
More informationConstruction of fractional spline wavelet bases
Construction of fractional spline wavelet bases Michael Unser and Thierry Blu Biomedical Imaging Group, Swiss Federal Institute of Technology Lausanne DMT/IOA, BM 4.7 CH-5 Lausanne EPFL, Switzerland Email:
More informationWavelet Deblurring Algorithms for Spatially Varying Blur from High-Resolution Image Reconstruction Raymond H. Chan, Tony F. Chan y, Lixin Shen z, Zuow
Wavelet Deblurring Algorithms for Spatially Varying Blur from High-Resolution Image Reconstruction Raymond H. Chan, Tony F. Chan y, Lixin Shen z, Zuowei Shen z May 9, 003 Abstract High-resolution image
More informationMultiresolution Inverse Wavelet Reconstruction from a Fourier Partial Sum
City University of New York (CUNY) CUNY Academic Works Publications and Research Kingsborough Community College -200 Multiresolution Inverse Wavelet Reconstruction from a Fourier Partial Sum Nataniel Greene
More informationSecure Data Hiding in Wavelet Compressed Fingerprint Images A paper by N. Ratha, J. Connell, and R. Bolle 1 November, 2006
Secure Data Hiding in Wavelet Compressed Fingerprint Images A paper by N. Ratha, J. Connell, and R. Bolle 1 November, 2006 Matthew Goldfield http://www.cs.brandeis.edu/ mvg/ Motivation
More informationAlgorithmic Aspects of Acyclic Edge Colorings
Algorithmic Aspects of Acyclic Edge Colorings Noga Alon Ayal Zaks Abstract A proper coloring of the edges of a graph G is called acyclic if there is no -colored cycle in G. The acyclic edge chromatic number
More informationRigidity, connectivity and graph decompositions
First Prev Next Last Rigidity, connectivity and graph decompositions Brigitte Servatius Herman Servatius Worcester Polytechnic Institute Page 1 of 100 First Prev Next Last Page 2 of 100 We say that a framework
More informationHowever, m pq is just an approximation of M pq. As it was pointed out by Lin [2], more precise approximation can be obtained by exact integration of t
FAST CALCULATION OF GEOMETRIC MOMENTS OF BINARY IMAGES Jan Flusser Institute of Information Theory and Automation Academy of Sciences of the Czech Republic Pod vodarenskou vez 4, 82 08 Prague 8, Czech
More informationA Trimmed Translation-Invariant Denoising Estimator
A Trimmed Translation-Invariant Denoising Estimator Eric Chicken and Jordan Cuevas Florida State University, Tallahassee, FL 32306 Abstract A popular wavelet method for estimating jumps in functions is
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 informationOn the Construction of Linear Prewavelets over a Regular Triangulation.
East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 8-2002 On the Construction of Linear Prewavelets over a Regular Triangulation. Qingbo
More informationApproximation of a Fuzzy Function by Using Radial Basis Functions Interpolation
International Journal of Mathematical Modelling & Computations Vol. 07, No. 03, Summer 2017, 299-307 Approximation of a Fuzzy Function by Using Radial Basis Functions Interpolation R. Firouzdor a and M.
More informationA PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES
PACIFIC JOURNAL OF MATHEMATICS Vol. 46, No. 2, 1973 A PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES DAVID BARNETTE A d polytope is defined to be a cz-dimensional set that is the convex hull
More information