threshold_li(image, *, tolerance=None, initial_guess=None, iter_callback=None)
Input image.
Finish the computation when the change in the threshold in an iteration is less than this value. By default, this is half the smallest difference between intensity values in image
.
Li's iterative method uses gradient descent to find the optimal threshold. If the image intensity histogram contains more than two modes (peaks), the gradient descent could get stuck in a local optimum. An initial guess for the iteration can help the algorithm find the globally-optimal threshold. A float value defines a specific start point, while a callable should take in an array of image intensities and return a float value. Example valid callables include numpy.mean
(default), lambda arr: numpy.quantile(arr, 0.95)
, or even skimage.filters.threshold_otsu
.
A function that will be called on the threshold at every iteration of the algorithm.
Upper threshold value. All pixels with an intensity higher than this value are assumed to be foreground.
Compute threshold value by Li's iterative Minimum Cross Entropy method.
>>> from skimage.data import cameraSee :
... image = camera()
... thresh = threshold_li(image)
... binary = image > thresh
The following pages refer to to this document either explicitly or contain code examples using this.
skimage.filters.thresholding.threshold_li
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them