Table 3. Indexing results for the different data sets tested.
dsp: d-spacing ranking; strf: structure-factor ranking; pm: pair matching; tm: triplet matching. For each indexing option, the percentage of successfully indexed frames and the average indexing time per pattern (s) are given.
| Data set name | Monochromatic | 4% | 50% | LaueDET-50/60 | LaueDET-90 | |
|---|---|---|---|---|---|---|
| Energy range (keV) | 17.75 | 16.9–17.7 | 10–17 | 5–24 | 5–24 | |
| Setup No. | (1) | (2) | (3) | (4) | (5) | |
| Sanidine | dsp-pm | 96, 13.2 | 100, 0.7 | 100, 0.7 | 100, 1.6 | |
| dsp-tm | 65, 25.1 | 100, 1.8 | 100, 1.1 | 100, 2.0 | ||
| strf-pm | 99, 12.4 | 100, 0.7 | 100, 0.7 | 100, 1.3 | ||
| strf-tm | 79, 25.1 | 100, 1.5 | 100, 1.4 | 100, 0.8 | ||
| CsPt | dsp-pm | 87, 3.0 | 100, 2.8 | 100, 1.4 | ||
| dsp-tm | 55, 6.3 | 93, 6.8 | 100, 1.6 | |||
| strf-pm | 85, 3.2 | 97, 2.8 | 100, 5.3 | |||
| strf-tm | 55, 6.2 | 89, 5.8 | 100, 5.4 | |||
| ZrPOF | dsp-pm | 75, 38.8/53, 19.4† | 76, 432 | |||
| dsp-tm | 40, 191.1/20, 95.6† | 76, 78 | ||||
| strf-pm | 95, 31.3/80, 15.7† | 76, 33.5 | ||||
| strf-tm | 40, 178.2/28, 89.1† | 82, 24.9 | ||||
| ZSM-5‡ | dsp-pm | 85, 4.8 | 98, 8.6 | 73, 378.5 | ||
| dsp-tm | 37, 15.5 | 78, 85.7 | 65, 301.7 | 93, 56.7 | 79, 672.5 | |
| strf-pm | 82, 5.2 | 92, 8.2 | 100, 17.4 | 100, 8.4 | 95, 68.0 | |
| strf-tm | 42, 15.2 | 71, 108.2 | 100, 3.6 | 100, 7.2 | 100, 35.7 | |
| MgAc | dsp-pm | |||||
| dsp-tm | 90, 138.0 | 57, 550.0 | ||||
| strf-pm | 90, 72.6 | 65, 271.1 | ||||
| strf-tm | 97, 10.2 | 86, 108.4 | ||||
For the monochromatic data set of ZrPOF, the algorithm is looking for two orientations in each pattern sequentially. The first two numbers correspond to the percentage of success if at least one orientation per pattern was indexed and the indexing time per pattern (20 in total), and the last two numbers to the percentage of success per orientation indexed and the indexing time per orientation (40 in total).
For ZSM-5, the solutions where the a and b axes are reversed were accepted as correct (the flipped solution can be checked in an additional step, and correct indexing is usually the one where more reflections are indexed).