Line Integral Convolution PDF

Line Integral Convolution
Scientific Visualization
- A global method to visualize vector fields
Flow Visualization
computer graphics & visualization

Course WS 05/06 – Scientific Visualization
Prof. Dr. R. Westermann – Computer Graphics and Visualization Group computer graphics & visualization
Line Integral Convolution Line Integral Convolution

- Line Integral Convolution (LIC) - Idea of Line Integral Convolution (LIC)
- Visualize dense flow fields by imaging its integral curves - Global visualization technique
- Cover domain with a random texture (so called ‚input - Start with random texture
texture‘
texture‘, usually stationary white noise) - Smear out along stream lines
- Blur (convolve) the input texture along the path lines
using a specified filter kernel
- Look of 2D LIC images
- Intensity distribution along path lines shows high
correlation
- No correlation between neighboring path lines
Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Prof. Dr. R. Westermann – Computer Graphics and Visualization Group computer graphics & visualization Prof. Dr. R. Westermann – Computer Graphics and Visualization Group computer graphics & visualization

- Algorithm for 2D LIC - Algorithm for 2D
- Let t → Φ0(t) be the path line containing the point (x
(x0,y0) LIC
- T(x,y) is the randomly generated input texture - Convolve a random
- Compute the pixel intensity as: texture along the
L
convolution with stream lines
I ( x0 , y 0 ) = ∫ −L k (t ) ⋅ T (φ0 (t )) dt
kernel
- Kernel:
- Finite support [-L,L] kernel 1 ∫ k (t )dt = 1
L
- Normalized k(t)
-L
- Often simple box filter

- Often symmetric (isotropic) -L L

1
- Fast LIC
- Problems with LIC
- New stream line is computed at each pixel
Input noise Vector field - Convolution (integral) is computed at each pixel
- Slow
∫ k (t )dt = 1 - Idea:
L
kernel 1
-L
- Compute very long stream lines

k(t)
Convolution
-L L - Reuse these stream lines for many different pixels
- Incremental computation of the convolution integral
Final image


- Fast LIC: incremental integration - Fast LIC: incremental integration
- Discretization of convolution integral - Next position I1 TL Tn
- Summation TL Tn
xL xn
xL xn
Assumption: box filter L
∑T
Assumption: box filter L I0 = 1
k (t ) = T0 x0
∑T
2L +1
I0 =
1 i
k (t ) = T0 x0
1 2L +1
1 i = -L
2L +1 2L +1 i
i = -L
x-m T-L
x-m T-L I1 = I 0 + (TL +1 − T-L ) /(2 L + 1)
x-L
x-L T-m
T-m

- Fast LIC: incremental integration for constant - Fast LIC: Algorithm
kernel - Data structure for output: Luminance/Alpha image
- Stream line x-m,..., x0,..., xn with m,n ≥ L - Luminance = gray-
gray-scale output
- Alpha = number of streamline passing through that pixel
- Given texture values T-m,...,T0,...,T
,...,Tn
- What are results of convolution: I-m+L,..., I0,..., In-L? For each pixel p in output image
(Alpha(p) < #min) Then
If (Alpha(p
Initialize streamline computation with x0 = center of p
- For box filter (constant
L
kernel): Compute convolution I(x0)
Add result to pixel p (increment alpha)
I0 = 1
2L +1 ∑T i For m = 1 to Limit M
Incremental convolution for I(xm) and I(x-m)
i = -L
- Incremental integration: Add results to pixels containing xm and x-m (incr. alpha)
End for
∑ (T − Ti + j ) = (T − T- L + j )
L End if
I j +1 − I j = 1
2L +1 i + j +1
1
2L +1 L + j +1
End for
Normalize all pixels according to Alpha
i = -L

2
- Summary: - Oriented LIC (OLIC):
- Dense representation of flow fields - Visualizes orientation (in addition to direction)
- Convolution along stream lines → correlation along - Sparse texture
stream lines - Anisotropic convolution kernel
- For 2D and 3D flows - Acceleration: integrate individual drops and compose
- Stationary flows them to final image
- Extensions:
- Unsteady flows anisotropic
1
convolution kernel
- Animation
- Texture advection
-l l


- Oriented LIC (OLIC) - LIC - Line Integral Convolution

Vector field =
gradient fields of image
Lic – Applications: Motion blurring by means of biased

triangle filter and variable length LIC
3
Lic-Applications: length of convolution integral Lic and color coding of velocity magnitude
with respect to magnitude of vector field
Line Integral Convolution Vector Field Topology

- Summary: - Idea: Do not draw “all”
all” streamlines, but only the
- Dense representation of flow fields “important”
important” ones
- Convolution along stream lines → correlation along - Show only topological skeletons
stream lines
- Connection of critical points
- For 2D and 3D flows
- Stationary flows - Critical points:
- Extensions: - Points where the vector field vanishes: v = 0
- Unsteady flows
- Points where the vector magnitude goes to zero and the
vector direction is undefined
- Animation
- Texture advection
- Sources, sinks, …
- The critical points are connected
to divide the flow into regions
with similar properties

Vector Field Topology Vector Field Topology

- How to find critical points - How to find critical points within a cell
- Cell search (for cells which contain critical points)
points) - Determine intersection of isolines (c=0) of the two
- Mark vertices by (+,+), (–, –), (+, –) or (–,+), depending on the components
signs of vx and vy - Two bilinear equations (or one quadratic equation) to be
- Determine cells that have vertices where the sign changes in both both solved
components –> these are the cells that contain critical points
- Critical points are the (real) solutions within the cell boundaries
boundaries
- Find the critical points by interpolation
(+,+) (+,+) (+,–)

(yes,yes) (no,yes)
Vy=
Vx=
0
0
(–,–) (+,–) (+,–)
4
- How to find critical points (cont.) - Taylor expansion for the velocity field around a
- How to find critical points within simplex? critical point rc with (V(r
V(rc)= 0):
- Based on barycentric interpolation v(r ) = v(rc ) + ∇v ⋅ (r − rc ) + O(r − rc )2
- Solve analytically
≈ J ⋅ (r − rc )
- Alternative method:
- Iterative approach based on 2D / 3D nested intervals - Divide Jacobian into symmetric and anti-
anti-
- Recursive subdivision into 4 / 8 subregions if critical point is symmetric parts
contained in cell
J = Js + Ja = ((J
((J + JT) + (J
(J - JT))/2
Js = (J
(J + JT)/2
Ja = (J
(J - JT)/2


- The symmetric part can be solved to give real - Anti-
Anti-symmetric part
eigenvalues R and real eigenvectors
J ⋅ d = (J − J )⋅ d =
a
1
2
T
J s rs = R rs R = R 1, R 2 , R 3 ⎛ 0 ∂v x
−
∂v y ∂v x
− ∂∂vxz ⎞⎟
⎜ ∂v ∂y ∂x ∂z
1 ⎜ ∂xy − ∂∂vyx 0
∂v y
∂z
− ∂∂vyz ⎟ ⋅ d = 1
(∇ × v ) × d
⎜ ∂v z ∂v x ⎟
2 2
- Eigenvectors rs are an orthonormal set of vectors ⎜ ∂x − ∂z
⎝
∂v z
∂y
∂v y
∂z
0 ⎟
⎠
- Describes change of size along eigenvectors
- Describes flow into or out of region around critical point - Describes rotation of difference vector d = (r
(r - rc)
- The anti-
anti-symmetric part can be solved to give imaginary
eigenvalues I
J a ra = Ira I = I1, I 2 , I 3


- 2D structure: eigenvalues are (R
(R1, R2) and (I
(I1,I2) - 2D structure: eigenvalues are (R
(R1, R2) and (I
(I1,I2)
Repelling focus
Repelling node R1, R2 > 0
R1, R2 > 0 I1,I2 ≠ 0
Attracting node
I1,I2 = 0 Attracting focus
R1, R2 < 0
I1,I2 = 0 R1, R2 < 0
I1,I2 ≠ 0
Saddle point
Center
R1 * R2 < 0
R1, R2 = 0
I1,I2 = 0
I1,I2 ≠ 0

5
- Also in 3D - Mapping to graphical primitives: streamlines
- Some examples - Start streamlines close to critical points
- Initial direction along the eigenvectors
- End particle tracing at
- Other “real”
real” critical points
- Interior boundaries: attachment or detachment points
Attracting node
- Boundaries of the computational domain
R1, R2 , R3 < 0
I1,I 2,I3 = 0
Center
R1, R2 = 0, R3 > 0
I1,I2 ≠ 0, ,I3 = 0


- Example of a topological graph of 2D flow field - Further examples of topology-
topology-guided streamline
positioning

Vector Field Topology 3D Vector Fields

- Summary: - Most algorithms can be applied to 2D and 3D
- Draw only relevant streamlines (topological skeleton) vector fields
- Partition domain in regions with similar flow features - Main problem in 3D: effective mapping to
- Based on critical points graphical primitives
- Good for 2D stationary flows - Main aspects:
- Instationary flows? - Occlusion
- 3D? - Amount of (visual) data
- Depth perception

6
3D Vector Fields 3D Vector Fields
- Approaches to occlusion issue: - Missing continuity
- Sparse representations
- Animation
- Color differences to distinguish separate objects
- Continuity
- Reduction of visual data:
- Sparse representations
- Clipping
- Importance of semi-
semi-transparency


- Color differences to identify connected structures - Reduction of visual data
- 3D LIC


- Improving spatial perception: - Illumination
- Depth cues
- Perspective
- Occlusion
- Motion parallax
- Stereo disparity
- Color (atmospheric, fogging)
- Halos
- Orientation of structures
by shading (highlights)

7
- Illuminated streamlines [Zö
[Zöckler et al. 1996]
1996] - Illuminated streamlines (cont
(cont.)
.)
- Model: streamline is made of thin cylinders - Light vector is split in tangential and normal parts
- Problem V ⋅ R = V ⋅ (L N − LT ) = V ⋅ ((L ⋅ N)N − (L ⋅ T)T )
- No distinct normal vector on surface = (L ⋅ N)(V ⋅ N) − (L ⋅ T)(V ⋅ T)
- Normal vector in plane perpendicular to tangent: normal
space = 1 − (L ⋅ T) 2 1 − (V ⋅ T) 2 − (L ⋅ T)(V ⋅ T)
- Cone of reflection vectors = f ((L ⋅ T), (V ⋅ T) )
- Idea: Represent f() by 2D texture

- Access pre-
pre-computed f() during rendering

3D Vector Fields Particle Tracing on Grids

- Illuminated stream lines - How do we handle curvilinear grids?
- C-space (computational space) vs. P-
P-space
(physical space)
x
s
q r00
r
x P-space
0,1
C-space
0,0 1,0 p
Particle Tracing on Grids Particle Tracing on Grids

- Particle tracing can be done in C-
C-space or P-
P-space - Transformation of points:
- Transformation of - From C-
C-space to P-
P-space: r = Φ(s)
- Points by Φ - From P- C-space: s = Φ-1(r)
P-space to C-
- Vectors by J - Transformation of vectors:
Φ-1 or J-1 - From C-C-space to P-
P-space: v = J ⋅ u
- From P- C-space: u = J-1 ⋅ v
P-space to C-
s
x
- J is Jacobi matrix:
Φ or J
⎛ ∂Φx ∂Φx⎞
q r00 ⎜ ⎟
∂p ∂q
r J=⎜ ⎟
⎜ ∂Φy ∂Φy⎟ (2D case)
⎜ ⎟
x P-space ⎝ ∂p ∂q ⎠
0,1
C-space
0,0 1,0 p
8
- Particle tracing in C-
C-space - Transformation of points from C-
C-space to P-
P-space
- Algorithm - r = Φ(s):
Select start point r in P-
Find P-
P-space cell
P-space (seed point)
point location
- Bilinear (in 2D) or trilinear (in 3D) interpolation between
C-space s
Transform start point to C- coordinates of the cell’
cell’s vertices
While (particle in domain) do
Transform v → u at vertices (P → C) - Transformation of vectors from
from P-
P-space to C-
C-space
Interpolate u in C-
C-space interpolation - u = J-1 ⋅ v
Integrate to new position s in C-
If outside current cell then
C-space integration
- Needs inverse of the Jacobian
Clipping
Find new cell point location
- Numerical computation of elements of the Jacobi
Endif matrix:
P-space s → r
Transform to P- (C → P)
Draw line segment between latest - Backward differences (bd
(bd))
particle positions
- Forward differences (fd
(fd))
- Central differences (cd
Endwhile
(cd))


- Computing Jacobi matrices on curvilinear grids: - Particle tracing in P-
P-Space
- Per cell (central differences): fast, inaccurate - Algorithm
- Per vertex (central differences): slower, higher accuracy
- 4 (in 2D) or 8 (in 3D) per vertex (backward and forward Select start point r in P-
P-space (seed point)
differences): time-
time-consuming, compatible with bi /
Jbdbd Find P-
P-space cell and local coords point location
trilinear interpolation, accurate
While (particle in domain) do
Jcd Jbdfd
Jcd Interpolate v in P-
P-space interpolation
Jcd Integrate to new position r in P-
P-space integration
Find new position point location
Draw line segment between latest
Jcd Jfdbd particle positions
Jcd Jfdfd Endwhile
Once per cell Once per vertex 4 per vertex


- Main problem: Point location / local coordinates in - Stencil-
Stencil-walk on curvilinear grids
cell - Given: rold, rnew, sold , Φ(sold) = rold
- Given is point r in P-
P-space - Determine snew
- What is corresponding position s in C-
C-space?
- Coordinates s are needed for interpolating v
Φ-1 or J-1
x
- Solution: Stencil-
Stencil-walk algorithm [Bunnig ’89] s old
Φ or J
x
- Iterative technique q r00
- Needs Jacobi matrices s new rold rnew
x x P-space
0,1
C-space
0,0 1,0 p

9
- Stencil-
Stencil-walk on curvilinear grids (cont.
(cont.)) - Idea of stencil-
stencil-walk:
- Transformation of distances Δs = snew–sold , Δr = rnew–rold - Guess start point in C- C-space
- Taylor expansion: - Compute difference between corresponding position and
Δr = rnew − rold = Φ( snew ) − Φ( s old ) = JΦ ( s old ) ⋅ Δs + K target position in P- P-space
- Therefore Δs ≈ [ JΦ ( s old )]−1 Δr - Improve position in C- C-space
- Iterate
Φ-1 or J-1 Φ or J
-1 -1
x Δr x Δr
x x
s old s old
Φ or J Φ or J
q r00 q r00
rold s rold r
s new rnew new new
x x P-space x x P-space
0,1 0,1
C-space C-space
0,0 1,0
Δs p 0,0 1,0
Δs p


- Stencil-
Stencil-walk algorithm - Stencil-
Stencil-walk algorithm
Given: target position rtarget in P-
P-space
required accuracy ε in C-
C-space initialize : r := rold ; p := p old ;
Guess start point s in C-
C-space while Δp > ε do
Do
P-space r = Φ (s)
Transformation to P- Δ r = rnew − r ;
P-space Δr = rtarget – r
Difference in P-
Δp = [ J Φ (p )]−1 Δ r ;
C-space Δs = J-1 Δr
Transformation to C-
If (|Δs| < ε) then exit p = p + Δp;
s = s + Δs r = Φ (p ) ;
(s outside current cell)
If (s cell) then endwhile
Set s = midpoint of corresponding neighboring cell
Endif cell_index ( rnew ) = ( ⎣Px ⎦, ⎣Py ⎦ ) ;
Repeat


- High convergence speed of stencil walk - Inverse V3 V2
- Typically 3-
3-5 iteration steps in a cell distance d3
weighting d2
- Interpolation of velocity in P-
P-space approach:
- Bi / trilinear within cell, based on local coordinates p rp
- Alternative method: inverse distance weighting → no
stencil walk needed
d0 d1
V1
V0 1
d i2
v = ∑i
w ivi , where d i = ri − r p and wi =
∑
1
if (d i < ε) then w i = 1 ; w j≠i = 0

j 2
d i

10
Particle Tracing on Grids
- Important properties of C-
C-space integration:
+ Simple incremental cell search
+ Simple interpolation
- Complicated transformation of velocities / vectors
- Important properties of P-
P-space integration:
+ No transformation of velocities / vectors
- Complicated point location (stencil walk) for bi / trilinear
interpolation
Course WS 05/06 – Scientific Visualization

Prof. Dr. R. Westermann – Computer Graphics and Visualization Group computer graphics & visualization
11

Line Integral Convolution PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Line Integral Convolution PDF

Uploaded by

Copyright:

Available Formats

Line Integral Convolution

computer graphics & visualization

Line Integral Convolution Line Integral Convolution

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Line Integral Convolution Line Integral Convolution

- Often simple box filter

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

- Compute very long stream lines

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Line Integral Convolution Line Integral Convolution

Line Integral Convolution Line Integral Convolution

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Line Integral Convolution Line Integral Convolution

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Line Integral Convolution Line Integral Convolution

Lic – Applications: Motion blurring by means of biased

Line Integral Convolution Vector Field Topology

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Vector Field Topology Vector Field Topology

(+,+) (+,+) (+,–)

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Vector Field Topology Vector Field Topology

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Vector Field Topology Vector Field Topology

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Vector Field Topology Vector Field Topology

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Vector Field Topology 3D Vector Fields

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

3D Vector Fields 3D Vector Fields

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

3D Vector Fields 3D Vector Fields

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

- Idea: Represent f() by 2D texture

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

3D Vector Fields Particle Tracing on Grids

Particle Tracing on Grids Particle Tracing on Grids

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Particle Tracing on Grids Particle Tracing on Grids

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Particle Tracing on Grids Particle Tracing on Grids

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Particle Tracing on Grids Particle Tracing on Grids

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Particle Tracing on Grids Particle Tracing on Grids

if (d i < ε) then w i = 1 ; w j≠i = 0

Course WS 05/06 – Scientific Visualization Course WS 05/06 – Scientific Visualization

Course WS 05/06 – Scientific Visualization

You might also like