# Parallel Cut Pursuit For Minimization of the Graph Total Variation

arXiv: https://arxiv.org/abs/1905.02316 · HTML: https://mlsanity.com/paper/1905.02316/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 May 2019.

## Built on by (most cited first, 4 of 4)

- [Efficient 3D Semantic Segmentation with Superpoint Transformer](https://mlsanity.com/paper/2306.08045/) (2023)
- [Scalable 3D Panoptic Segmentation As Superpoint Graph Clustering](https://mlsanity.com/paper/2401.06704/) (2024)
- [EZ-SP: Fast and Lightweight Superpoint-Based 3D Segmentation](https://mlsanity.com/paper/2512.00385/) (2025)
- [Foundry: Distilling 3D Foundation Models for the Edge](https://mlsanity.com/paper/2511.20721/) (2025)

## Abstract (arXiv)

We present a parallel version of the cut-pursuit algorithm for minimizing functionals involving the graph total variation. We show that the decomposition of the iterate into constant connected components, which is at the center of this method, allows for the seamless parallelization of the otherwise costly graph-cut based refinement stage. We demonstrate experimentally the efficiency of our method in a wide variety of settings, from simple denoising on huge graphs to more complex inverse problems with nondifferentiable penalties. We argue that our approach combines the efficiency of graph-cuts based optimizers with the versatility and ease of parallelization of traditional proximal