Chungnam National University, Korea

Slides:



Advertisements
Similar presentations
Numerical Methods.  Polynomial interpolation involves finding a polynomial of order n that passes through the n+1 points.  Several methods to obtain.
Advertisements

Chapter 2: Part 1 Phasors and Complex Numbers
EARS1160 – Numerical Methods notes by G. Houseman
Maximum likelihood reconstruction of waveform events Gary C. Hill April 20th 2005.
Curve-Fitting Regression
ECIV 301 Programming & Graphics Numerical Methods for Engineers REVIEW III.
Feb. 7, 2011 Plane EM Waves The Radiation Spectrum: Fourier Transforms.
VARIABLE-FREQUENCY NETWORK
So where does the ADAPS optimization method fit into this framework? The seismic trace equation does not fit the linear definition, since the values on.
CIS V/EE894R/ME894V A Case Study in Computational Science & Engineering HW 5 Repeat the HW associated with the FD LBI except that you will now use.
Chapter 16: Time-Series Analysis
Time Series Data Analysis - I Yaji Sripada. Dept. of Computing Science, University of Aberdeen2 In this lecture you learn What are Time Series? How to.
Today’s class Spline Interpolation Quadratic Spline Cubic Spline Fourier Approximation Numerical Methods Lecture 21 Prof. Jinbo Bi CSE, UConn 1.
Phase Congruency Detects Corners and Edges Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
Operations Fall 2015 Bruce Duggan Providence University College.
5. Integration 2.Quadrature as Box Counting 3.Algorithm: Trapezoid Rule 4.Algorithm: Simpson’s Rule 5.Integration Error 6.Algorithm: Gaussian Quadrature.
Introduction to Time Series Analysis
March 23 & 28, Csci 2111: Data and File Structures Week 10, Lectures 1 & 2 Hashing.
March 23 & 28, Hashing. 2 What is Hashing? A Hash function is a function h(K) which transforms a key K into an address. Hashing is like indexing.
Course 2 Image Filtering. Image filtering is often required prior any other vision processes to remove image noise, overcome image corruption and change.
1 Computational Vision CSCI 363, Fall 2012 Lecture 24 Computing Motion.
Welcome to MM305 Unit 5 Seminar Prof Greg Forecasting.
Lecture 17 - Approximation Methods CVEN 302 July 17, 2002.
Paula Agudelo Turbulence, Intermittency and Chaos in High-Resolution Data, Collected At The Amazon Forest.
ESTIMATION METHODS We know how to calculate confidence intervals for estimates of  and  2 Now, we need procedures to calculate  and  2, themselves.
Obtaining turbulence properties from surveys Jungyeon Cho Chungnam National University, Korea Cho & Ryu (2009, ApJL) Cho et al. (2013, in prep.)
LECTURE 17: BEYOND LINEARITY PT. 2 March 30, 2016 SDS 293 Machine Learning.
Direct numerical simulation has to solve all the turbulence scales from the large eddies down to the smallest Kolmogorov scales. They are based on a three-dimensional.
Welcome to MM305 Unit 5 Seminar Forecasting. What is forecasting? An attempt to predict the future using data. Generally an 8-step process 1.Why are you.
PERFORMANCE OF A WAVELET-BASED RECEIVER FOR BPSK AND QPSK SIGNALS IN ADDITIVE WHITE GAUSSIAN NOISE CHANNELS Dr. Robert Barsanti, Timothy Smith, Robert.
CS 591 S1 – Computational Audio -- Spring, 2017
The Maximum Likelihood Method
Linear Algebra Review.
LES of Turbulent Flows: Lecture 8 (ME EN )
Diffusion over potential barriers with colored noise
MECH 373 Instrumentation and Measurements
Data Mining: Concepts and Techniques
Efficient situation-dependent covariance generation using recursive filters and the methods of Riemannian geometry R. James Purser Science Applications.
Hyeseung Lee1 with Jungyeon Cho1, A. Lazarian2
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Data Processing As a science major, you will all eventually have to deal with data. All data has noise Devices do not give useful measurements; must convert.
QRS Detection Linda Henriksson 1.
Signal processing.
Image Sampling Moire patterns
The Maximum Likelihood Method
Subject Name: File Structures
Fourier Transform.
The Maximum Likelihood Method
Outline Linear Shift-invariant system Linear filters
Shape Analysis and Retrieval
Introduction to Instrumentation Engineering
Assessing the Compatibility of Microwave Geodetic Systems
Chapter 7 Numerical Differentiation and Integration
Today’s class Multiple Variable Linear Regression
Contrasts & Statistical Inference
Image Sampling Moire patterns
The Product Rule.
Least Square Regression
Multidimensional Scaling
Generally Discriminant Analysis
Resampling.
Contrasts & Statistical Inference
CHAPTER 2: Basic Summary Statistics
Statistical Data Analysis
Intensity Transformation
Data Processing Chapter 3
Contrasts & Statistical Inference
Lecture 16. Classification (II): Practical Considerations
Review and Importance CS 111.
DIGITAL IMAGE PROCESSING Elective 3 (5th Sem.)
Presentation transcript:

