Tutorial T9 ICIP 2014: Optimization on Hierarchies


  • Jean Serra: Hierarchies and Energetic Lattice [Slides]
  • Hugues Talbot: Optimisation in Imaging [Slides]
  • B Ravi Kiran: Constrained Optimization on Hierarchies [Slides]
  • Jean Cousty: Handling and computing hierarchies with graphs [Slides]

References and Reading List:

  • Classification and Regression Trees (CART), Breiman et al. (1984)
  • Convex optimization, Stephen Boyd and Lieven Vandenberghe (2004)
  • Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval, Salembier P., Garrido L., (2000).
  • Scale-sets, Guigues (2006)
  • Level lines selection with variational models for segmentation and encoding. Ballester, C., Caselles, V., Igual, L., and Garrido, (2007)
  • Contour detection and hierarchical image segmentation, Arbelaez, P., Maire, M., Fowlkes, C., and Malik, J., (2011).
  • Supervised assessment of segmentation hierarchies. Pont-Tuset, J. and Marques, F. (2012)
  • Global–local optimizations by hierarchical cuts and climbing energies. Kiran B.R., Serra J. (2013)
  • Fast approximate energy minimization via graph cuts, Boykov, Y., Veksler, O., and Zabih, R. (2001)
  • Some links between min-cuts, optimal spanning forests and watersheds, Allene, C., Audibert, J.-Y., Couprie, M., Cousty, J., and Keriven, R. (2007).
  • Watershed cuts: Thinnings, shortest path forests, and topological watersheds. Cousty, J., Bertrand, G., Najman, L., and Couprie, M. (2010).
  • Power watersheds: A unifying graph-based optimization framework, Couprie, C., Grady, L., Najman, L., and Talbot, H. (2011)