Search Results for author:
Found 6 papers, 1 papers with code
Optimising Spatial and Tonal Data for PDE-based Inpainting
Moreover, is more generic than other data optimisation approaches for the sparse inpainting problem, since it can also be extended to nonlinear inpainting operators such as EED.
Robust PCA: Optimization of the Robust Reconstruction Error over the Stiefel Manifold
In distinction to other methods for robust PCA, our method has no free parameter and is computationally very efficient.
The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited
Hypergraphs allow one to encode higher-order relationships in data and are thus a very flexible modeling tool.
Nonlinear Eigenproblems in Data Analysis - Balanced Graph Cuts and the RatioDCA-Prox
It has been recently shown that a large class of balanced graph cuts allows for an exact relaxation into a nonlinear eigenproblem.
Constrained fractional set programs and their application in local clustering and community detection
While a globally optimal solution for the resulting non-convex problem cannot be guaranteed, we outperform the loose convex or spectral relaxations by a large margin on constrained local clustering problems.
Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts
Spectral clustering is based on the spectral relaxation of the normalized/ratio graph cut criterion.
