Post on 25-Dec-2015
Efficient Visualization ofLagrangian Coherent Structures by Filtered AMR Ridge Extraction
October 2007 - IEEE Vis
Filip Sadlo, Ronald Peikert @ CGL - ETH Zurich
Efficient Visualization of LCS by filtered AMR Ridge Extraction
2
Lagrangian Coherent Structures (LCS)
Vector Field Topology• Crit. pts. & streamlines• Instantaneous view• Fast
Lagr. Coherent Structures• Ridges in Lyapunov Exponent• Transient view• Slow (trajectory per point &
time)-> Adaptive approach
Shadden et al. 2005
FTLE
Efficient Visualization of LCS by filtered AMR Ridge Extraction
3
Lagrangian Coherent Structures (LCS)
Vector Field Topology• Crit. pts. & streamlines• Instantaneous view• Fast
Lagr. Coherent Structures• Ridges in Lyapunov Exponent• Transient view• Slow (trajectory per point &
time)-> Adaptive approach
Shadden et al. 2005
FTLE
Efficient Visualization of LCS by filtered AMR Ridge Extraction
4
Finite-Time Lyapunov Exponent (FTLE)
FTLE: “growth of perturbation after advection time T”
0
1, , ln /FTLE t T
T x
0t T
0t
x0t
0t T
Efficient Visualization of LCS by filtered AMR Ridge Extraction
5
FTLE Computation
• Advection of particle pairs: tedious• Haller 2001: by pre-sampled flow map
0 0
:tt t t x x x
0tx tx
Shadden et al. 2005
t0=FTLE
Efficient Visualization of LCS by filtered AMR Ridge Extraction
6
FTLE Computation
• Advection of particle pairs: tedious• Haller 2001: by pre-sampled flow map
0
0 2 t Tt x
0 0
:tt t t x x x
0tx tx
Shadden et al. 2005
t0=FTLE
max2
TA A A
Efficient Visualization of LCS by filtered AMR Ridge Extraction
7
FTLE Computation
• Advection of particle pairs: tedious• Haller 2001: by pre-sampled flow map
0
0max 0 2
1, , ln t T
tFTLE t TT
x x
0 0
:tt t t x x x
max2
TA A A
0tx tx
Shadden et al. 2005
t0=FTLE
Efficient Visualization of LCS by filtered AMR Ridge Extraction
8
FTLE Computation
• Advection of particle pairs: tedious• Haller 2001: by pre-sampled flow map
0
0max 0 2
1, , ln t T
tFTLE t TT
x x
0 0
:tt t t x x x
max2
TA A A
0tx tx
Shadden et al. 2005
t0=FTLE
Efficient Visualization of LCS by filtered AMR Ridge Extraction
9
LCS in Nature
Confluences• Interfaces• Sacramento & Feather
Glaciers• Moraines• Glacier Bay National Park
from: www.scienceclarified.com/Ga-He/Glacier.htmlfrom: www.publicaffairs.water.ca.gov/swp/swptoday.cfm
Efficient Visualization of LCS by filtered AMR Ridge Extraction
10
Moraines and LCS
“Appearing as dark lines on the surface, moraines indicate how many smaller glaciers feed into the system”
-> LCS, dynamical systems
from: www.fs.fed.us/r10/tongass/forest_facts/resources/geology/icefields.htm
Efficient Visualization of LCS by filtered AMR Ridge Extraction
11
Overview
Related Work
Height Ridges
Filtered AMR Ridge Extraction
Efficiency
FTLE & FSLE
Proposed: FTLEM
FTLEM & FSLE
Efficient Visualization of LCS by filtered AMR Ridge Extraction
12
Related Work
Ridge Extraction– Eberly 1996: Ridges in Image and Data Analysis (nD)– Furst et al. 2001: Marching Ridges (2D)– Sahner et al. 2005: Streamlines in Feature Flow Field (1D)
LCS– Hussain 1986: Based on vorticity (3D)– Robinson 1991: Based on correlation (3D)– Haller 2001: Ridges in FTLE, material surfaces (2D)
FTLE– Lorenz 1965: Measures predictability– Haller 2001: Based on pre-sampled flow map
Path Line Oriented Topology– Theisel et al. 2004: Based on geometry of path lines– Shi et al. 2006: Same for periodic fields
Efficient Visualization of LCS by filtered AMR Ridge Extraction
13
Height Ridges
Eberly 1996:– s : scalar field min : min. eigenvalue of Hessian (s)
min : eigenvector for min (min ridge)
– 2D height ridge in 3-space:
min s = 0 min 0
min
min s = 0 , min 0
Efficient Visualization of LCS by filtered AMR Ridge Extraction
14
Furst et al. 2001: Marching Ridges– Orientate min at nodes of cell by PCA
– Evaluate min s at nodes
– Interpolate zero crossings on edges
– Use zero crossings with min 0
– Triangulate crossings
– We also filter crossings e.g. by FTLE– We use Marching Cubes instead of triangulation
Height Ridges
|, | : “min s = 0”
PCA
min 0 , min 0
Efficient Visualization of LCS by filtered AMR Ridge Extraction
15
Filtered AMR Ridge Extraction: Motivation
Avoid sampling– in regions with no ridges (after filtering)
Advantages– if only few ridges are present in given data– if data can be sampled at arbitrary locations– if cost of sampling is high
Accuracy– Obtained ridges identical to those from uniform
sampling– Rarely small or faint ridges may get missed (see
paper)
Efficient Visualization of LCS by filtered AMR Ridge Extraction
16
Filtered AMR Ridge Extraction
ridge intersects cell edge
Initialization: Ridge-Cell Detection
Efficient Visualization of LCS by filtered AMR Ridge Extraction
17
Filtered AMR Ridge Extraction
ridge cell
Initialization: Ridge-Cell Detection
Efficient Visualization of LCS by filtered AMR Ridge Extraction
18
Filtered AMR Ridge Extraction
ridge cell
ridge cell neighbor
Iteration 1: Collect for Subdivision
Efficient Visualization of LCS by filtered AMR Ridge Extraction
19
Filtered AMR Ridge Extraction
Iteration 1: Subdivision
Efficient Visualization of LCS by filtered AMR Ridge Extraction
20
Filtered AMR Ridge Extraction
ridge intersects cell edge
Iteration 1: Ridge-Cell Detection
Efficient Visualization of LCS by filtered AMR Ridge Extraction
21
Filtered AMR Ridge Extraction
ridge cell
Iteration 1: Ridge-Cell Detection
Efficient Visualization of LCS by filtered AMR Ridge Extraction
22
Filtered AMR Ridge Extraction
ridge cell
ridge cell 2-neighbor
Iteration 1: Ridge Growing
Efficient Visualization of LCS by filtered AMR Ridge Extraction
23
Filtered AMR Ridge Extraction
ridge cell
Iteration 1: Ridge Growing
Efficient Visualization of LCS by filtered AMR Ridge Extraction
24
Filtered AMR Ridge Extraction
ridge intersects cell edgeridge cell
Iteration 1: Ridge Growing
Efficient Visualization of LCS by filtered AMR Ridge Extraction
25
Filtered AMR Ridge Extraction
ridge cell
Iteration 1: Ridge Growing
Efficient Visualization of LCS by filtered AMR Ridge Extraction
26
Filtered AMR Ridge Extraction
ridge cell neighbor
ridge cell
Iteration 2: Collect for Subdivision
Efficient Visualization of LCS by filtered AMR Ridge Extraction
27
Filtered AMR Ridge Extraction
Iteration 2: Subdivision
Efficient Visualization of LCS by filtered AMR Ridge Extraction
28
Filtered AMR Ridge Extraction
ridge intersects cell edge
Iteration 2: Ridge-Cell Detection
Efficient Visualization of LCS by filtered AMR Ridge Extraction
29
Filtered AMR Ridge Extraction
Iteration 2: Ridge-Cell Detection
ridge cell
Efficient Visualization of LCS by filtered AMR Ridge Extraction
30
Filtered AMR Ridge Extraction
Iteration 2: Ridge Growing
ridge cell
ridge cell 2-neighbor
Efficient Visualization of LCS by filtered AMR Ridge Extraction
31
Filtered AMR Ridge Extraction
Iteration 2: Ridge Growing
ridge cell
ridge cell 2-neighborfor 1-level difference
Efficient Visualization of LCS by filtered AMR Ridge Extraction
32
Filtered AMR Ridge Extraction
Iteration 2: Ridge Growing
ridge cell
Efficient Visualization of LCS by filtered AMR Ridge Extraction
33
Filtered AMR Ridge Extraction
Iteration 2: Ridge Growing
ridge cell
ridge intersects cell edge
Efficient Visualization of LCS by filtered AMR Ridge Extraction
34
Filtered AMR Ridge Extraction
Iteration 2: Ridge Growing
ridge cell
Efficient Visualization of LCS by filtered AMR Ridge Extraction
35
Filtered AMR Ridge Extraction
ridge cell
Iteration 3: Collect for Subdivision
ridge cell neighbor
Efficient Visualization of LCS by filtered AMR Ridge Extraction
36
Filtered AMR Ridge Extraction
. . .
Iteration 3: …
Efficient Visualization of LCS by filtered AMR Ridge Extraction
37
Filtered AMR Ridge Extraction
Final Result
Efficient Visualization of LCS by filtered AMR Ridge Extraction
38
Filtered AMR Ridge Extraction from FTLE:
Method
video
Efficient Visualization of LCS by filtered AMR Ridge Extraction
39
Filtered AMR Ridge Extraction from FTLE:
Francis Turbine
video
Efficient Visualization of LCS by filtered AMR Ridge Extraction
40
Efficiency
direct adaptive
initial grid 3,613,153 nodes
1,183 nodes
final grid 3,613,153 nodes
298,964 nodes
flow map [s] 19,953.51 2,350.21
FTLE [s] 10.73 30.73
ridge extr. [s] 278.46 2,337.16
total [s] 20,242.74 4,930.72
Subdivision iterations: 4
Speed-up: > 4
Efficient Visualization of LCS by filtered AMR Ridge Extraction
41
Finite-Size Lyapunov Exponent (FSLE), Aurell
1997FSLE: “time needed to separate by factor s”
0
1, , lns
s
FSLE t T sT
x
sx
0 st T
0t
0t0 st T
Efficient Visualization of LCS by filtered AMR Ridge Extraction
42
FTLE & FSLE (Filtered)
FTLET = 0.1
FSLEPrescribed scale =
1.5Tmax = 0.1
FSLEPrescribed scale =
4Tmax = 0.1
Efficient Visualization of LCS by filtered AMR Ridge Extraction
43
Proposed: Finite-Time Lyapunov Exponent Maximum (FTLEM)
FTLEM: “maximum FTLE over advection time T”
01,...,
1, , , max ln /
kk n
FTLEM t T nk t
x
nx
0 t n t
0t
0t0 t n t
0 1 t t
0 1 t t1
0 2 t t
0 2 t t
2 …
0 ( 1) t n t
1n
0 ( 1) t n t
Efficient Visualization of LCS by filtered AMR Ridge Extraction
44
FTLEM & FSLE (Filtered)
FTLEM
Tmax = 0.1
Properties of both FSLE
FSLEPrescribed scale =
1.5Tmax = 0.1
FSLEPrescribed scale =
4Tmax = 0.1
Efficient Visualization of LCS by filtered AMR Ridge Extraction
45
Conclusion
• Efficient method for ridge extraction
• Applied to FTLE, FSLE and FTLEM
• FTLEM as a new FTLE variant
• Future Work– Exploit temporal coherency