429 citations · 467 across the 7 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2019
Discriminative training of conditional random fields with probably submodular constraints
Maxim Berman, Matthew B. Blaschko
Problems of segmentation, denoising, registration and 3D reconstruction are often addressed with the graph cut algorithm. However, solving an unconstrained graph cut problem is NP-…
cs.LG2018
Yes, IoU loss is submodular - as a function of the mispredictions
Maxim Berman, Matthew B. Blaschko, Amal Rannen Triki +1
This note is a response to [7] in which it is claimed that [13, Proposition 11] is false. We demonstrate here that this assertion in [7] is false, and is based on a misreading of t…