
Fast BlockMatching Registration with Entropy-based Similarity
Please use this identifier to cite or link to this publication: http://hdl.handle.net/1926/372 |
Published in The Insight Journal - 2006 July - December.
Submitted by Eduardo Suárez on 11-29-2006.
This paper describes the implementation of a multidimensional block-matching nonrigid registration algorithm. The main features of the algorithm are its simplicity, its free form nature, the modularity of the similarity measure, which makes it possible using local entropy-based similarity measures and the avoidance of the optimization module. The algorithm implementation described in this paper is based on the method by Suarez et al. This paper is accompanied with the source code, input data, parameters and output data used for validating the algorithm described in this paper.
Data
Code
Reviews
Quick Comments
Resources
![]() |
|
Download All |
Statistics more
![]() |
|
Global rating: | ![]() ![]() ![]() ![]() ![]() |
Review rating: | ![]() ![]() ![]() ![]() ![]() |
Code rating: | |
Paper Quality: |
![]() ![]() |
Information more
![]() |
|
Categories: | Deformable registration, Multi-modality registration, Registration, Registration metrics, Transforms |
Keywords: | non-rigid registration, mutual information |
Toolkits: | ITK, CMake |
Export citation: |
Share
![]() |
Linked Publications more
![]() |
||
![]() by Tustison N., Gee J.
|
||
![]() by Schmidt-Richberg A., Werner R., Handels H., Ehrhardt J.
|
View license
Loading license...
Send a message to the author
