MINIMUM SPANNING TREE FUSING MULTI-SALIENT POINTS HIERARCHICALLY FOR MULTI-MODALITY IMAGE REGISTRATION

Shaomin Zhang, Lijia zhi, Dazhe Zhao, Hong Zhao

Abstract

In this paper, we propose a novel registration algorithm based on minimal spanning tree. There are two novel aspects of the new method. First, instead of a single feature points, we extracted corner-like as well as edge-like points from image, and also added a few random points to cover the low contrast regions; Second, the hierarchical mechanism which fusing multi-salient points is used to drive the registration during the registration procedure. The new algorithm has solved the low robustness brought by the instability of extraction of feature points and the speed bottleneck problem when using MST to estimate the Rényi entropy. Experiment results show that on the simulated and real brain datasets, the algorithm achieves better robustness while maintaining good registration accuracy.

References

  1. Beirlant, J., Dudewicz, E. J., Gyorfi, L., and van der Meulen, E.C. (1997). Nonparametric entropy estimation: An overview. International Journal of Mathematical and Statistical Sciences, 6(1):17-39.
  2. Collins,D.L., Zijdenbos,A.P., Kollokian,V., Sled, J.G., Kabani, N.L., Holmes, C.J., and Evans, A.C. (1998). Design and construction of a realistic digital brain phantom. IEEE Trans. Med. Imag., 17:463-468.
  3. Harris, C., Stephens, M. (1988). A Combined Corner and Edge Detector. In Alvey Vision Conference, pages 147-151.
  4. Hero, A., Ma, B., Michel, O., and Gorman, J. (2002). Applications of entropic spanning graphs. IEEE Signal Processing Magazine, 19(5):85-95.
  5. Ma, B., Hero, A., Gorman, J., and Michel, O. (2000). Image registration with minimal spanning tree algorithm. In ICIP.
  6. Miller, E. (2003). A new class of entropy estimators for mult-dimensional densities. In Proc. ICASSP.
  7. Redmond, C., Yukich, J. (1996). Asymptotics for Euclidean functionals with power weighted edges. Stochastic Processes and their Applications, 61(2):289-304.
  8. Sabuncu, M. R., Ramadge, P.J. (2004). Gradient based nonuniform subsampling for information-theoretic alignment methods. In EMBC.
  9. Sabuncu, M. R., Ramadge, P. J. (2008). Using Spanning Graphs for Efficient Image Registration. IEEE Transactions on Image Processing, 17(5):788-797.
  10. Shen, D., Davatzikos, C. (2002). HAMMER: hierarchical attribute matching mechanism for elastic registration. IEEE Trans. Med. Imaging, 21(11): 1421-1439.
  11. Steele, J. M. (1988). Growth rate of Euclidean minimal spanning trees with power weighted edges. Ann. Probab., pages 1767-1787.
  12. Yang, G., Stewart, C., Sofka, M., Tsai C. (2007). Registration of challenging image pairs: initialization, estimation, and decision. IEEE Trans. Pattern Anal. Mach. Intell., 29(11):1973-1989.
Download


Paper Citation


in Harvard Style

Zhang S., zhi L., Zhao D. and Zhao H. (2010). MINIMUM SPANNING TREE FUSING MULTI-SALIENT POINTS HIERARCHICALLY FOR MULTI-MODALITY IMAGE REGISTRATION . In Proceedings of the International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP, (VISIGRAPP 2010) ISBN 978-989-674-029-0, pages 33-36. DOI: 10.5220/0002820700330036


in Bibtex Style

@conference{visapp10,
author={Shaomin Zhang and Lijia zhi and Dazhe Zhao and Hong Zhao},
title={MINIMUM SPANNING TREE FUSING MULTI-SALIENT POINTS HIERARCHICALLY FOR MULTI-MODALITY IMAGE REGISTRATION},
booktitle={Proceedings of the International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP, (VISIGRAPP 2010)},
year={2010},
pages={33-36},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002820700330036},
isbn={978-989-674-029-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP, (VISIGRAPP 2010)
TI - MINIMUM SPANNING TREE FUSING MULTI-SALIENT POINTS HIERARCHICALLY FOR MULTI-MODALITY IMAGE REGISTRATION
SN - 978-989-674-029-0
AU - Zhang S.
AU - zhi L.
AU - Zhao D.
AU - Zhao H.
PY - 2010
SP - 33
EP - 36
DO - 10.5220/0002820700330036