To remove in the future –– skimage.filters.rank.generic
These filters compute the local histogram at each pixel, using a sliding window similar to the method described in . A histogram is built using a moving window in order to limit redundant computation. The moving window follows a snake-like path:
...------------------------\ /--------------------------/ \--------------------------...
The local histogram is updated at each pixel as the structuring element window moves by, i.e. only those pixels entering and leaving the structuring element update the local histogram. The histogram size is 8-bit (256 bins) for 8-bit images and 2- to 16-bit for 16-bit images depending on the maximum value of the image.
The filter is applied up to the image border, the neighborhood used is adjusted accordingly. The user may provide a mask image (same size as input image) where non zero values are the part of the image participating in the histogram computation. By default the entire image is filtered.
This implementation outperforms skimage.morphology.dilation
for large structuring elements.
Input images will be cast in unsigned 8-bit integer or unsigned 16-bit integer if necessary. The number of histogram bins is then determined from the maximum value present in the image. Eventually, the output image is cast in the input dtype, or the output_dtype
if set.
add simple examples, adapt documentation on existing examples
add/check existing doc
adapting tests for each type of filter
<Unimplemented 'footnote' '.. [1] Huang, T. ,Yang, G. ; Tang, G.. "A fast two-dimensional\n median filtering algorithm", IEEE Transactions on Acoustics, Speech and\n Signal Processing, Feb 1979. Volume: 27 , Issue: 1, Page(s): 13 - 18.'>
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