Unsupervised Labeling by Geometric and Spatially Regularized Self-assignment

We introduce and study the unsupervised self-assignment flow for labeling image data (euclidean or manifold-valued) without specifying any class prototypes (labels) beforehand, and without alternating between data assignment and prototype evolution, which is common in unsupervised learning. Rather, a single smooth flow evolving on an elementary statistical manifold is geometrically integrated which assigns given data to itself. Specifying the scale of spatial regularization by geometric averaging suffices to induce a low-rank data representation, the emergence of prototypes together with their number, and the data labeling. Connections to the literature on low-rank matrix factorization and on data representations based on discrete optimal mass transport are discussed.

[1]  Christoph Schnörr,et al.  Continuous Multiclass Labeling Approaches and Algorithms , 2011, SIAM J. Imaging Sci..

[2]  Shun-ichi Amari,et al.  Methods of information geometry , 2000 .

[3]  C. Ji An Archetypal Analysis on , 2005 .

[4]  Freddie Åström,et al.  Image Labeling by Assignment , 2016, Journal of Mathematical Imaging and Vision.

[5]  Freddie Åström,et al.  Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment , 2017, SIAM J. Imaging Sci..

[6]  Cheng Soon Ong,et al.  Multivariate spearman's ρ for aggregating ranks using copulas , 2016 .

[7]  Haesun Park,et al.  SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering , 2014, Journal of Global Optimization.

[8]  Amnon Shashua,et al.  A unifying approach to hard and probabilistic clustering , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[9]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[10]  Gabriele Steidl,et al.  Iterative Multiplicative Filters for Data Labeling , 2016, International Journal of Computer Vision.

[11]  Filippo Santambrogio,et al.  Optimal Transport for Applied Mathematicians , 2015 .

[12]  Guillaume Carlier,et al.  Barycenters in the Wasserstein Space , 2011, SIAM J. Math. Anal..

[13]  Sebastian Nowozin,et al.  A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems , 2014, International Journal of Computer Vision.

[14]  Andrzej Cichocki,et al.  Nonnegative Matrix and Tensor Factorizations : An algorithmic perspective , 2014, IEEE Signal Processing Magazine.

[15]  Mila Nikolova,et al.  Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models , 2006, SIAM J. Appl. Math..

[16]  Freddie Åström,et al.  Unsupervised Label Learning on Manifolds by Spatially Regularized Geometric Assignment , 2018, GCPR.

[17]  Erkki Oja,et al.  Low-Rank Doubly Stochastic Matrix Decomposition for Cluster Analysis , 2016, J. Mach. Learn. Res..

[18]  Jonathan Weed,et al.  Statistical Optimal Transport via Geodesic Hubs , 2018, ArXiv.

[19]  Gabriel Peyré,et al.  Semi-dual Regularized Optimal Transport , 2018, SIAM Rev..

[20]  Francesca P. Carli,et al.  Convex Clustering via Optimal Mass Transport , 2013, 1307.5459.

[21]  Stefania Petra,et al.  Geometric numerical integration of the assignment flow , 2018, Inverse Problems.

[22]  Gabriel Peyré,et al.  Computational Optimal Transport , 2018, Found. Trends Mach. Learn..

[23]  Josef Kittler,et al.  Pattern recognition : a statistical approach , 1982 .

[24]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[25]  F. Santambrogio Optimal Transport for Applied Mathematicians: Calculus of Variations, PDEs, and Modeling , 2015 .