Difference between revisions of "Projects:RegistrationImprovement:RecursiveScheme"
From NAMIC Wiki
(Created page with 'Both multi-resolution and the sequence of calls with increasing DOF could be implemented as a single recursive scheme. The caller provides an array of DOF and a matching array of…') |
|||
Line 1: | Line 1: | ||
Both multi-resolution and the sequence of calls with increasing DOF could be implemented as a single recursive scheme. The caller provides an array of DOF and a matching array of resolution levels, which is processed by recursive calls with the first/last element taken from the list. | Both multi-resolution and the sequence of calls with increasing DOF could be implemented as a single recursive scheme. The caller provides an array of DOF and a matching array of resolution levels, which is processed by recursive calls with the first/last element taken from the list. | ||
− | *A simulation Matlab program and example is here: [[Media:DOFHierarchy.m]] | + | *A simulation Matlab program and example is here: [[Media:DOFHierarchy.m]] |
*Example call | *Example call | ||
a = DOFHierarchy(256, [6,9,12],'NoInit',[4,3,2],0) | a = DOFHierarchy(256, [6,9,12],'NoInit',[4,3,2],0) | ||
− | + | ||
− | + | running registration for 32 image at 6 DOF with init NoInit | |
− | + | running registration for 64 image at 6 DOF with init result from 6 DOF run @ 32 | |
− | + | running registration for 128 image at 6 DOF with init result from 6 DOF run @ 64 | |
− | + | running registration for 256 image at 6 DOF with init result from 6 DOF run @ 128 | |
− | + | ||
− | + | running registration for 64 image at 9 DOF with init result from 6 DOF run @ 256 | |
− | + | running registration for 128 image at 9 DOF with init result from 9 DOF run @ 64 | |
− | + | running registration for 256 image at 9 DOF with init result from 9 DOF run @ 128 | |
+ | |||
+ | running registration for 128 image at 12 DOF with init result from 9 DOF run @ 256 | ||
+ | running registration for 256 image at 12 DOF with init result from 12 DOF run @ 128 |
Revision as of 16:26, 22 September 2009
Home < Projects:RegistrationImprovement:RecursiveSchemeBoth multi-resolution and the sequence of calls with increasing DOF could be implemented as a single recursive scheme. The caller provides an array of DOF and a matching array of resolution levels, which is processed by recursive calls with the first/last element taken from the list.
- A simulation Matlab program and example is here: Media:DOFHierarchy.m
- Example call
a = DOFHierarchy(256, [6,9,12],'NoInit',[4,3,2],0) running registration for 32 image at 6 DOF with init NoInit running registration for 64 image at 6 DOF with init result from 6 DOF run @ 32 running registration for 128 image at 6 DOF with init result from 6 DOF run @ 64 running registration for 256 image at 6 DOF with init result from 6 DOF run @ 128 running registration for 64 image at 9 DOF with init result from 6 DOF run @ 256 running registration for 128 image at 9 DOF with init result from 9 DOF run @ 64 running registration for 256 image at 9 DOF with init result from 9 DOF run @ 128 running registration for 128 image at 12 DOF with init result from 9 DOF run @ 256 running registration for 256 image at 12 DOF with init result from 12 DOF run @ 128