The truncated variational model for image labeling and graph partitioning
Y Li, Y Yang, K Yin, Y Duan, J Yuan - Inverse Problems and …, 2024 - aimsciences.org
Image labeling and graph partitioning aim to divide a set of pixels or vertices into a specific
number of meaningful groups. In this paper, we propose effective truncated regularization …
number of meaningful groups. In this paper, we propose effective truncated regularization …
Non-convex total variation minimization for signed graph cut clustering
T Dittrich, G Matz - 2021 55th Asilomar Conference on Signals …, 2021 - ieeexplore.ieee.org
We consider graph cut minimization in signed graphs with three clusters. To this end, we use
the signed total variation, which is convex and has shown promising results in our previous …
the signed total variation, which is convex and has shown promising results in our previous …
Variational methods for semi-supervised node classification on signed graphs with multiple classes
T Dittrich - 2023 - repositum.tuwien.at
Semi-supervised node classification is the task of assigning the nodes of a graph to different
classes based on the graph structure and the knowledge of a (small) portion of class …
classes based on the graph structure and the knowledge of a (small) portion of class …