Fast BlockMatching Registration with Entropy-based Similarity

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

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

Quick Comments


Resources
backyellow
Download All

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

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

Share
backyellow
Share

Linked Publications more
backyellow
Local Shape Analysis using MANCOVA Local Shape Analysis using MANCOVA
by Paniagua B., Styner M., Macenko M., Pantazis D., Niethammer M.
Document Object Model based XML Handling in ITK Document Object Model based XML Handling in ITK
by Gong R.H., Yaniv Z.

View license
Loading license...

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