A Tutorial on Applications of Power Watershed Optimization to Image Processing
Résumé
This tutorial review paper consolidates the existing applications of the power watershed (PW) optimization framework in the context of image processing. In literature, it is known that PW framework when applied to some well-known graph-based image segmentation and filtering algorithms such as random walker, isoperimetric partitioning, ratio-cut clustering, multi-cut and shortest path filters yield faster yet consistent solutions. In this paper, the intuition behind the working of PW framework i.e. exploitation of contrast invariance on image data is explained. The intuitions are illustrated with toy images and experiments on simulated astronomical images. This article is primarily aimed at researchers working on image segmentation and filtering problems in application areas such as astronomy where images typically havea huge number of pixels. Classic graph-based cost minimization methods provide good results on images with small number of pixels but do not scale well for images with large number of pixels. The ideas from the article can be adapted to a large class of graph-based cost minimization methods to obtain scalable segmentation and filtering algorithms.
Fichier principal
articleV3.pdf (3.94 Mo)
Télécharger le fichier
svepjST.clo (7.59 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|