You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Useful e.g. when deciding with which adjacent patterns to average each pattern, to avoid averaging across a grain boundary, as per the discussion in #13. A pattern difference map in itself is rich in information, and is comparable to e.g. a kernel average misorientation map or grain boundary map.
Subtract the average intensity of each pattern from each vector component.
Normalise the column vector.
Calculate difference between two patterns by calculating the dot product between the two normalised column vectors.
Subtract the resulting difference value from 1 so that 0 indicates no difference and 1 represents the maximum difference.
Average the resulting eight difference values for each pattern to its eight adjacent patterns to obtain final difference value
Edit
This is similar to obtaining the normalized cross-correlation (NCC) coeffienct or normalized dot product (NDP). We should have general implementations of both. Should implement them together since they are mainly used for the same puproses. Implementations should be so that they can be used in multiple applications in KikuchiPy. See #116 and #117 for example uses.
Note that normalized and zero-normalized correlation is already present in the kikuchipy.util.pattern_similarity, however it is not used by the EBSD class yet. Future similarity methods should be implemented there.
Useful e.g. when deciding with which adjacent patterns to average each pattern, to avoid averaging across a grain boundary, as per the discussion in #13. A pattern difference map in itself is rich in information, and is comparable to e.g. a kernel average misorientation map or grain boundary map.
The 'pattern difference' procedure as explained by Wright et al. (https://doi.org/10.1016/j.ultramic.2014.10.002):
Edit
This is similar to obtaining the normalized cross-correlation (NCC) coeffienct or normalized dot product (NDP). We should have general implementations of both. Should implement them together since they are mainly used for the same puproses. Implementations should be so that they can be used in multiple applications in KikuchiPy. See #116 and #117 for example uses.
To do:
The text was updated successfully, but these errors were encountered: