Fast BlockMatching Registration with Entropy-based Similarity

Please use this identifier to cite or link to this publication:
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.
minus 2 Files (381Kb)
There is no code review at this time.

There is no review at this time. Be the first to review this publication!

Quick Comments

Download All

Statistics more
Global rating: starstarstarstarstar
Review rating: starstarstarstarstar [review]
Code rating:
Paper Quality: plus minus

Information more
Categories: Deformable registration, Multi-modality registration, Registration, Registration metrics, Transforms
Keywords: non-rigid registration, mutual information
Toolkits: ITK, CMake
Export citation:


Linked Publications more
N4ITK:  Nick's N3 ITK Implementation For MRI Bias Field Correction N4ITK: Nick's N3 ITK Implementation For MRI Bias Field Correction
by Tustison N., Gee J.
A Flexible Variational Registration Framework A Flexible Variational Registration Framework
by Schmidt-Richberg A., Werner R., Handels H., Ehrhardt J.

View license
Loading license...

Send a message to the author
ISSN 2327-770X
Powered by Midas