Line integral convolution

In scientific visualization, line integral convolution (LIC) is a method to visualize a vector field (such as fluid motion) at high spatial resolutions.^[1] The LIC technique was first proposed by Brian Cabral and Leith Casey Leedom in 1993.^[2]

Image of the Large Magellanic Cloud, one of the nearest galaxies to our Milky Way, created with LIC

In LIC, discrete numerical line integration is performed along the field lines (curves) of the vector field on a uniform grid. The integral operation is a convolution of a filter kernel and an input texture, often white noise.^[1] In signal processing, this process is known as a discrete convolution.^[3]

Overview

Traditional visualizations of vector fields use small arrows or lines to represent vector direction and magnitude. This method has a low spatial resolution, which limits the density of presentable data and risks obscuring characteristic features in the data.^[1][3] More sophisticated methods, such as streamlines and particle tracing techniques, can be more revealing but are highly dependent on proper seed points.^[1] Texture-based methods, like LIC, avoid these problems since they depict the entire vector field at point-like (pixel) resolution.^[1]

Compared to other integration-based techniques that compute field lines of the input vector field, LIC has the advantage that all structural features of the vector field are displayed, without the need to adapt the start and end points of field lines to the specific vector field. In other words, it shows the topology of the vector field.^{[citation needed]}

In user testing, LIC was found to be particularly good for identifying critical points.^[4]

Algorithm

Informal description

LIC causes output values to be strongly correlated along the field lines, but uncorrelated in orthogonal directions.^[1] As a result, the field lines contrast each other and stand out visually from the background.

Intuitively, the process can be understood with the following example: the flow of a vector field can be visualized by overlaying a fixed, random pattern of dark and light paint. As the flow passes by the paint, the fluid picks up some of the paint's color, averaging it with the color it has already acquired. The result is a randomly striped, smeared texture where points along the same streamline tend to have a similar color. Other physical examples include:

• whorl patterns of paint, oil, or foam on a river
• visualisation of magnetic field lines using randomly distributed iron filings
• fine sand being blown by strong wind^[5]

Formal mathematical description

Although the input vector field and the result image are discretized, it pays to look at it from a continuous viewpoint.^[1] Let ${\displaystyle \mathbf {v} }$ be the vector field given in some domain ${\displaystyle \Omega }$. Although the input vector field is typically discretized, we regard the field ${\displaystyle \mathbf {v} }$ as defined in every point of ${\displaystyle \Omega }$, i.e. we assume an interpolation. Streamlines, or more generally field lines, are tangent to the vector field in each point. They end either at the boundary of ${\displaystyle \Omega }$ or at critical points where ${\displaystyle \mathbf {v} =\mathbf {0} }$. For the sake of simplicity, critical points and boundaries are ignored in the following.

A field line ${\displaystyle {\boldsymbol {\sigma }}}$, parametrized by arc length ${\displaystyle s}$, is defined as $${\displaystyle {\frac {d{\boldsymbol {\sigma }}(s)}{ds}}={\frac {\mathbf {v} ({\boldsymbol {\sigma }}(s))}{|\mathbf {v} ({\boldsymbol {\sigma }}(s))|}}.}$$Let ${\displaystyle {\boldsymbol {\sigma }}_{\mathbf {r} }(s)}$ be the field line that passes through the point ${\displaystyle \mathbf {r} }$ for ${\displaystyle s=0}$. Then the image gray value at ${\displaystyle \mathbf {r} }$ is set to

${\displaystyle D(\mathbf {r} )=\int _{-L/2}^{L/2}k(s)N({\boldsymbol {\sigma }}_{\mathbf {r} }(s))ds}$

where ${\displaystyle k(s)}$ is the convolution kernel, ${\displaystyle N(\mathbf {r} )}$ is the noise image, and ${\displaystyle L}$ is the length of field line segment that is followed.

${\displaystyle D(\mathbf {r} )}$ has to be computed for each pixel in the LIC image. If carried out naively, this is quite expensive. First, the field lines have to be computed using a numerical method for solving ordinary differential equations, like a Runge–Kutta method, and then for each pixel the convolution along a field line segment has to be calculated.

The final image will normally be colored in some way. Typically, some scalar field in ${\displaystyle \Omega }$ (like the vector length) is used to determine the hue, while the grayscale LIC output determines the brightness.

Different choices of convolution kernels and random noise produce different textures; for example, pink noise produces a cloudy pattern where areas of higher flow stand out as smearing, suitable for weather visualization. Further refinements in the convolution can improve the quality of the image.^[6]

Programming description

Algorithmically, LIC takes a vector field and noise texture as input, and outputs a texture. The process starts by generating in the domain of the vector field a random gray level image at the desired output resolution. Then, for every pixel in this image, the forward and backward streamline of a fixed arc length is calculated. The value assigned to the current pixel is computed by a convolution of a suitable convolution kernel with the gray levels of all the noise pixels lying on a segment of this streamline. This creates a gray level LIC image.

