This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
processing:indexing_with_grainspotter [2023/03/14 11:08] smerkel |
processing:indexing_with_grainspotter [2023/03/16 12:10] (current) smerkel |
||
---|---|---|---|
Line 50: | Line 50: | ||
* results will be saved in ''grains-I-found.log'' | * results will be saved in ''grains-I-found.log'' | ||
* cuts are as follow | * cuts are as follow | ||
- | * es | + | * 15 peaks, minimum per grain, |
+ | * 30% completeness minimum, which is quite low but diamond anvil cells have shadows, peaks may be hidden by the pressure medium, etc. If the completeness restriction is too high, you will not find enough grains, | ||
+ | * 50% uniqueness: has no effect in the experiments we performed, | ||
+ | * uncertainties: 0.02° in 2θ, 1° in η and 2° in ω, which are all multiplied by a nσ of 2 (line below) | ||
+ | * tries for 10000 random orientations and stops, | ||
<code> | <code> | ||
Line 63: | Line 67: | ||
omegarange -28 28 ! omegarange [min max] degrees, multiple ranges can be specified | omegarange -28 28 ! omegarange [min max] degrees, multiple ranges can be specified | ||
filespecs peaks-I-Want-To-Index.gve grains-I-found.log ! filespecs [gvecsfile grainsfile] | filespecs peaks-I-Want-To-Index.gve grains-I-found.log ! filespecs [gvecsfile grainsfile] | ||
- | cuts 10 0.3 0.5 ! cuts [min_measuments min_completeness min_uniqueness] | + | cuts 15 0.3 0.5 ! cuts [min_measuments min_completeness min_uniqueness] |
eulerstep 5 ! eulerstep [stepsize] : angle step size in Euler space | eulerstep 5 ! eulerstep [stepsize] : angle step size in Euler space | ||
uncertainties 0.02 1 2 ! uncertainties [sigma_tth sigma_eta sigma_omega] in degrees | uncertainties 0.02 1 2 ! uncertainties [sigma_tth sigma_eta sigma_omega] in degrees | ||
Line 74: | Line 78: | ||
</code> | </code> | ||
+ | ======Loops with GrainSpotter====== | ||
+ | It can be efficients to run multiple loops of grainspotter indexings. The underlying concept is as follow | ||
+ | * Step 1: | ||
+ | * run grainspotter with a given set of specifications, remove all indexed peaks from the GVE file, | ||
+ | * repeat the above operation X times, | ||
+ | * this will provide a first set of grains, which should be the most reliable | ||
+ | * Step 2: | ||
+ | * Lower the tolerance, and repeat X loops of indexings, remove indexed peaks at each step | ||
+ | * this will provide a second set of grains, which may have to be checked | ||
+ | * Repeat steps above, lowering tolerances progressively in order to optimize the number of indexed grains, while making sure that all indexed grains make sense | ||
+ | * Combined the results of all indexings into one main log file, with all indexed files from the loop. | ||
+ | |||
+ | There are several TIMEleSS tools to help you with this process | ||
+ | * [[processing:remove-used-gve-updated|timelessClearGVEGrains]] | ||
+ | * [[processing:grainspotter-merge|Merge GrainSpotter output files]] | ||
+ | * [[processing:extracteulerangles|ExtractEulerAngles.py]] | ||
+ | |||
+ | An example of a GrainSpotter loop is provided in a [[processing:advanced_indexing_with_grainspotter|dedicated page]]. |