# Comparative Visualization of Vector Field Ensembles Based on Longest Common Subsequence

## Abstract

We propose a longest common subsequence (LCS) based approach to compute the distance among vector field ensembles. By measuring how many common blocks the ensemble pathlines passing through, the LCS distance defines the similarity among vector field ensembles by counting the number of sharing domain data blocks. Compared to the traditional methods (e.g. point-wise Euclidean distance or dynamic time warping distance), the proposed approach is robust to outlier, data missing, and sampling rate of pathline timestep. Taking the advantages of smaller and reusable intermediate output, visualization based on the proposed LCS approach revealing temporal trends in the data at low storage cost, and avoiding tracing pathlines repeatedly. Finally, we evaluate our method on both synthetic data and simulation data, which demonstrate the robustness of the proposed approach.

- Authors:

- Publication Date:

- Research Org.:
- Argonne National Lab. (ANL), Argonne, IL (United States)

- Sponsoring Org.:
- National Natural Science Foundation of China (NNSFC); USDOE Office of Science (SC)

- OSTI Identifier:
- 1366297

- DOE Contract Number:
- AC02-06CH11357

- Resource Type:
- Conference

- Resource Relation:
- Conference: 9th IEEE Pacific Visualization Symposium , 04/19/16 - 04/22/16, Taipei, TW

- Country of Publication:
- United States

- Language:
- English

### Citation Formats

```
Liu, Richen, Guo, Hanqi, Zhang, Jiang, and Yuan, Xiaoru.
```*Comparative Visualization of Vector Field Ensembles Based on Longest Common Subsequence*. United States: N. p., 2016.
Web. doi:10.1109/PACIFICVIS.2016.7465256.

```
Liu, Richen, Guo, Hanqi, Zhang, Jiang, & Yuan, Xiaoru.
```*Comparative Visualization of Vector Field Ensembles Based on Longest Common Subsequence*. United States. doi:10.1109/PACIFICVIS.2016.7465256.

```
Liu, Richen, Guo, Hanqi, Zhang, Jiang, and Yuan, Xiaoru. Tue .
"Comparative Visualization of Vector Field Ensembles Based on Longest Common Subsequence". United States. doi:10.1109/PACIFICVIS.2016.7465256. https://www.osti.gov/servlets/purl/1366297.
```

```
@article{osti_1366297,
```

title = {Comparative Visualization of Vector Field Ensembles Based on Longest Common Subsequence},

author = {Liu, Richen and Guo, Hanqi and Zhang, Jiang and Yuan, Xiaoru},

abstractNote = {We propose a longest common subsequence (LCS) based approach to compute the distance among vector field ensembles. By measuring how many common blocks the ensemble pathlines passing through, the LCS distance defines the similarity among vector field ensembles by counting the number of sharing domain data blocks. Compared to the traditional methods (e.g. point-wise Euclidean distance or dynamic time warping distance), the proposed approach is robust to outlier, data missing, and sampling rate of pathline timestep. Taking the advantages of smaller and reusable intermediate output, visualization based on the proposed LCS approach revealing temporal trends in the data at low storage cost, and avoiding tracing pathlines repeatedly. Finally, we evaluate our method on both synthetic data and simulation data, which demonstrate the robustness of the proposed approach.},

doi = {10.1109/PACIFICVIS.2016.7465256},

journal = {},

number = ,

volume = ,

place = {United States},

year = {2016},

month = {4}

}