Versions

Basic

Basic LIC visualization of a flow field

Basic LIC images are grayscale images, without color and animation. While such LIC images convey the direction of the field vectors, they do not indicate orientation; for stationary fields, this can be remedied by animation. Basic LIC images do not show the length of the vectors (or the strength of the field).

Color

LIC with color denoting velocity magnitude

The length of the vectors (or the strength of the field) is usually coded in color; alternatively, animation can be used.^[2][1]

Animation

Illustration of how LIC is animated.
Top: normal box filter (average).
Middle: sinusoidal filter at ${\displaystyle t}$.
Bottom: sinusoidal filter at ${\displaystyle t+\delta t}$.

LIC images can be animated by using a kernel that changes over time. Samples at a constant time from the streamline would still be used, but instead of averaging all pixels in a streamline with a static kernel, a ripple-like kernel constructed from a periodic function multiplied by a Hann function acting as a window (in order to prevent artifacts) is used. The periodic function is then shifted along the period to create an animation.

Fast LIC (FLIC)

The computation can be significantly accelerated by re-using parts of already computed field lines, specializing to a box function as convolution kernel ${\displaystyle k(s)}$ and avoiding redundant computations during convolution.^[1] The resulting fast LIC method can be generalized to convolution kernels that are arbitrary polynomials.^[7]

Oriented Line Integral Convolution (OLIC)

Because LIC does not encode flow orientation, it cannot distinguish between streamlines of equal direction but opposite orientation.^[8] Oriented Line Integral Convolution (OLIC) solves this issue by using a ramp-like asymmetric kernel and a low-density noise texture.^[8] The kernel asymmetrically modulates the intensity along the streamline, producing a trace that encodes orientation; the low-density of the noise texture prevents smeared traces from overlapping, aiding readability.

Fast Rendering of Oriented Line Integral Convolution (FROLIC) is a variation that approximates OLIC by rendering each trace in discrete steps instead of as a continuous smear.^[8][9]

Unsteady Flow LIC (UFLIC)

For time-dependent vector fields (unsteady flow), a variant called Unsteady Flow LIC has been designed that maintains the coherence of the flow animation.^[10] An interactive GPU-based implementation of UFLIC has been presented.^[11]

Parallel

Since the computation of an LIC image is expensive but inherently parallel, the process has been parallelized^[12] and, with availability of GPU-based implementations, interactive on PCs.

Multidimensional

Note that the domain ${\displaystyle \Omega }$ does not have to be a 2D domain: the method is applicable to higher dimensional domains using multidimensional noise fields. However, the visualization of the higher-dimensional LIC texture is problematic; one way is to use interactive exploration with 2D slices that are manually positioned and rotated. The domain ${\displaystyle \Omega }$ does not have to be flat either; the LIC texture can be computed also for arbitrarily shaped 2D surfaces in 3D space.^[13]

Applications

This technique has been applied to a wide range of problems since it first was published in 1993, both scientific and creative, including:

Representing vector fields:

• visualization of steady (time-independent) flows (streamlines)^[14]
• visual exploration of 2D autonomous dynamical systems^[15]
• wind mapping^[16]
• water flow mapping

Artistic effects for image generation and stylization:

• pencil drawing^[17] (automatic pencil drawing generation technique using LIC pencil filter^[18])
• automatic generation of hair textures^[19]
• creating marbling texture^[20]

Terrain generalization:

• creating generalized shaded relief^[21]

Implementations

• GPU Based Image Processing Tools by Raymond McGuire
• ParaView : Line Integral Convolution
• A 2D flow visualization tool based on LIC and RK4. Developed using C++ and VTK. by Andres Bejarano
• Wolfram Research (2008), LineIntegralConvolutionPlot, Wolfram Language function, https://reference.wolfram.com/language/ref/LineIntegralConvolutionPlot.html (updated 2014).

See also

• Weighted arithmetic mean

References

