CoherentStructures

KO | EN

gitlite — search

#javascript #python #hacktoberfest #react #ai #typescript #llm #go #golang #android #machine-learning #rust #deep-learning #linux

CoherentStructures

★ 17 Open GitHub ↗

Algorithms for identifying coherent structures in sparse and noisy trajectory datasets

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# CoherentStructures

This code accompanies the paper [Detecting Lagrangian coherent structures from sparse and noisy trajectory data](https://arxiv.org/abs/2110.10884) by Mowlavi, Serra, Maiorino, and Mahadevan (2021).

We provide algorithms for the identification of Lagrangian Coherent Structures (LCSs) of hyperbolic and elliptic nature – see figure below – in flows characterized by sparse and noisy particle trajectory datasets, such as those obtained from experiments. Hyperbolic LCSs are surfaces along which the local separation rate between neighboring particles is maximized or minimized. Elliptic LCSs are surfaces enclosing regions of coherent global dynamics, that is, regions inside of which particles move together over time.

The algorithms, which take as input trajectory data for an ensemble of particles, are located in the Python modules hyperbolic.py and elliptic.py in functions/. Their use is demonstrated through two of the examples shown in the paper, the Bickley jet and ABC flow.

![sketch](https://raw.githubusercontent.com/smowlavi/CoherentStructures/main/sketch.png)

## Main files

* **hyperbolic_Bickley** and **hyperbolic_ABC** compute hyperbolic LCSs in the Bickley jet and ABC flow, using the trajectory datasets hyperbolic_Bickley.mat and hyperbolic_ABC.mat

* **elliptic_Bickley** and **elliptic_ABC** compute elliptic LCSs in the Bickley jet and ABC flow, using the trajectory datasets elliptic_Bickley.mat and elliptic_ABC.mat

* **elliptic_Bickley_sweep** and **elliptic_ABC_sweep** evaluate the sensitivity of the computed elliptic LCSs with respect to the clustering parameters, helping select appropriate values for the latter

## Notes

1. The first time that an elliptic LCS is computed for a given dataset, a matrix of pairwise distances between all trajectories is computed and stored in a file named after the data file containing original dataset, appended with '_Dij'. This computation might take some time (about 30 min for the provided ABC example), but only needs to be carried out once.

2. The algorithms for identifying hyperbolic and elliptic LCSs can be applied to the same trajectory dataset. However, getting high quality results requires a higher spatial resolution (i.e. more trajectories) for hyperbolic LCSs, and a higher temporal resolution (i.e. more time frames) for elliptic LCSs. Thus, the examples we provide contain different datasets for the two types of LCSs, which reproduce the results in figures 4, 5, 6, 7 of the paper for the case without noise.

## Dependencies

* [pandas](https://pandas.pydata.org): A data manipulation library.
* [scikit-learn](https://scikit-learn.org/): A machine learning library.
* [tqdm](https://pypi.org/project/tqdm/): A progress meter for loops.
* [seaborn](https://pypi.org/project/tqdm/): A data visualization library.
* [Numba](https://numba.pydata.org): A JIT compiler for Python functions.

## Citing the project

If you use the code, we kindly ask that you cite the paper using the following reference:

```bibtex
@article{coherentstructures,
  author = {Mowlavi, Saviz and Serra, Mattia and Maiorino, Enrico and Mahadevan, L},
  title = {Detecting Lagrangian coherent structures from sparse and noisy trajectory data},
  year = {2021},
  journal = {arXiv preprint arXiv:2110.10884}
}
```

CoherentStructures

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README