provide automatic "sensible" number of subsets for OS algorithms
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 160
- Forks
- 113
- Avg merge
- 12d 15h
- Merged PRs (30d)
- 1
Description
It would be convenient to be able to use .par files that work for all (or at least most) scanners, e.g. for scatter. For OS algorithms like OSEM, OSMAPOSL and even OSSPS, the admissible number of subsets is determined by the number of views and symmetry settings. Possibly we could provide a new keyword for these algorithms (or is it in GeneralisedObjectiveFunction?) like
choose number of subsets automatically := 1
or (a bit harder for the parsing, but doable)
number of subsets:=automatic
We would then need to have some rule to determine this, but I'd suggest to keep this really simple, e.g. not depend on counts etc, but just on geometry.
@robbietuk what do you think?
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading the parameter handling for OSEM, OSMAPOSL, and OSSPS, along with GeneralisedObjectiveFunction, to determine where an automatic subset setting belongs. Define a simple geometry-based rule that works across scanners, then verify the chosen setting through the existing .par workflows, including scatter.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- computer-vision
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100