Average patterns with adjacent patterns to reduce noise about kikuchipy HOT 4 CLOSED

Comment to 2): Are you thinking about solving that by adding a conditional statement: only use pixel for averaging if the difference between them (abs of subtract) is lower than some threshold?

from kikuchipy.

Yes, a suggested value should be default, however I should be able to overwrite this.

The 'pattern difference' procedure as explained by Wright et al. in the article referenced above:

1. Convert each pattern to a column vector.
2. Subtract the average intensity of each pattern from each vector component.
3. Normalise the column vector.
4. Calculate difference between two patterns by calculating the dot product between the two normalised column vectors.
5. Subtract the resulting difference value from 1 so that 0 indicates no difference and 1 represents the maximum difference.
6. Average the resulting eight difference values for each pattern to its eight adjacent patterns to obtain final difference value

from kikuchipy.

Should use dask.map_overlap for this: https://docs.dask.org/en/latest/array-overlap.html#dask.array.map_overlap.

from kikuchipy.

This is now possible with kikuchipy.signals.ebsd.EBSD.average_neighbour_patterns().

from kikuchipy.