Difference between revisions of "2016 Winter Project Week/Projects/PatchRegistration"
From NAMIC Wiki
| Line 26: | Line 26: | ||
| | | | ||
<!-- Add a bulleted list of key points --> | <!-- Add a bulleted list of key points --> | ||
| − | * | + | * We have an implementation of patch-based discrete registration using a standard patch distance metric. We'll start by evaluating this current metric on isotropic images |
| + | |||
| + | * We'll develop a new metric for sparse images and test it out. | ||
| | | | ||
<!-- Fill this out at the end of Project Week; describe what you did this week and what you plan to do next --> | <!-- Fill this out at the end of Project Week; describe what you did this week and what you plan to do next --> | ||
* | * | ||
|} | |} | ||
Revision as of 18:20, 4 January 2016
Home < 2016 Winter Project Week < Projects < PatchRegistration
Clinical Stroke Image
Key Investigators
- Adrian Dalca (MIT)
- Andreea Bobu (MIT)
- Polina Golland (MIT)
Project Description
Due to the low quality of clinical images (often with many artifacts, 7mm thick slices, etc), most standard algorithms, such as those for registration, segmentation, and analysis, will fail. In part, this is because registration algorithm depend on assumptions of smooth anatomical structures and good quality images, which are not present in these sparse clinical acquisitions. Here, we are investigating a patch-based discrete image registration which allows for more versatile image metrics and does not impose similar assumptions.
| Objective | Approach and Plan | Progress and Next Steps |
|---|---|---|
|
|
|
