Skip to content
naulon
Not checkedNot checked for notices yet.

An Efficient Weakly Supervised Approach for Texture Segmentation via Graph Cuts

Bhavsar Arnav V.

Journal of Intelligent Systems · 2013

doi:10.1515/jisys-2013-0037 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

We propose an approach for texture segmentation based on weak supervised learning. The weak supervision implies that the user marks only a single small patch for each class in the input image. These patches are used for training. We employ the method of graph cuts for the segmentation task. Our work demonstrates that even under such weak training, texture segmentation can be achieved efficiently and with good accuracy via graph cuts. Moreover, our approach uses a simpler feature representation than that in similar contemporary segmentation approaches. We also provide a brief discussion indicating the good performance of our approach. We validate our method on various standard texture mosaics and also on segmentation of natural images with large texture variations.

Abstract licence: CC BY-NC-ND

References6

    6 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.