Chungnam National University, Korea Removing Large-scale Variations in regularly and irregulary spaced data Jungyeon Cho Chungnam National University, Korea

Large-scale variations are commonly observed e.g.) Hour-glass morphology of B  Makes it difficult to accurately measure fluctuations of small-scale B A technique called Davis-Chandrasekhar-Fermi method requires this quantity It can obtain |B| Direction of B Pattle + (+Cho) (2017)

 ssf=? x Answer: Fitting! x Small-scale fluctuations (SSF) only Q(x) standard deviation Q(x) x SSF + LSV (large-scale variation) x Q(x) If LSV is linear, how can we get ssf ? Answer: Fitting!

x x SSF + LSV Q(x) What if the LSV is quadratic? We can get ssf from fitting! x Q(x) What if the LSV is complicated and unknown? We may get ssf still from fitting!

The technique is simple: Multi-point Second-order Structure Function! In this talk I present a simple technique that is complementary to fitting or other techniques like wavelet transformations. The technique is simple: Multi-point Second-order Structure Function!

What is structure function (SF)? Driving scale if it’s turbulence x Let’s consider a quantity Qr=| Q(x+r)-Q(x) |.  How does Qr change as r increases? Structure Function: typical fluctuation as a function of separation r <Qr> Driving scale (ls)  (2-point) 2nd-order SF: SF22pt=<Qr2>

(Usual) Behavior of SF22pt SF22pt=<|Q2pt|2> Q2pt=Q(x)-Q(x+r) r 2Q2 x x+r lc SSF

Behavior of SF22pt in the presence of LSV SSF + LSV (large-scale variation) LSV x Q(x) SSF 2Q2 r lc  It is very difficult to get SSF from SF22pt

Then how can we get SSF in the presence of a linear LSV? SSF + LSV (large-scale variation) r 2Q2 SF23pt Q(x) x-r x+r x Answer: 3-point SF2 ( SF23pt)

Q(x-r)+Q(x+r)-2Q(x) 2 Q(x+r) Q(x) Q(x-r)+Q(x+r) 2 Q(x-r) x-r x x+r

 4-point SF2 can remove a quadratic LSV. In general, r 2Q2 SF2n-pt Plateau!  4-point SF2 can remove a quadratic LSV. 5-point SF2 can remove a cubic LSV, and so on.

Numerical Tests We test the possibility using numerical simulations. Turbulence data LOS + LSV of a sinusoidal form It can be any observable quantity (e.g., column density, centroid velocity,...) Note: Amplitude of the sine wave > typical turbulence fluctuation

Observed velocity map & SF Cho 2018

If it’s confusing, what about this? Let’s consider a simple question: SSF+LSV A sinusoidal large-scale variation (LSV) + = Small-scale fluctuations (SSF) Can we retrieve the map of small-scale fluctuations?

Of course, we can use a filter... A smoothing filter Traditional filters: Gaussian, top-hat,...

Annular filter works perfectly only if LSV is linear Double-annular filter works perfectly if LSV is cubic We can derive these filters from the structure functions Cho (2018)

Then what about irregularly-spaced data? Starlight polarization  Shows direction of B (Kandori+ 2018)

xi Q(xi) Q(xj) Q(x3rd) r lS SF23pt 2s2 xj x3rd SF2=< | |2 >

We select 2,000 points 22

Summary Help us to remove large-scale fluctuations Our multi-point structure function technique can Help us to remove large-scale fluctuations Help us to obtain small-scale maps

=0 How can we efficiently filter-out LSV? x x+r x-r Suppose that LSV is linear =0 = This average can filter-out a linear LSV

Our technique can help us to obtain small-scale maps Our approach: multi-point average technique! 2-point average (=annular filter): rp rp

4-point average (double-annular filter):