Image Registration and Segmentation by Maximizing the Jensen-Rényi Divergence

  • A. Ben Hamza
  • Hamid Krim
Conference paper

DOI: 10.1007/978-3-540-45063-4_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2683)
Cite this paper as:
Hamza A.B., Krim H. (2003) Image Registration and Segmentation by Maximizing the Jensen-Rényi Divergence. In: Rangarajan A., Figueiredo M., Zerubia J. (eds) Energy Minimization Methods in Computer Vision and Pattern Recognition. EMMCVPR 2003. Lecture Notes in Computer Science, vol 2683. Springer, Berlin, Heidelberg

Abstract

Information theoretic measures provide quantitative entropic divergences between two probability distributions or data sets. In this paper, we analyze the theoretical properties of the Jensen-Rényi divergence which is defined between any arbitrary number of probability distributions. Using the theory of majorization, we derive its maximum value, and also some performance upper bounds in terms of the Bayes risk and the asymptotic error of the nearest neighbor classifier. To gain further insight into the robustness and the application of the Jensen-Rényi divergence measure in imaging, we provide substantial numerical experiments to show the power of this entopic measure in image registration and segmentation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • A. Ben Hamza
    • 1
  • Hamid Krim
    • 1
  1. 1.Department of Electrical and Computer EngineeringNorth Carolina State UniversityRaleighUSA

Personalised recommendations