f-BRS: Rethinking Backpropagating Refinement for Interactive Segmentation

Deep neural networks have become a mainstream approach to interactive segmentation. As we show in our experiments, while for some images a trained network provides accurate segmentation result with just a few clicks, for some unknown objects it cannot achieve satisfactory result even with a large amount of user input. Recently proposed backpropagating refinement (BRS) scheme introduces an optimization problem for interactive segmentation that results in significantly better performance for the hard cases. At the same time, BRS requires running forward and backward pass through a deep network several times that leads to significantly increased computational budget per click compared to other methods. We propose f-BRS (feature backpropagating refinement scheme) that solves an optimization problem with respect to auxiliary variables instead of the network inputs, and requires running forward and backward pass just for a small part of a network. Experiments on GrabCut, Berkeley, DAVIS and SBD datasets set new state-of-the-art at an order of magnitude lower time per click compared to original BRS. The code and trained models are available at https://github.com/saic-vul/fbrs_interactive_segmentation .

PDF Abstract CVPR 2020 PDF CVPR 2020 Abstract


Results from the Paper

Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Interactive Segmentation Berkeley f-BRS-B (ResNet-50) NoC@90 4.34 # 10
Interactive Segmentation DAVIS f-BRS-B (ResNet-101) NoC@85 5.04 # 9
NoC@90 7.41 # 9
Interactive Segmentation GrabCut f-BRS-B (ResNet-34) NoC@85 2 # 8
NoC@90 2.46 # 10
Interactive Segmentation SBD f-BRS-B (ResNet-101) NoC@85 4.81 # 8
NoC@90 7.73 # 8