trackpy.link¶

trackpy.link(levels, search_range, hash_generator, memory=0, track_cls=None, neighbor_strategy='BTree', link_strategy='recursive')¶

Link features into trajectories, assigning a label to each trajectory.

This function is deprecated and lacks some recently-added options, though it is still accurate. Use link_df or link_iter.

Parameters:

Parameters:	levels : iterable of iterables containing Points objects e.g., a list containing lists with the Points in each frame search_range : float the maximum distance features can move between frames hash_generator : a function that returns a HashTable only used if neighbor_strategy is set to ‘BTree’ (default) memory : integer the maximum number of frames during which a feature can vanish, then reppear nearby, and be considered the same particle. 0 by default. neighbor_strategy : {‘BTree’, ‘KDTree’} algorithm used to identify nearby features link_strategy : {‘recursive’, ‘nonrecursive’, ‘numba’, ‘drop’, ‘auto’} algorithm used to resolve subnetworks of nearby particles ‘auto’ uses numba if available ‘drop’ causes particles in subnetworks to go unlinked
Returns:	tracks : list of Track (or track_cls) objects

levels : iterable of iterables containing Points objects

e.g., a list containing lists with the Points in each frame

search_range : float

the maximum distance features can move between frames

hash_generator : a function that returns a HashTable

only used if neighbor_strategy is set to ‘BTree’ (default)

memory : integer

the maximum number of frames during which a feature can vanish, then reppear nearby, and be considered the same particle. 0 by default.

neighbor_strategy : {‘BTree’, ‘KDTree’}

algorithm used to identify nearby features

link_strategy : {‘recursive’, ‘nonrecursive’, ‘numba’, ‘drop’, ‘auto’}

algorithm used to resolve subnetworks of nearby particles ‘auto’ uses numba if available ‘drop’ causes particles in subnetworks to go unlinked

Returns:

tracks : list of Track (or track_cls) objects