These directions have been adapted from https://gist.github.com/stupidpupil/1e88638e5240476ec1f77d4b27747c88?permalink_comment_id=2198481
For more info on some of these steps, visit https://mrchromebox.tech
- Connect the power
- Open the lid
These directions have been adapted from https://gist.github.com/stupidpupil/1e88638e5240476ec1f77d4b27747c88?permalink_comment_id=2198481
For more info on some of these steps, visit https://mrchromebox.tech
""" | |
Programmer: Chris Tralie | |
Purpose: To demonstrate a greedy furthest point sampling, which is a general technique | |
for getting good points that are "spread out" and cover the dataset well | |
""" | |
import numpy as np | |
import matplotlib.pyplot as plt | |
from sklearn.metrics.pairwise import pairwise_distances | |
def getGreedyPerm(D): |
""" | |
Programmer: Chris Tralie | |
Purpose: To use the POT library (https://github.com/rflamary/POT) | |
to compute the Entropic regularized Wasserstein distance | |
between points on a 2D grid | |
""" | |
import numpy as np | |
import matplotlib.pyplot as plt | |
import ot |
""" | |
Programmer: Chris Tralie | |
Purpose: To illustrate the dynamic time warping algorithm | |
to synchronize two 2D trajectories | |
""" | |
import numpy as np | |
import matplotlib.pyplot as plt | |
def getCSM(X, Y): | |
""" |
""" | |
Programmer: Chris Tralie | |
Purpose: To provide a basic ordered merge tree class for interval and circular domains, | |
along with methods to construct the merge tree from a time series, to plot it and | |
its associated persistence diagram, and to simplify the merge trees by persistence | |
""" | |
import numpy as np | |
import matplotlib.pyplot as plt |