Difference between revisions of "Event:2011-Registration-Retreat-Sunday"
From NAMIC Wiki
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| + | [[Event:2011_Registration_Retreat#Sunday| Back to Registration Brainstorming 2011]] | ||
| + | |||
=Organizational Meeting= | =Organizational Meeting= | ||
*Current algorithms are designed for mapping brains of healthy volunteers into each other | *Current algorithms are designed for mapping brains of healthy volunteers into each other | ||
| Line 4: | Line 6: | ||
**are robust and EASY to use | **are robust and EASY to use | ||
**can handle sliding organs | **can handle sliding organs | ||
| − | **can handle changes introduced | + | **can handle changes introduced by a procedure |
| + | *We will need to distinguish between unsolved algorithm problems and unfinished application engineering. | ||
| + | *Segmentation and registration are linked problems. Usually, when you have solved one, you can solve the others. | ||
| + | *What are problems that should be pushed to the user interface and what are problems that should be adressed with algorithms | ||
Latest revision as of 13:02, 20 February 2011
Home < Event:2011-Registration-Retreat-SundayBack to Registration Brainstorming 2011
Organizational Meeting
- Current algorithms are designed for mapping brains of healthy volunteers into each other
- We need algorithms that
- are robust and EASY to use
- can handle sliding organs
- can handle changes introduced by a procedure
- We will need to distinguish between unsolved algorithm problems and unfinished application engineering.
- Segmentation and registration are linked problems. Usually, when you have solved one, you can solve the others.
- What are problems that should be pushed to the user interface and what are problems that should be adressed with algorithms
