Latent Random Steps as Relaxations of Max-Cut, Min-Cut, and More.
Sudhanshu ChanpuriyaCameron MuscoPublished in: CoRR (2023)
Keyphrases
- max cut
- graph partitioning
- min cut
- graph model
- np hard
- image segmentation
- weighted graph
- lower bound
- graph cuts
- markov random field
- energy minimization
- information theoretic
- data clustering
- clustering algorithm
- linear programming
- superpixels
- pairwise
- optimal solution
- lp relaxation
- linear program
- spectral clustering
- energy function
- convex relaxation
- adjacency matrix
- multiscale