Difference between revisions of "Talk:Segmentation/Autoselected Segmentation"
| Line 26: | Line 26: | ||
|} | |} | ||
| − | + | Once you have your array of segmentations, you need a function to determine how good the data in that segmentation is. One simple way to do that is with what's called the Crest Factor. This is just the ratio of the peak data to the root-mean-squared value of the data (square root of ((the sum of each element's square) divided by the number of elements)). | |
| + | |||
| + | The segmentation that returns the most useful data (as determined by the Crest Factor) is used either for dodging or aiming, depending on what you need. | ||
(to be completed later) | (to be completed later) | ||
Revision as of 04:14, 15 June 2009
Automatic Segmentation is a concept proposed on the old wiki by Fractal. You start with a list of segmentation axes:
- Lateral Velocity (LV)
- Acceleration (A)
- Time Since Reversal (TSR)
You assemble all combinations of segments into a long list of every segmentation that uses these three axes:
| Segmentation | Depth |
|---|---|
| (no segmentation) | 0 |
| LV | 1 |
| A | 1 |
| TSR | 1 |
| LV / A | 2 |
| LV / TSR | 2 |
| A / TSR | 2 |
| LV / A / TSR | 3 |
Once you have your array of segmentations, you need a function to determine how good the data in that segmentation is. One simple way to do that is with what's called the Crest Factor. This is just the ratio of the peak data to the root-mean-squared value of the data (square root of ((the sum of each element's square) divided by the number of elements)).
The segmentation that returns the most useful data (as determined by the Crest Factor) is used either for dodging or aiming, depending on what you need.
(to be completed later)
