ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Image segmentation using maximum flow

Eva Križman (2017) Image segmentation using maximum flow. EngD thesis.

Download (1494Kb)


    In this thesis we consider image segmentation using maximum flow. In the first part of the thesis we present in detail the maximum flow problem and its dual problem, the minimum cut problem. We describe two algorithms for solving these two problems, the Ford-Fulkerson algorithm and Dinic algorithm. In the second part of the thesis we introduce the concept of image segmentation and we list some methods that are used for image segmentation. We describe some of them: the thresholding method, clustering methods, the region-growing methods and segmentation on graphs. In the last chapter we present in more detail segmentation on graphs using maximum flow. We represent a given image with a weighted graph. Then we find maximum flow and minimum cut in this graph. Using minimum cut we can separate pixels to those that belong to the foreground and those that belong to the background. Pseudo code is given for all the algorithms used and their time complexity is analyzed. At the end of the thesis we discuss some problems that arise in this kind of segmentation.

    Item Type: Thesis (EngD thesis)
    Keywords: graph, network, maximum flow, minimum cut, Ford-Fulkerson algorithm, image segmentation
    Number of Pages: 53
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    izr. prof. dr. Arjana ŽitnikMentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1537566147)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 3936
    Date Deposited: 13 Sep 2017 12:54
    Last Modified: 04 Oct 2017 10:32
    URI: http://eprints.fri.uni-lj.si/id/eprint/3936

    Actions (login required)

    View Item