Approximate Query Processing Using Wavelets
|
|
- Anthony Welch
- 5 years ago
- Views:
Transcription
1 Approximate Query Processing Using Wavelets Kaushik Chakrabarti Minos Garofalakis Rajeev Rastogi Kyuseok Shim Presented by Guanghua Yan
2 Outline Approximate query processing: Problem and Prior solutions Another Solution wavelets Using wavelets to construct synopsis: 1D Haar Wavelets MultiD Haar Wavelets Construction of Synopsis Query processing in wavelets domain: Select Project Join Rendering the result Experimental Evaluation Conclusions 2
3 Why do we need Approximate Query Processing? Characteristics of DSS applications Huge Amount of Data(GB/TB) High Query Complexity Stringent responsetime requirement EXACT answer NOT always required Data Warehouse (GB/TB) Exploratory nature of DSS applications Aggregate query : Precision to penny?no Fast, approximate answer is preferable Approximate Query Processing Approximate answers Quick response SQL Query Exact Answers Problem: Long Response Time 3
4 How does Approximate Query Processing work? Data Warehouse (GB/TB) Construct Compact Relations (in advance) Compact Relations (MB) SQL Query Transformation Algebra Transformed SQL Query Fast Response Times Approximate Answers 4
5 Previous Work Construct compact relations using: Random Sampling (AQUA system) accurate for aggregate queries(count, SUM, AVG) not suitable when joins are involved (too few tuples) not suitable for nonaggregate queries Histograms (Ioannidis and Poosala) effectiveness at high dimensions is unclear construction is costly (And Storage, dimensionality curse) needs to expand for joins(join makes the Dim even higher) Wavelets (Vitter and Wang) effective for aggregate queries even at high dimensions limited in query processing scope (only rangesum queries) 5
6 Overview of the work in this paper Construct compact synopsis of interesting tables using multiresolution wavelet decomposition (done in advance) fast, takes just a single pass over the relation in the best case, otherwise logarithmic passes SQL queries are answered by working just on the compact relations i.e. entirely in the wavelet (compressed) domain fast response times results converted back to relational domain (rendering) at the end all types of queries supported: aggregate, nonaggregate Fast, accurate, general 6
7 Overview of the work the big picture Data Warehouse (GB/TB) Construct Compact Relations (in advance) Compact Relations (MB) Step 1 SQL Query Result Relation Transformation Algebra Step 2 Query Result Rendering (If needed) Step 3 Transformed SQL Query Fast Response Times Approximate Answers 7
8 Step1 : Construct synopsis with wavelets decomposition 1D Haar Wavelets MultiD Haar Wavelets Construction of Synopsis 8
9 What s decomposition? Vector Decomposition V = (1, 2, 3, 4) V = 1 * (1, 0, 0, 0) 2 * (0, 1, 0, 0) 3 * (0, 0, 1, 0) 4 * (0, 0, 0, 1) Basis Vectors 1, 2, 3, 4 called coefficients. b1 = (1, 0, 0, 0) called basis vector 3 = (1, 2, 3, 4) * (0, 0, 1, 0) Orthogonal : Given two basis vectors b i & b j No redundancy, regular, easy to reconstruct P dot = b i * b j = 1 i = j 0 otherwise Looks useless(from (1, 2, 3, 4) to (1, 2, 3, 4)) except the idea of decomp. 9
10 What s decomposition? Idea of Decomposition Fix a set of basis Compute a set of coefficients Multiplying the original data by one basis gives us one coefficient Dot product vs. Inner product # of basis = # of coefficients = # of elements(original data) Represent the original data(or function) by a set of coefficients in terms of a set of basis Motivation Find new features of data (Fourier) Compress data (Wavelets in this paper) The original data could be reconstructed (Easy for orthogonal basis) Multiply the coefficient by the corresponding basis Sum up all the products 10
11 What s decomposition? Function Decomposition Fourier Transformation and Inverse Trans. Basis functions Basis functions : cosine and sine functions. Widely used in Engineering Problem : 1. Losing time resolution, good for periodic signal 2. Basis functions fixed 11
12 What s decomposition? Wavelets Decomposition Share the idea with Fourier Transformation Time resolution added Wavelets function (Mother Wavelets) Basis functions Basis functions scaled & shifted version of mother wavelets Orthogonal Vanishing moments, Compact support, Regularity Wavelet decomposition generates compact representations that exploit the local structure of the function Wavelets decomposition Scaling function & wavelets function Problem : What wavelets decomposition to use? (Haar, CDF(2, X), CDF(3, X), Daubechies series) 12
13 Background on Wavelets: 1d Haar Wavelets Why Haar Wavelets? Simplest wavelets function Fast to compute( averaging & differencing ) Performing well in practice(image Compression) What does Haar Wavelets look like? First Example Blue : Original or average coefficient Red : Detail coefficient
14 Haar Wavelets functions Scaling function ( Father Wavelets) h 0 (t) = 1 t in [0, 1] 0 otherwise Scaling Scaled & Shifted Scaled Scaled & Shifted Wavelets function ( Mother Wavelets) Wavelets Scaled & Shifted Scaled t in [0, ½] h 0 (t) = 1 t in [½, 1] 0 otherwise Scaled & Shifted 14
15 1d Haar basis functions (Daughter Wavelets) Scaled and shifted version of mother wavelets h : (1,1, 1, 1, 1, 1, 1, 1) h1 : (1,1, 1, 1, 1, 1, 1, 1) h2 : (1,1, 1, 1, 0, 0, 0, 0) h3 : (0,0, 0, 0, 1, 1, 1, 1) Scaling function Wavelets function h4 : (1,1, 0, 0, 0, 0, 0, 0) h5 : (0,0, 1, 1, 0, 0, 0, 0) h6 : (0,0, 0, 0, 1, 1, 0, 0) h7 : (0,0, 0, 0, 0, 0, 1, 1) Set of basis functions(complete decomp.) for signal S of length 8 Vector below each basis function is a sampling of the basis function Multiply S by each basis will give each coefficient(result : 8 coefficients) Connection with the First Example
16 Compute 1d Haar wavelets decomp. By linear algebra Decomp. Matrix M a ( Collecting the 8 basis vectors, put each one as a column) Dot product of any two columns is ZERO Normalizing each column is easy Decomp.(Complete) Given any signal S of length 8 Multiplying S by M a gives the wavelets decomp. Y = S * M a Ma = Decomp. Matrix Reconstruction Make M a orthogonal (M a 1 = M a T ) S = Y * M a 1 = Y * M a T 16
17 Compute 1d Haar wavelets decomp. Scale by scale Decomposition Pair wise averaging and differencing [One scale decomposition] Distribution, put average(approximate coefficient) together and put difference(detail coefficient) together Repeat above on average until only one average number left [Recursive, Complete decomposition] Result : Last average all detail coefficients Reconstruction Exactly the inverse of decomposition 17
18 How does 1d Haar Wavelet work? Example Blue : Original or average coefficient Red : Detail coefficient Decomposition ( logn steps needed ) 3 Steps are used to do the complete decomposition Reconstruction Exact inverse of the above process 18
19 Where s the compression and Approximate? Thresholding Set a threshold value C Replace those wavelet coefficients whose absolute value less than C with ZERO More zero in the wavelet coefficients Compression store ONLY nonzero The more similar data we have, the more compression we get How much does this influence the original data? Row 1 : original data Row 2 : coefficients Row 3 : Reconstructed data Threshold C = Threshold C =
20 Haar wavelets compression and approximate Threshold C = Threshold C = Blue line : Original signal Red line : Reconstructed signal 20
21 Background on Wavelets: Multid Haar Wavelets Data cube has multi dimensions(of equallength) Standard decomposition Nonstandard decomposition Standard decomposition Fix an ordering for the data dimensions, say 1, 2,, d For each dimension k, fix other (d1) dimensions, we get an 1D row vector Perform complete 1D Haar wavelet decomposition on the ID vector Repeat the last two steps in the order fixed in step 1 Nonstandard decomposition Fix an ordering for the data dimensions, say 1, 2,, d In this order for each dimension, perform one scale of 1D Haar decomp Collect the averages together, repeat the last step on the averages Conceptualizing : using a hyperbox of size 2 X 2 X 2 X 2( = 2 d ) 21
22 Multid Haar Wavelets (nonstandard) c d One step along Dim 1 (x axis) ( c d ) / 2 ( c d ) / 2 a b ( a b ) / 2 ( a b ) / 2 rebuilding One step along Dim 2 (y axis) S = ( ( a b ) / 2 ( c d)/ 2 ) / 2 = ( a b c d ) / 4 a = S d1 d2 d3 d1, d2, d3 b = S d2 d1 d3 c = S d1 d2 d3 d 2 d 3 d = S d3 d1 d2 s d 1 Wavelets Coefficients S = (a b c d) / 4 d1 = (a c b d) / 4 d2 = (a b c d) / 4 d3 = (a d c d) / 4 22
23 Multid Haar Wavelets Example Bad Position 23
24 Multid Haar Coefficients: Semantics and Representation Question : What s the contribution of each coefficient (W) in rebuilding the data array?how to store a coefficient? Answer : W = <R, S, v> R : ddimensional support hyperrectangle of W S : sign information for all ddimensional cells of W.R V : magnitude of the coefficient of W R & S only depends on Haar basis function V depends on the original data 24
25 Multid Haar Coefficients: Semantics and Representation 3 A :2D Data Array Wa: Wavelet Coefficients W = Wa[1, 2] W.v = 2 W.R.bound[1].lo = 2 W.R.bound[1].hi = 3 W.R.bound[2].lo = 0 W.R.bound[2].hi = 1 W.S.sign[1].lo = W.S.sign[1].hi = W.S.sign[2].lo = W.S.sign[2].hi = W.S.schg[1] = 2 W.S.schg[2] = 1 A[0,1] = Wa[0,0]Wa[0,1]Wa[1,0]Wa[1,1]Wa[0,2]Wa[2,0]Wa[2,2]=2.5(1)(.5) = 3 25
26 Notation used in the paper 26
27 Construction of Compact Relations: Wavelet decomposition of JFD Matrix Relation (Numeric Attributes) Joint Frequency Distribution (JFD) Matrix 27
28 Thresholding Retain the k coefficients with largest absolute value after normalization Minimizes overall mean squared error The set of coefficients retained after thresholding is the waveletcoefficient synopsis All SQL queries will be on the synopsis 28
29 Summary of Step1 Wavelets Decomp. & Construction of synopsis 1D Haar wavelets Decomp. Simple & fast to compute Pair wise averaging & differencing Recursive fashion MD Haar wavelets Decomp. Nonstandard extension Alternate between dimensions Thresholding Thresholding smallest coefficients Lossy data compression approximation How to store coefficients Semantics of the notations W = (R, S, v) SQL will be on coefficients 29
30 Query Processing(Step 2) Entire processing in compressed (wavelet) domain Querying in Wavelet Domain Query Results in Wavelet Domain Compressed domain (FAST) Render Wavelet Synopses Final Approximate Results Relation domain (SLOW) Render Approximate Relations Querying in Relation Domain 30
31 Query Processing Set of tuples Each operator (e.g., select, project, join, aggregates etc.) input: set of coefficients render Set of coeffs output: set of coefficients Finally, rendering step join input: set of coefficients output: (multi)set of tuples Questions How to map query algebra? Can we maintain the semantics of the coefficients? project select Set of coeffs select Set of coeffs 31
32 Query algebra mapping Selection : Definition Select pred (W T ) ; T is a ddimensional relation W T is T s wavelets synopsis Pred = ( l i 1 D i1 h i1 ) ^ ^ (l ik D ik h ik ) Kdimensional range selection Range defined for k dimensions, D = {D i 1, D i2,, D ik } Range unspecified for remaining (d k) dimensions : 0 X D x Example 32
33 Query algebra mapping Selection : example Dim. D JFD Matrix 4 Dim. D Query Range Dim D1 (Attr1) Dim D2 (Attr2) Count D 1 : (0, 7) D 2 : (0, 7) Pred = (1 D 1 4 ) ^ ( 2 D 2 6 ) D = { D 1, D 2 } In relation domain, interested in only those cells inside query range In wavelet domain, interested in only the coefficients that contribute to those cells 33
34 Query algebra mapping Selection : Mapping 1. For each W in W T do 2. If for every D i in D /* Check overlapping */ j l i j W.R.bound[i i].lo h i j or W.R.bound[i i ].lo l i j W.R.bound[i i].hi then goto 3 else goto 5 3. For all D i in D do j set /* Overlapping area is the new hyperrectangle*/ W.R.bound[i i ].lo := max{l i, W.R.bound[i j i ].lo} W.R.bound[i i ].hi := min {h, i j W.R.bound[i i ].hi} if W.R.bound[i i ].hi < W.R.schg[i i ] then set /* no sign change any more */ W.S.schg[i i ] := W.R.bound[i i ].lo W.S.sign[i i ] := [W.S.sign[i i ]. lo, W.S.sign[i i ]. lo] elseif W.R.bound[i i ].lo W.S.schg[i i ] then set /* no sign change any more */ W.S.schg[i i ] := W.R.bound[i i ].lo W.S.sign[i i ] := [W.S.sign[i i ].hi, W.S.sign[i i ].hi] 4. Output updated W, W s = W s W 5. Goto 1, select next W D1 D1 W4 W4 Query Range W3 W3 W2 W2 W1 D2 D2 34
35 Query algebra mapping Projection : Definition Project X i 1, Xi 2,, Xi k (W T ) ; T is a ddimensional relation W T is T s wavelets synopsis X i 1,,X i2,, X are the set of attributes we are interested ik Remaining (dk) dimensions will be projected out Project out (dk) dimensions one by one Example 35
36 Query algebra mapping Projection : example Retain this dim. (D1) JFD Matrix Eliminate this dimension (D2) Result of projection Dim D1 (Attr1) Dim D2 (Attr2) Dim D1 (Attr1) 6 9 Project Count Count D 1 is to be retained, D 2 will be projected out In relation domain, sum elements in each row along eliminated dimension In wavelet domain, sum the contribution of coefficient along eliminated dimension 36
37 Query algebra mapping Projection : Mapping D1 X D1 Project on D1 X1 X2 W2 W 1.v = X * W 1.v W 2.v =( X2 X1 )* W 1.v W1 D2 1. For each D j in D (To be projected out) 2. For every W in W T do 2.1 Set W.v = W.v * P j where P j equals to (W.R.bound[j].hi W.S.schg[j] 1) * W.S.sign[j].hi (W.S.schg[j] W.R.bound[j].lo) * W.R.bound[j].lo 2.2 Discard dimension D j (Hyperrectangle and sign) from W 3. Goto 1, select next D j In Step 2, by summing up the contributions of W along D j, we are projecting out D j In a word we can simply do for each W W2 W.v := W.v * PROD Dj in D D P j Discard dimensions D D 37
38 Query algebra mapping EquiJoin : Definition Join pred (W T1,W T2 ) Dim(T 1 ) = d 1, Dim(T 2 ) = d 2 wavelets synopsis(t 1 ) = W T1, wavelets synopsis(t 2 ) = W T2 Pred = ( X 11 = X 2 1 ) ^ ^ ( X 1k = X 2k ) Pred is of kdim, k d 1 && k d 2 WLOG, assume they are the first k dimensions of both T 1 and T 2 Let D = (D 1, D 2,, D k ) Dimension of Result would be ( d 1 d 2 k ) Example 38
39 Query algebra mapping EquiJoin : example These two cells have the same value on D1 7 JFD Matrix of Relation1 Dim. D2 Join Dimension D1 JFD Matrix of Relation2 In relation domain, join count = 7*3 In wavelet domain, consider all pairs of coefficients and check joinability (and compute new coefficients) 3 Dim. D3 Dim D1 (Attr1) 6 Dim D1 (Attr1) Dim D2 (Attr2) Dim D3 (Attr3) Count Dim D1 (Attr1) Relation1 Relation2 Count Join along D1 Dim D2 (Attr2) Dim D3 (Attr3) Count 39
40 Query algebra mapping EquiJoin : example Case 1 : no overlapping Output nothing Case 2: Overlapping Cell A(X 1, X 2 ) and Cell B(X 1, X 3 ) W 11 and W 12 cover A (W 12 not shown) W 21 and W 22 cover B (W 22 not shown) Calculate join result for (X 1, X 2, X 3 ) (W 11.v W 12.v) * (W 21.v W 22.v) = W 11.v * W 21.v W 11.v * W 22.v W 12.v * W 21.v W 12.v * W 22.v Consider each coefficient pair Join range along any dimension can contain at most one true sign change due to the complete containment property of the Haar wavelets decomposition X1 D1 D1 Join Dimension D1 D1 W11 D2 D2 D1 A(X1, X2) B(X1, X3) D3 NOTHING W.v =W11.v*W21.v W21 W21 W11 X2 X3 D3 40
41 EquiJoin : Mapping 1. For each pair (W 1,W 2 ) W 1 in W T1 && W 2 in W T2 do 2. If for every D i in D /* 2. Check overlapping in the k join dimensions*/ If ( W 1.R.bound[i].lo W 2.R.bound[i].lo W 1.R.bound[i].hi ) OR ( W 2.R.bound[i].lo W 1.R.bound[i].lo W 2.R.bound[i].hi ) then goto 3 else goto 7 3. For each join dimension D i in D do /* 3,4,5,6 build a new coefficient on join range */ 1.1 set W.R.bound[i].lo := max{w 1.R.bound[i].lo, W 2.R.bound[i].lo} /* set join boundary */ W.R.bound[i].hi := min {W 1.R.bound[i].hi, W 2.R.bound[i].hi} 1.2 For j = 1, 2 /*Let S j be a temporary signvector variable*/ /* compute sign info */ if W.R.bound[i].hi < W j.s.schg[i] then S j := [W j.s.sign[i].lo, W j.s.sign[i].lo]; elseif W.R.bound[i].lo W j.s.schg[i] then S j := [W j.s.sign[i].hi, W j.s.sign[i].hi]; else set S j := W j.s.sign[i]; 1.3 Set W.S.sign[i] := [S 1.lo * S 2.lo, S 1.hi * S 2.hi]; 1.4 If W.S.sign[i].lo == W.S.sign[i].hi then set W.S.schg[i] := W.R.bound[i].lo 1.5 else set W.S.schg[i] := max j=1,2 {W j.s.schg[i] : W j.s.schg[i] in [W.R.bound[i].lo, W.R.bound[i].hi] } 4. For each nonjoin dimension D i, i = k 1,, d 1 do /* 4,5 inherit nonjoin dimensions */ set W.R.bound[i] := W 1.R.bound[i], W.S.sign[i] := W 1.S.sign[I], W.S.schg[i] := W 1.S.schg[i] 5. For each nonjoin dimension D i, i = d 1 1,, d 1 d 2 k do set W.R.bound[i] := W 2.R.bound[i d 1 k], W.S.sign[i] := W 2.S.sign[i d1 k], W.S.schg[i] := W 2.S.schg[i d1 k] 6. Set W.v : = W 1.v * W 2.v and output W, Ws = Ws W 7. Goto 1, select another pair 41
42 Query algebra mapping EquiJoin : example D1 Join Dimension D1 D1 NOTHING D2 D3 D1 D1 val = val1*val2 D2 D3 42
43 Query algebra mapping EquiJoin : example D1 D1 val = D2 D3 val1*val2 D1 D1 val = D2 D3 val1*val2 43
44 Summary of Step2 Query algebra mapping(only nonaggregate) Selection Update those wavelets coefficients whose hyperrectangle overlapping the selection range Projection Sum up all wavelets coefficients along all dimensions to be projected out Join Create new wavelets coefficients Hyperrectangle equals to the join range plus nonjoin dimensions Compute sign information Results need to be rendered Output of above queries are wavelets coefficients Need to be converted to database relation 44
45 Rendering(Step 3) Go back from wavelets domain to database relations Semantics of wavelets coefficients unchanged Range, Sign, Signchange, Magnitude Inverse wavelets decomposition is easy Sum up the contributions of all coefficients to each cell 45
46 Experimental Results Compare waveletsbased technique With sampling and histograms In terms of efficiency and accuracy Measuring accuracy (Error Metrics) Aggregate : Absolute relative error Nonaggregate : EMD error Query types SELECT, SELECTSUM, SELECTJOIN, SELECTJOINSUM 46
47 Datasets and Queries Synthetic data set Real data set: CENSUS Population Survey ( & d data: age (017), education level (046), income (041), hrs/week (013) JFD Matrix size: 2 million cells( 32 * 64 * 64 * 16) Relation sizes (2 relations) ~ 16,000 Density ~ Queries: Selects: 5 age < 10 ^ 10 income < 15, selectivity ~ 6% Joins: join age on 1992 and 1994 data Sum : sum on age 47
48 Query Execution Time TwoD synthetic data set used Running time on base relation is 3.6 seconds (Enough memory used) Sampling is not counted here Giving too less tuples of join Wavelets runs faster (than Histograms) More than two orders of magnitude Histograms expanded to generate tuplevalue distribution Wavelets expanded at the very end 48
49 Query Execution Accuracy 49
50 Query Execution Accuracy 50
51 Conclusion Wavelets are an effective tool for general purpose approximate query answering fast query processing (entirely in wavelet (compressed) domain) low synopsis construction cost high accuracy even at high dimensions can handle all types of queries 51
Wavelets. Lecture 28
Wavelets. Lecture 28 Just like the FFT, the wavelet transform is an operation that can be performed in a fast way. Operating on an input vector representing a sampled signal, it can be viewed, just like
More informationInformation Management course
Università degli Studi di Milano Master Degree in Computer Science Information Management course Teacher: Alberto Ceselli Lecture 03 : 09/10/2013 Data Mining: Concepts and Techniques (3 rd ed.) Chapter
More informationWavelets for Efficient Querying of Large Multidimensional Datasets
Wavelets for Efficient Querying of Large Multidimensional Datasets Cyrus Shahabi University of Southern California Integrated Media Systems Center (IMSC) and Dept. of Computer Science Los Angeles, CA 90089-0781
More informationNoise & Data Reduction
Noise & Data Reduction Andreas Wichert - Teóricas andreas.wichert@inesc-id.pt 1 Paired Sample t Test Data Transformation - Overview From Covariance Matrix to PCA and Dimension Reduction Fourier Analysis
More informationSingular Value Decompsition
Singular Value Decompsition Massoud Malek One of the most useful results from linear algebra, is a matrix decomposition known as the singular value decomposition It has many useful applications in almost
More informationWavelet decomposition of data streams. by Dragana Veljkovic
Wavelet decomposition of data streams by Dragana Veljkovic Motivation Continuous data streams arise naturally in: telecommunication and internet traffic retail and banking transactions web server log records
More informationImage Compression. 1. Introduction. Greg Ames Dec 07, 2002
Image Compression Greg Ames Dec 07, 2002 Abstract Digital images require large amounts of memory to store and, when retrieved from the internet, can take a considerable amount of time to download. The
More informationWavelets and Multiresolution Processing
Wavelets and Multiresolution Processing Wavelets Fourier transform has it basis functions in sinusoids Wavelets based on small waves of varying frequency and limited duration In addition to frequency,
More informationImage Compression Using the Haar Wavelet Transform
College of the Redwoods http://online.redwoods.cc.ca.us/instruct/darnold/laproj/fall2002/ames/ 1/33 Image Compression Using the Haar Wavelet Transform Greg Ames College of the Redwoods Math 45 Linear Algebra
More informationA First Course in Wavelets with Fourier Analysis
* A First Course in Wavelets with Fourier Analysis Albert Boggess Francis J. Narcowich Texas A& M University, Texas PRENTICE HALL, Upper Saddle River, NJ 07458 Contents Preface Acknowledgments xi xix 0
More informationLet p 2 ( t), (2 t k), we have the scaling relation,
Multiresolution Analysis and Daubechies N Wavelet We have discussed decomposing a signal into its Haar wavelet components of varying frequencies. The Haar wavelet scheme relied on two functions: the Haar
More informationCS 347 Parallel and Distributed Data Processing
CS 347 Parallel and Distributed Data Processing Spring 2016 Notes 3: Query Processing Query Processing Decomposition Localization Optimization CS 347 Notes 3 2 Decomposition Same as in centralized system
More informationDiscrete Wavelet Transform
Discrete Wavelet Transform [11] Kartik Mehra July 2017 Math 190s Duke University "1 Introduction Wavelets break signals up and then analyse them separately with a resolution that is matched with scale.
More informationOn the Optimality of the Greedy Heuristic in Wavelet Synopses for Range Queries
On the Optimality of the Greedy Heuristic in Wavelet Synopses for Range Queries Yossi Matias School of Computer Science Tel Aviv University Tel Aviv 69978, Israel matias@tau.ac.il Daniel Urieli School
More informationWavelets For Computer Graphics
{f g} := f(x) g(x) dx A collection of linearly independent functions Ψ j spanning W j are called wavelets. i J(x) := 6 x +2 x + x + x Ψ j (x) := Ψ j (2 j x i) i =,..., 2 j Res. Avge. Detail Coef 4 [9 7
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 12 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted for noncommercial,
More informationContents. Acknowledgments
Table of Preface Acknowledgments Notation page xii xx xxi 1 Signals and systems 1 1.1 Continuous and discrete signals 1 1.2 Unit step and nascent delta functions 4 1.3 Relationship between complex exponentials
More informationWavelet Transform. Figure 1: Non stationary signal f(t) = sin(100 t 2 ).
Wavelet Transform Andreas Wichert Department of Informatics INESC-ID / IST - University of Lisboa Portugal andreas.wichert@tecnico.ulisboa.pt September 3, 0 Short Term Fourier Transform Signals whose frequency
More informationSparse linear models
Sparse linear models Optimization-Based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_spring16 Carlos Fernandez-Granda 2/22/2016 Introduction Linear transforms Frequency representation Short-time
More informationModule 4 MULTI- RESOLUTION ANALYSIS. Version 2 ECE IIT, Kharagpur
Module 4 MULTI- RESOLUTION ANALYSIS Lesson Theory of Wavelets Instructional Objectives At the end of this lesson, the students should be able to:. Explain the space-frequency localization problem in sinusoidal
More informationLecture Notes 5: Multiresolution Analysis
Optimization-based data analysis Fall 2017 Lecture Notes 5: Multiresolution Analysis 1 Frames A frame is a generalization of an orthonormal basis. The inner products between the vectors in a frame and
More information1 Approximate Quantiles and Summaries
CS 598CSC: Algorithms for Big Data Lecture date: Sept 25, 2014 Instructor: Chandra Chekuri Scribe: Chandra Chekuri Suppose we have a stream a 1, a 2,..., a n of objects from an ordered universe. For simplicity
More informationAn Introduction to Wavelets
1 An Introduction to Wavelets Advanced Linear Algebra (Linear Algebra II) Heng-Yu Lin May 27 2013 2 Abstract With the prosperity of the Digital Age, information is nowadays increasingly, if not exclusively,
More information( nonlinear constraints)
Wavelet Design & Applications Basic requirements: Admissibility (single constraint) Orthogonality ( nonlinear constraints) Sparse Representation Smooth functions well approx. by Fourier High-frequency
More informationImproving Retrieval Cost by Choosing the Best Wavelet Decomposition for Multidimensional Datasets
Improving Retrieval Cost by Choosing the Best Wavelet Decomposition for Multidimensional Datasets Dimitris Sacharidis, Cyrus Shahabi, Huseyin Balli, Andreas Xeros, Antonio Ortega University of Southern
More informationAnalysis of Fractals, Image Compression and Entropy Encoding
Analysis of Fractals, Image Compression and Entropy Encoding Myung-Sin Song Southern Illinois University Edwardsville Jul 10, 2009 Joint work with Palle Jorgensen. Outline 1. Signal and Image processing,
More informationPulse characterization with Wavelet transforms combined with classification using binary arrays
Pulse characterization with Wavelet transforms combined with classification using binary arrays Overview Wavelet Transformation Creating binary arrays out of and how to deal with them An estimator for
More information1 Introduction to Wavelet Analysis
Jim Lambers ENERGY 281 Spring Quarter 2007-08 Lecture 9 Notes 1 Introduction to Wavelet Analysis Wavelets were developed in the 80 s and 90 s as an alternative to Fourier analysis of signals. Some of the
More informationLinear Algebra and Eigenproblems
Appendix A A Linear Algebra and Eigenproblems A working knowledge of linear algebra is key to understanding many of the issues raised in this work. In particular, many of the discussions of the details
More informationMultimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig
Multimedia Databases Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 4 Previous Lecture Texture-Based Image Retrieval Low
More informationMultimedia Databases. Previous Lecture. 4.1 Multiresolution Analysis. 4 Shape-based Features. 4.1 Multiresolution Analysis
Previous Lecture Multimedia Databases Texture-Based Image Retrieval Low Level Features Tamura Measure, Random Field Model High-Level Features Fourier-Transform, Wavelets Wolf-Tilo Balke Silviu Homoceanu
More informationWavelets in Scattering Calculations
Wavelets in Scattering Calculations W. P., Brian M. Kessler, Gerald L. Payne polyzou@uiowa.edu The University of Iowa Wavelets in Scattering Calculations p.1/43 What are Wavelets? Orthonormal basis functions.
More informationImage Compression by Using Haar Wavelet Transform and Singular Value Decomposition
Master Thesis Image Compression by Using Haar Wavelet Transform and Singular Value Decomposition Zunera Idrees 9--5 Eliza Hashemiaghjekandi 979-- Subject: Mathematics Level: Advance Course code: 4MAE Abstract
More informationWolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig
Multimedia Databases Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 14 Indexes for Multimedia Data 14 Indexes for Multimedia
More informationRevised Simplex Method
DM545 Linear and Integer Programming Lecture 7 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 2 Motivation Complexity of single pivot operation
More informationCorrelated subqueries. Query Optimization. Magic decorrelation. COUNT bug. Magic example (slide 2) Magic example (slide 1)
Correlated subqueries Query Optimization CPS Advanced Database Systems SELECT CID FROM Course Executing correlated subquery is expensive The subquery is evaluated once for every CPS course Decorrelate!
More informationL. Yaroslavsky. Fundamentals of Digital Image Processing. Course
L. Yaroslavsky. Fundamentals of Digital Image Processing. Course 0555.330 Lec. 6. Principles of image coding The term image coding or image compression refers to processing image digital data aimed at
More informationThe Haar Wavelet Transform: Compression and Reconstruction
and Reconstruction December 13, 2006 Have you ever looked at an image on your computer? Of course you have. Images today aren t just stored on rolls of film. Most images today are stored or compressed
More informationThe Structure of Digital Imaging: The Haar Wavelet Transform. Wavelet Transformation and Image Compression
The Structure of Digital Imaging: The Haar Wavelet Transformation and Image Compression December 7, 2009 Abstract The Haar wavelet transform allows images to be compressed and sent over a network of computers
More information2.6 Complexity Theory for Map-Reduce. Star Joins 2.6. COMPLEXITY THEORY FOR MAP-REDUCE 51
2.6. COMPLEXITY THEORY FOR MAP-REDUCE 51 Star Joins A common structure for data mining of commercial data is the star join. For example, a chain store like Walmart keeps a fact table whose tuples each
More informationMultimedia Databases. 4 Shape-based Features. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis
4 Shape-based Features Multimedia Databases Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 4 Multiresolution Analysis
More informationWavelets in Image Compression
Wavelets in Image Compression M. Victor WICKERHAUSER Washington University in St. Louis, Missouri victor@math.wustl.edu http://www.math.wustl.edu/~victor THEORY AND APPLICATIONS OF WAVELETS A Workshop
More informationModule 7:Data Representation Lecture 35: Wavelets. The Lecture Contains: Wavelets. Discrete Wavelet Transform (DWT) Haar wavelets: Example
The Lecture Contains: Wavelets Discrete Wavelet Transform (DWT) Haar wavelets: Example Haar wavelets: Theory Matrix form Haar wavelet matrices Dimensionality reduction using Haar wavelets file:///c /Documents%20and%20Settings/iitkrana1/My%20Documents/Google%20Talk%20Received%20Files/ist_data/lecture35/35_1.htm[6/14/2012
More informationLearning goals: students learn to use the SVD to find good approximations to matrices and to compute the pseudoinverse.
Application of the SVD: Compression and Pseudoinverse Learning goals: students learn to use the SVD to find good approximations to matrices and to compute the pseudoinverse. Low rank approximation One
More informationMULTIRATE DIGITAL SIGNAL PROCESSING
MULTIRATE DIGITAL SIGNAL PROCESSING Signal processing can be enhanced by changing sampling rate: Up-sampling before D/A conversion in order to relax requirements of analog antialiasing filter. Cf. audio
More informationWavelets Marialuce Graziadei
Wavelets Marialuce Graziadei 1. A brief summary 2. Vanishing moments 3. 2D-wavelets 4. Compression 5. De-noising 1 1. A brief summary φ(t): scaling function. For φ the 2-scale relation hold φ(t) = p k
More informationSHIFT-SPLIT: I/O Efficient Maintenance of Wavelet-Transformed Multidimensional Data
SHIFT-SPLIT: I/O Efficient aintenance of Wavelet-Transformed ultidimensional Data ehrdad Jahangiri University of Southern California Los Angeles, CA 90089-0781 jahangir@usc.edu Dimitris Sacharidis ational
More informationWavelets in Pattern Recognition
Wavelets in Pattern Recognition Lecture Notes in Pattern Recognition by W.Dzwinel Uncertainty principle 1 Uncertainty principle Tiling 2 Windowed FT vs. WT Idea of mother wavelet 3 Scale and resolution
More informationAn Introduction to Wavelets and some Applications
An Introduction to Wavelets and some Applications Milan, May 2003 Anestis Antoniadis Laboratoire IMAG-LMC University Joseph Fourier Grenoble, France An Introduction to Wavelets and some Applications p.1/54
More informationDot-Product Join: Scalable In-Database Linear Algebra for Big Model Analytics
Dot-Product Join: Scalable In-Database Linear Algebra for Big Model Analytics Chengjie Qin 1 and Florin Rusu 2 1 GraphSQL, Inc. 2 University of California Merced June 29, 2017 Machine Learning (ML) Is
More informationSparse linear models and denoising
Lecture notes 4 February 22, 2016 Sparse linear models and denoising 1 Introduction 1.1 Definition and motivation Finding representations of signals that allow to process them more effectively is a central
More informationIntroduction to Data Mining
Introduction to Data Mining Lecture #21: Dimensionality Reduction Seoul National University 1 In This Lecture Understand the motivation and applications of dimensionality reduction Learn the definition
More informationThe Haar Wavelet Transform: Compression and. Reconstruction
The Haar Wavelet Transform: Compression and Damien Adams and Halsey Patterson December 14, 2006 Abstract The Haar Wavelet Transformation is a simple form of compression involved in averaging and differencing
More informationWavelet Filter Transforms in Detail
Wavelet Filter Transforms in Detail Wei ZHU and M. Victor WICKERHAUSER Washington University in St. Louis, Missouri victor@math.wustl.edu http://www.math.wustl.edu/~victor FFT 2008 The Norbert Wiener Center
More informationWavelets and Image Compression. Bradley J. Lucier
Wavelets and Image Compression Bradley J. Lucier Abstract. In this paper we present certain results about the compression of images using wavelets. We concentrate on the simplest case of the Haar decomposition
More informationIntroduction to statistics
Introduction to statistics Literature Raj Jain: The Art of Computer Systems Performance Analysis, John Wiley Schickinger, Steger: Diskrete Strukturen Band 2, Springer David Lilja: Measuring Computer Performance:
More informationCSE 494/598 Lecture-6: Latent Semantic Indexing. **Content adapted from last year s slides
CSE 494/598 Lecture-6: Latent Semantic Indexing LYDIA MANIKONDA HT TP://WWW.PUBLIC.ASU.EDU/~LMANIKON / **Content adapted from last year s slides Announcements Homework-1 and Quiz-1 Project part-2 released
More informationCSE 344 AUGUST 6 TH LOSS AND VIEWS
CSE 344 AUGUST 6 TH LOSS AND VIEWS ADMINISTRIVIA WQ6 due tonight HW7 due Wednesday DATABASE DESIGN PROCESS Conceptual Model: name product makes company price name address Relational Model: Tables + constraints
More informationMultiresolution Analysis
Multiresolution Analysis DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_fall17/index.html Carlos Fernandez-Granda Frames Short-time Fourier transform
More informationTopics in Probabilistic and Statistical Databases. Lecture 9: Histograms and Sampling. Dan Suciu University of Washington
Topics in Probabilistic and Statistical Databases Lecture 9: Histograms and Sampling Dan Suciu University of Washington 1 References Fast Algorithms For Hierarchical Range Histogram Construction, Guha,
More informationNiklas Grip, Department of Mathematics, Luleå University of Technology. Last update:
Some Essentials of Data Analysis with Wavelets Slides for the wavelet lectures of the course in data analysis at The Swedish National Graduate School of Space Technology Niklas Grip, Department of Mathematics,
More informationProyecto final de carrera
UPC-ETSETB Proyecto final de carrera A comparison of scalar and vector quantization of wavelet decomposed images Author : Albane Delos Adviser: Luis Torres 2 P a g e Table of contents Table of figures...
More informationIntroduction to Wavelets and Wavelet Transforms
Introduction to Wavelets and Wavelet Transforms A Primer C. Sidney Burrus, Ramesh A. Gopinath, and Haitao Guo with additional material and programs by Jan E. Odegard and Ivan W. Selesnick Electrical and
More informationThe New Graphic Description of the Haar Wavelet Transform
he New Graphic Description of the Haar Wavelet ransform Piotr Porwik and Agnieszka Lisowska Institute of Informatics, Silesian University, ul.b dzi ska 39, 4-00 Sosnowiec, Poland porwik@us.edu.pl Institute
More informationNontechnical introduction to wavelets Continuous wavelet transforms Fourier versus wavelets - examples
Nontechnical introduction to wavelets Continuous wavelet transforms Fourier versus wavelets - examples A major part of economic time series analysis is done in the time or frequency domain separately.
More informationCSE 5243 INTRO. TO DATA MINING
CSE 5243 INTRO. TO DATA MINING Data & Data Preprocessing Huan Sun, CSE@The Ohio State University Slides adapted from UIUC CS412, Fall 2017, by Prof. Jiawei Han 2 Chapter 3: Data Preprocessing Data Preprocessing:
More informationJun Zhang Department of Computer Science University of Kentucky
Application i of Wavelets in Privacy-preserving Data Mining Jun Zhang Department of Computer Science University of Kentucky Outline Privacy-preserving in Collaborative Data Analysis Advantages of Wavelets
More informationPOINT VALUES AND NORMALIZATION OF TWO-DIRECTION MULTIWAVELETS AND THEIR DERIVATIVES
November 1, 1 POINT VALUES AND NORMALIZATION OF TWO-DIRECTION MULTIWAVELETS AND THEIR DERIVATIVES FRITZ KEINERT AND SOON-GEOL KWON,1 Abstract Two-direction multiscaling functions φ and two-direction multiwavelets
More informationSchema Refinement & Normalization Theory: Functional Dependencies INFS-614 INFS614, GMU 1
Schema Refinement & Normalization Theory: Functional Dependencies INFS-614 INFS614, GMU 1 Background We started with schema design ER model translation into a relational schema Then we studied relational
More informationCS6931 Database Seminar. Lecture 6: Set Operations on Massive Data
CS6931 Database Seminar Lecture 6: Set Operations on Massive Data Set Resemblance and MinWise Hashing/Independent Permutation Basics Consider two sets S1, S2 U = {0, 1, 2,...,D 1} (e.g., D = 2 64 ) f1
More information2.3. Clustering or vector quantization 57
Multivariate Statistics non-negative matrix factorisation and sparse dictionary learning The PCA decomposition is by construction optimal solution to argmin A R n q,h R q p X AH 2 2 under constraint :
More informationMatrices and systems of linear equations
Matrices and systems of linear equations Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T.
More informationA Review of Matrix Analysis
Matrix Notation Part Matrix Operations Matrices are simply rectangular arrays of quantities Each quantity in the array is called an element of the matrix and an element can be either a numerical value
More informationWAVELET EXPANSIONS IN VOLUME INTEGRAL METHOD OF EDDY-CURRENT MODELING
WAVELET EXPANSIONS IN VOLUME INTEGRAL METHOD OF EDDY-CURRENT MODELING Bing Wang John P. Basart and John C. Moulder Center for NDE and Department of Electrical Engineering and Computer Engineering Iowa
More informationApplication of Wavelets to N body Particle In Cell Simulations
Application of Wavelets to N body Particle In Cell Simulations Balša Terzić (NIU) Northern Illinois University, Department of Physics April 7, 2006 Motivation Gaining insight into the dynamics of multi
More informationCS60021: Scalable Data Mining. Dimensionality Reduction
J. Leskovec, A. Rajaraman, J. Ullman: Mining of Massive Datasets, http://www.mmds.org 1 CS60021: Scalable Data Mining Dimensionality Reduction Sourangshu Bhattacharya Assumption: Data lies on or near a
More informationDM545 Linear and Integer Programming. Lecture 7 Revised Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 7 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 2 Motivation Complexity of single pivot operation
More informationProcessing Aggregate Queries over Continuous Data Streams
Processing Aggregate Queries over Continuous Data Streams Alin Dobra Computer Science Department Cornell University April 15, 2003 Relational Database Systems did dname 15 Legal 17 Marketing 3 Development
More informationLinear Programming The Simplex Algorithm: Part II Chapter 5
1 Linear Programming The Simplex Algorithm: Part II Chapter 5 University of Chicago Booth School of Business Kipp Martin October 17, 2017 Outline List of Files Key Concepts Revised Simplex Revised Simplex
More informationSimilarity Join Size Estimation using Locality Sensitive Hashing
Similarity Join Size Estimation using Locality Sensitive Hashing Hongrae Lee, Google Inc Raymond Ng, University of British Columbia Kyuseok Shim, Seoul National University Highly Similar, but not Identical,
More informationMachine Learning. Principal Components Analysis. Le Song. CSE6740/CS7641/ISYE6740, Fall 2012
Machine Learning CSE6740/CS7641/ISYE6740, Fall 2012 Principal Components Analysis Le Song Lecture 22, Nov 13, 2012 Based on slides from Eric Xing, CMU Reading: Chap 12.1, CB book 1 2 Factor or Component
More informationWavelet analysis on financial time series. By Arlington Fonseca Lemus. Tutor Hugo Eduardo Ramirez Jaime
Wavelet analysis on financial time series By Arlington Fonseca Lemus Tutor Hugo Eduardo Ramirez Jaime A thesis submitted in partial fulfillment for the degree of Master in Quantitative Finance Faculty
More informationA linear algebra approach for. Supply Chain Management
A linear algebra approach for A Linear SupplyAlgebra Chain Management Approach for Supply Chain Management (extended abstract ) RobertoDe De Virgilioand Franco Milicchio Dipartimentodi di Informaticaee
More informationFrom Fourier to Wavelets in 60 Slides
From Fourier to Wavelets in 60 Slides Bernhard G. Bodmann Math Department, UH September 20, 2008 B. G. Bodmann (UH Math) From Fourier to Wavelets in 60 Slides September 20, 2008 1 / 62 Outline 1 From Fourier
More informationCS122A: Introduction to Data Management. Lecture #13: Relational DB Design Theory (II) Instructor: Chen Li
CS122A: Introduction to Data Management Lecture #13: Relational DB Design Theory (II) Instructor: Chen Li 1 Third Normal Form (3NF) v Relation R is in 3NF if it is in 2NF and it has no transitive dependencies
More information4.1 Haar Wavelets. Haar Wavelet. The Haar Scaling Function
4 Haar Wavelets Wavelets were first aplied in geophysics to analyze data from seismic surveys, which are used in oil and mineral exploration to get pictures of layering in subsurface roc In fact, geophysicssts
More informationLinear Algebra V = T = ( 4 3 ).
Linear Algebra Vectors A column vector is a list of numbers stored vertically The dimension of a column vector is the number of values in the vector W is a -dimensional column vector and V is a 5-dimensional
More informationToward a Realization of Marr s Theory of Primal Sketches via Autocorrelation Wavelets: Image Representation using Multiscale Edge Information
Toward a Realization of Marr s Theory of Primal Sketches via Autocorrelation Wavelets: Image Representation using Multiscale Edge Information Naoki Saito 1 Department of Mathematics University of California,
More informationIntroduction. Normalization. Example. Redundancy. What problems are caused by redundancy? What are functional dependencies?
Normalization Introduction What problems are caused by redundancy? UVic C SC 370 Dr. Daniel M. German Department of Computer Science What are functional dependencies? What are normal forms? What are the
More informationSparse Recovery of Streaming Signals Using. M. Salman Asif and Justin Romberg. Abstract
Sparse Recovery of Streaming Signals Using l 1 -Homotopy 1 M. Salman Asif and Justin Romberg arxiv:136.3331v1 [cs.it] 14 Jun 213 Abstract Most of the existing methods for sparse signal recovery assume
More informationMachine Learning: Basis and Wavelet 김화평 (CSE ) Medical Image computing lab 서진근교수연구실 Haar DWT in 2 levels
Machine Learning: Basis and Wavelet 32 157 146 204 + + + + + - + - 김화평 (CSE ) Medical Image computing lab 서진근교수연구실 7 22 38 191 17 83 188 211 71 167 194 207 135 46 40-17 18 42 20 44 31 7 13-32 + + - - +
More informationLecture 24: Principal Component Analysis. Aykut Erdem May 2016 Hacettepe University
Lecture 4: Principal Component Analysis Aykut Erdem May 016 Hacettepe University This week Motivation PCA algorithms Applications PCA shortcomings Autoencoders Kernel PCA PCA Applications Data Visualization
More informationMultiscale Image Transforms
Multiscale Image Transforms Goal: Develop filter-based representations to decompose images into component parts, to extract features/structures of interest, and to attenuate noise. Motivation: extract
More informationCSE 562 Database Systems
Outline Query Optimization CSE 562 Database Systems Query Processing: Algebraic Optimization Some slides are based or modified from originals by Database Systems: The Complete Book, Pearson Prentice Hall
More informationMultiresolution analysis & wavelets (quick tutorial)
Multiresolution analysis & wavelets (quick tutorial) Application : image modeling André Jalobeanu Multiresolution analysis Set of closed nested subspaces of j = scale, resolution = 2 -j (dyadic wavelets)
More informationMatrices, Vector Spaces, and Information Retrieval
Matrices, Vector Spaces, and Information Authors: M. W. Berry and Z. Drmac and E. R. Jessup SIAM 1999: Society for Industrial and Applied Mathematics Speaker: Mattia Parigiani 1 Introduction Large volumes
More informationEntropy Encoding Using Karhunen-Loève Transform
Entropy Encoding Using Karhunen-Loève Transform Myung-Sin Song Southern Illinois University Edwardsville Sept 17, 2007 Joint work with Palle Jorgensen. Introduction In most images their neighboring pixels
More informationHistograms and Wavelets on Probabilistic Data
Histograms and Wavelets on Probabilistic Data Graham Cormode, AT&T Labs Research Minos Garofalakis, Technical University of Crete Email: graham@research.att.com, minos@acm.org Abstract There is a growing
More informationLatent Semantic Indexing (LSI) CE-324: Modern Information Retrieval Sharif University of Technology
Latent Semantic Indexing (LSI) CE-324: Modern Information Retrieval Sharif University of Technology M. Soleymani Fall 2014 Most slides have been adapted from: Profs. Manning, Nayak & Raghavan (CS-276,
More informationA STUDY ON INCREMENTAL OBJECT-ORIENTED MODEL AND ITS SUPPORTING ENVIRONMENT FOR CARTOGRAPHIC GENERALIZATION IN MULTI-SCALE SPATIAL DATABASE
A STUDY ON INCREMENTAL OBJECT-ORIENTED MODEL AND ITS SUPPORTING ENVIRONMENT FOR CARTOGRAPHIC GENERALIZATION IN MULTI-SCALE SPATIAL DATABASE Fan Wu Lina Dang Xiuqin Lu Weiming Su School of Resource & Environment
More information