Quad-tree based entropy estimator for fast and robust brain image registration

Authors:
Žiga Špiclin;Boštjan Likar;Franjo Pernuš
Affiliations:
Faculty of Electrical Engineering, Laboratory of Imaging Technologies, University of Ljubljana, Ljubljana, Slovenia;Faculty of Electrical Engineering, Laboratory of Imaging Technologies, University of Ljubljana, Ljubljana, Slovenia;Faculty of Electrical Engineering, Laboratory of Imaging Technologies, University of Ljubljana, Ljubljana, Slovenia
Venue:
WBIR'12 Proceedings of the 5th international conference on Biomedical Image Registration
Year:
2012

Citing 4
Cited 0

Alignment by maximization of mutual information

Alignment by maximization of mutual information
Image matching using alpha-entropy measures and entropic graphs

Signal Processing - Special section on content-based image and video retrieval
Approximate all nearest neighbor search for high dimensional entropy estimation for image registration

Signal Processing
Using Spanning Graphs for Efficient Image Registration

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The performances of information-theoretic multi-modality image registration methods crucially depend on the model representing the joint density function of the co-occurring image intensities and on the implementation of the entropy estimator. We proposed an entropy estimator for image registration based on quad-tree (QT) that is essentially an entropic graph entropy estimator, but can be adapted to work as a plug-in entropy estimator. This duality was achieved by incorporating the Hilbert kernel density estimator. Results of 3-D rigid-body registration of multi-modal brain volumes indicate that the proposed methods achieve similar accuracies as the registration method based on minimal spanning tree (MST), but have a higher success rate and a higher capture range. Although the MST and QT have similar computational complexities, the QT-based methods had about 50% shorter registration times.