openalea.eartrack.eartrack.find_cross_route(skeleton, begin)[source]

Perform shortest path algorithm on skeleton image unknowing upper node

Find the shortest route on a skeleton between a beginning pixel and the upper cross on the skeleton using graph shortest path algorithm :param skeleton: (numpy 2D array of binary uint8) representing the skeleton of side view image of a maize plant :param begin: (list of 2 int) pixel of the bottom of the stem :return: (list of list of 2 int) list of all the pixels to follow to get the shortest path between begin and upper cross