A tutorial on applications of power watershed optimization to image processing

Article Type

Research Article

Publication Title

European Physical Journal: Special Topics

Abstract

This tutorial review paper consolidates the existing applications of the power watershed (PW) optimization framework in the context of image processing. In the 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 have 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.

First Page

2337

Last Page

2361

DOI

10.1140/epjs/s11734-021-00264-0

Publication Date

5-1-2021

Comments

Open Access, Green

This document is currently not available here.

Share

COinS