Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts
Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts
Formulations of the Image Decomposition Problem [18] as a Multicut Problem (MP) w.r.t. a superpixel graph have received considerable attention. In contrast, instances of the MP w.r.t. a pixel grid graph have received little attention, firstly, because the MP is NP-hard and instances w.r.t. a pixel grid graph are hard …