- denoising RGB is now possible, and "colored patches" are then compared
- the main function is now in a pure Python file so that default values
of kw arguments are visible in the help
- reduced the number of computations of patches bound (but this doesn't
change much the total speed).
- added an example for the gallery
I also played with functions that could replace the exponential by a
faster and less precise function, but it turns out that most of the time
is spent in additions and multiplications when computing the distance
between two patches.
Better explanation of technique in plot_windowed_histogram example, along with (hopefully correct) citations.
Relevant additions to release_dev.txt and CONTRIBUTORS.txt.
It used to be able to output uint8 histogram, whose max pixel counts of 255 could easily overflow. Addressed by limiting the output type to float.
Normalized histograms are now generated, otherwise behaviour is unpredictable at boundaries or when pixels are not permitted by a mask.
The new optional n_bins parameter allows the caller to specify the size of the histogram generated. Having it fixed to image.max()+1 could result in feature vectors being shorter than desired just due to a value not being used in an image.
An example has been added to the docs, that demonstrates the application of windows histograms in object matching; a single coin is extracted and found by chi squared histogram matching.
Adding endpoint to theta make iradon (FBP) reсonstraction worse (adding 2 vertical lines at the edge of phantom).
This is misleading, that the iradon (FBP) is much worse than iradon_sart (SART) , and it is not.
emmanuelle