An Efficient Heuristic Procedure for Partitioning Graphs

By H. Kitazawa, I. Harada, N. Metropolis, A. W. Rosenbluth, M. Rosen, A. H. Teller, V. Rao. 2017

Subfields: Algorithms & Complexity

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algorithms & Complexity

1. Alexander Kirillov
2. Bjoern Andres
3. Carsten Rother
4. Bogdan Savchynskyy
5. Evgeny Levinkov

Citations in the corpus

• InstanceCut: From Edges to Instances with MultiCut (2016, methodology): “Since our image partitioning framework works on the superpixel level we transform the pixel-wise semantic class scores ai,l to the superpixel-wise ones au,l (here u indexes the superpixels) by averaging the corresponding pixels’ scores.”