Transactions on Computational Science XIX

Volume 7870 of the series Lecture Notes in Computer Science pp 92-106

Learning Graph Laplacian for Image Segmentation

  • Sergey MilyaevAffiliated withRadiophysics Department, Voronezh State University
  • , Olga BarinovaAffiliated withDepartment of Computational Mathematics and Cybernetics, Lomonosov Moscow State University

* Final gross prices may vary according to local VAT.

Get Access


In this paper we formulate the task of semantic image segmentation as a manifold embedding problem and solve it using graph Laplacian approximation. This allows for unsupervised learning of graph Laplacian parameters individually for each image without using any prior information. We perform experiments on GrabCut, Graz and Pascal datasets. At a low computational cost proposed learning method shows comparable performance to choosing the parameters on the test set. Our framework for semantic image segmentation shows better performance than the standard discrete CRF with graph-cut inference.