1. Stalling, Detlev; Hege, Hans-Christian (August 6–11, 1995). "Fast and Resolution Independent Line Integral Convolution". Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques. SIGGRAPH '95. Los Angeles, California. pp. 249–256. CiteSeerX 10.1.1.45.5526. doi:10.1145/218380.218448. ISBN 0-89791-701-4.
2. Cabral, Brian; Leedom, Leith Casey (August 2–6, 1993). "Imaging Vector Fields Using Line Integral Convolution". Proceedings of the 20th annual conference on Computer graphics and interactive techniques. SIGGRAPH '93. Anaheim, California. pp. 263–270. CiteSeerX 10.1.1.115.1636. doi:10.1145/166117.166151. ISBN 0-89791-601-8.
3. Ward, Matthew O. (February 5, 1996). "Line Integral Convolution for Flow Visualization". Worcester Polytechnic Institute. Retrieved 2024-07-21.
4. Laidlaw, David H.; Kirby, Robert M.; Davidson, J. Scott; Miller, Timothy S.; da Silva, Marco; Warren, William H.; Tarr, Michael J. (October 21–26, 2001). "Quantitative Comparative Evaluation of 2D Vector Field Visualization Methods". IEEE Visualization 2001, VIS '01. Proceedings. San Diego, CA, USA. pp. 143–150.
5. Liu, Zhanping (Aug 21, 2007). "LIC (Line Integral Convolution)". Retrieved 2024-07-21.
6. Weiskopf, Daniel (2009). "Iterative Twofold Line Integral Convolution for Texture-Based Vector Field Visualization". In Möller, Torsten; Hamann, Bernd; Russell, Robert D. (eds.). Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration. Mathematics and Visualization. Berlin, New York: Springer. pp. 191–211. CiteSeerX 10.1.1.66.3013. doi:10.1007/b106657_10. ISBN 978-3-540-25076-0.^{[dead link‍]}
7. Hege, Hans-Christian; Stalling, Detlev (1998), "Fast LIC with Piecewise Polynomial Filter Kernels", in Hege, Hans-Christian; Polthier, Konrad (eds.), Mathematical Visualization, Berlin, Heidelberg: Springer-Verlag, pp. 295–314, CiteSeerX 10.1.1.31.504, doi:10.1007/978-3-662-03567-2_22, ISBN 978-3-642-08373-0
8. Wegenkittl, Rainer; Gröller, Eduard (24 October 1997). "Fast oriented line integral convolution for vector field visualization via the Internet" (PDF). Proceedings. Visualization '97 (Cat. No. 97CB36155). pp. 309–316. doi:10.1109/VISUAL.1997.663897. ISBN 0-8186-8262-0.
9. Java Exploration Tool for Dynamical Systems by R. Wegenkittl and E. Gröller.
10. Shen, Han-Wei; Kam, David L. (1998). "A New Line Integral Convolution Algorithm for Visualizing Time-Varying Flow Fields" (PDF). IEEE Trans Vis Comput Graph. 4 (2). Los Alamitos: IEEE: 98–108. doi:10.1109/2945.694952. ISSN 1077-2626.
11. Ding, Zi'ang; Liu, Zhanping; Yu, Yang; Chen, Wei (2015). "Parallel unsteady flow line integral convolution for high-performance dense visualization". 2015 IEEE Pacific Visualization Symposium, PacificVis 2015. Hangzhou, China. pp. 25–30.
12. Zöckler, Malte; Stalling, Detlev; Hege, Hans-Christian (1997). "Parallel Line Integral Convolution" (PDF). Parallel Computing. 23 (7). Amsterdam: North Holland: 975–989. doi:10.1016/S0167-8191(97)00039-2. ISSN 0167-8191.
13. Battke, Henrik; Stalling, Detlev; Hege, Hans-Christian (1997). "Fast Line Integral Convolution for Arbitrary Surfaces in 3D". In Hege, Hans-Christian; Polthier, Konrad (eds.). Visualization and Mathematics: Experiments, Simulations, and Environments. Berlin, New York: Springer. pp. 181–195. CiteSeerX 10.1.1.71.7228. doi:10.1007/978-3-642-59195-2_12. ISBN 3-540-61269-6.
14. DAAC: Line Integral Convolution
15. Visual exploration of 2D autonomous dynamical systems Thomas Müller2,1 and Filip Sadlo1 Published 26 February 2015 • © 2015 IOP Publishing Ltd European Journal of Physics, Volume 36, Number 3
16. A real-time map of the wind in the U.S. by Fernanda Viégas and Martin Wattenberg.
17. researchgate publication: Sun, Shuo & Huang, Dongwei. (2022). Efficient Region-Based Pencil Drawing.
18. S. Yamamoto, Xiaoyang Mo and A. Imamiya, "Enhanced LIC pencil filter," Proceedings. International Conference on Computer Graphics, Imaging and Visualization, 2004. CGIV 2004., 2004, pp. 251-256, doi: 10.1109/CGIV.2004.1323994.
19. Xiaoyang Mao, M. Kikukawa, K. Kashio and A. Imamiya, "Automatic generation of hair texture with line integral convolution," 2000 IEEE Conference on Information Visualization. An International Conference on Computer Visualization and Graphics, 2000, pp. 303-308, doi: 10.1109/IV.2000.859772.
20. Xiaoyang Mao, Toshikazu Suzuki, and Atsumi Imamiya. 2003. AtelierM: a physically based interactive system for creating traditional marbling textures. In Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (GRAPHITE '03). Association for Computing Machinery, New York, NY, USA, 79–ff. https://doi.org/10.1145/604471.604489
21. Bernhard Jenny (2021) Terrain generalization with line integral convolution, Cartography and Geographic Information Science, 48:1, 78-92, DOI: 10.1080/15230406.2020.1833762