Ticket #2244 (closed: fixed)
CompressEvents: New algorithm to reduce event workspace memory use
| Reported by: | Janik Zikovsky | Owned by: | Janik Zikovsky |
|---|---|---|---|
| Priority: | major | Milestone: | Iteration 27 |
| Component: | Mantid | Keywords: | |
| Cc: | Blocked By: | ||
| Blocking: | Tester: | Michael Whitty |
Description
Look through each event list, and lump together similar events (events with the same or possible nearly the same TOF/X value); ignore pulse-time (assume that event filtering by time has been completed).
Create a new Weighted event list and if 2 events matched, make one event with Weight = 2 and error = sqrt(2).
Possibly use "rebin"-style parameters to determine how close you consider events to be. It would be wise to use very small bins here otherwise you'd introduce inaccuracies.
Change History
comment:5 Changed 10 years ago by Janik Zikovsky
- Status changed from accepted to verify
- Resolution set to fixed
comment:6 Changed 10 years ago by Michael Whitty
- Status changed from verify to verifying
- Tester set to Michael Whitty
Note: See
TracTickets for help on using
tickets.
Additional note: for more precision, when you lump together N events into one, use the average X value (average TOF) as its new X, rather than the center of the bin provided. This will improve accuracy if it happens that 10 events are in the bin, but all close to one end, for example.