Global Binary Optimization on Graphs for Classification of High-Dimensional Data
- Author(s): Merkurjev, E
- Bae, E
- Bertozzi, AL
- Tai, XC
- et al.
Published Web Locationhttps://doi.org/10.1007/s10851-015-0567-y
© 2015, Springer Science+Business Media New York. This work develops a global minimization framework for segmentation of high-dimensional data into two classes. It combines recent convex optimization methods from imaging with recent graph- based variational models for data segmentation. Two convex splitting algorithms are proposed, where graph-based PDE techniques are used to solve some of the subproblems. It is shown that global minimizers can be guaranteed for semi-supervised segmentation with two regions. If constraints on the volume of the regions are incorporated, global minimizers cannot be guaranteed, but can often be obtained in practice and otherwise be closely approximated. Experiments on benchmark data sets show that our models produce segmentation results that are comparable with or outperform the state-of-the-art algorithms. In particular, we perform a thorough comparison to recent MBO (Merriman–Bence–Osher, AMS-Selected Lectures in Mathematics Series: Computational Crystal Growers Workshop, 1992) and phase field methods, and show the advantage of the algorithms proposed in this paper.
Many UC-authored scholarly publications are freely available on this site because of the UC Academic Senate's Open Access Policy. Let us know how this access is important for you.