**Project Heads**

*Pavel Dvurechensky, Michael Hintermüller, Vladimir Spokoiny
*

**Project Members**

Roman Alexander Krawtschenko (HU)

**Project Duration**

01.01.2019 – 31.12.2021

**Located at**

HU Berlin

Optimal transport (OT) distances between probability measures or histograms capture the geometric nature of complex imaging data and play an increasing role in imaging, e.g. in image retrieval, clustering, classification, segmentation, etc. Project aims at developing theoretically and computationally solid procedures for imaging, based on the OT approach. Two particular applications are considered: image segmentation and image classification with the goal of analyzing medical images.

General introduction to OT

Given a basis space and a transportation cost function, the OT approach defines a distance between two objects as a distance between two probability measures on a basis space. Consider an example of two gray-scale images. In this case, the basis space can be defined as the pixel grid of this image. Then, for each pixel, the intensity can be seen as a mass situated at this pixel. Normalizing the intensity of each pixel dividing it by the total mass of the image, one obtains a discrete probability measure (or histogram) on the space of pixel grid. Then, the squared Euclidean distance between two pixels can be taken as a cost of transportation of a unit mass between these two pixels. Given two images, which are now modeled as probability measures, the goal is to transport the first image to the second. To do so, a transportation plan [1] is defined as a measure on the direct product of the basis pixel space by itself, i.e. a matrix with elements summing up to 1. Each row of this matrix corresponds to a pixel of the first image and tells what portion of mass is transported from this pixel to each pixel of the second image, see Figure.

At the same time, each column of this matrix corresponds to a pixel of the second image and tells what portion of mass is transported to this pixel from each pixel of the first image. Note that this definition is symmetric as the same transportation plan can be used to transport the second image to the first one.

Given squared euclidean distance as transportation cost (i.e., for each pair of pixels, the cost of transporting a unit of mass from a pixel in the first image to a pixel in the second) and transportation plan (i.e., for each pair of pixels, the mass which is transported from a pixel in the first image to a pixel in the second), one can calculate the total cost of transportation of the first image to the second by summing individual costs for each pair of pixels and finding the total cost. Now the the transportation plan can be varied in order to find the minimum possible total cost of transportation. The square root of this minimum transportation cost is called *Monge-Kantorovich or Wasserstein distance* on the space of probability measures. This is a particular case of optimal transport distance. Optimal transport theory proves that this minimum is attained and is indeed a distance which satisfies all the distance axioms. Above we mainly considered an example of images. But, this distance is defined between general probability measures.

Image segmentation

We are building upon the approach of [2], where it is proposed to characterize image segments by their histograms of features. Consider, for example, gray-scale images with the intensity divided into several intervals, called bins. Then, given a segment of an image, the histogram is the vector with dimension equal to the number of bins and components equal to the proportion of the pixels having intensity falling into the respective bin. Since the proportion is evaluated, the histogram vector is a discrete probability distribution. Then one can define a data fitting term, which, when minimized, gives the segmentation of the image. This is done in a supervised setting by first taking a fraction of pixels which are known to belong to the object in the image and constructing a histogram of this object subregion. Then the goal is to find all the pixels from the object by minimizing the OT distance between histogram of the whole object region and the histogram of the subregion. A total variation regularization is used along with this data fitting term, to penalize large perimeter of the segmented object. The goal of this subproject is to extend this framework in several directions. The first one is allowing continuous image space, which gives resolution-independent algorithms using infinite-dimensional optimization, e.g. by Semi-Smooth Newton Method. Next, generalized total variation regularization is applied to allow for space-dependent regularization which is adaptive to local features in the image and is able, e.g. to segment thin lines. Further direction is to use unbalanced optimal transport in order to make transition to unsupervised setting.

Image classification

In this subproject OT barycenters are used to define typical object in a dataset of random images. For example, in the classification problem with two classes, one can define average object for the first class and for the second. Then, for a new object, classification is made using the closest average object. The challenge consists in the appropriate definition of this average for complex objects such as images. It was empirically shown in [3] that OT barycenter, defined as a minimizer of sum of OT distances to all the objects in the set, gives a reasonable average object. Yet, finding this minimizer is computationally intensive since one more level of optimization is added and it is required to find minimum of sum of minimums as OT distance is itself given by minimization problem. Statistical inference questions need also to be addressed. For example, is it true that as the sample size grows, the barycenter converges to the true average object. This subproject is aimed to propose computationally efficient numerical methods for finding Wasserstein barycenter based on the paradigm of distributed optimization dealing with distributed datasets and allowing only local communications between nodes in the computational network. Another goal is to study statistical inference via OT, e.g. establishing central limit theorem for the barycenter of random sample of measures.

References

- Kantorovich, L.: On the translocation of masses.Doklady Acad. Sci. USSR (N.S.), 37:199–201, 1942.
- Papadakis, N., Rabin, J.: Convex histogram-based joint image segmentation with regularized optimaltransport cost.Journal of Mathematical Imaging and Vision, 59(2):161–186, 2017.
- Cuturi, M., Doucet, A.: Fast computation of Wasserstein barycenters. In: Xing,E.P., Jebara, T. (eds.) Proceedings of the 31st International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 32, pp. 685–693, 2014.

**Project Webpages**

**Selected Publications
**

- Kroshnin, A., Tupitsa, N., Dvinskikh, D., Dvurechensky, P., Gasnikov, A., and Uribe, C. On the

complexity of approximating Wasserstein barycenters. In Proceedings of the 36th International Conference on

Machine Learning (Long Beach, California, USA, 09-15 Jun 2019), K. Chaudhuri and R. Salakhutdinov, Eds.,

vol. 97 of Proceedings of Machine Learning Research, PMLR, pp. 3530-3540. http://proceedings.mlr.press/v97/kroshnin19a.html - Dvinskikh, D., Gorbunov, E., Gasnikov, A., Dvurechensky, P., and Uribe, C. A. On primal and

dual approaches for distributed stochastic convex optimization over networks. In 2019 IEEE 58th Conference on

Decision and Control (CDC) (2019), pp. 7435-7440. arXiv:1903.09844 - Guminov, S., Dvurechensky, P., Tupitsa, N., and Gasnikov, A. Accelerated alternating minimization,

accelerated Sinkhorn’s algorithm and accelerated Iterative Bregman Projections. arXiv:1906.03622 (2019). - Tupitsa, N., Dvurechensky, P., Gasnikov, A., and Guminov, S. Alternating minimization methods for

strongly convex optimization. Journal of Inverse and Ill-posed Problems, 2021. arXiv:1911.08987 - Dvurechensky, P., Gasnikov, A., Ostroukhov, P., Uribe, C. A., and Ivanova, A. Near-optimal tensor

methods for minimizing the gradient norm of convex function. arXiv:1912.03381 (2019). - Tupitsa, N., Dvurechensky, P., Gasnikov, A., and Uribe, C. A. Multimarginal optimal transport by

accelerated gradient descent. In 2020 IEEE 59th Conference on Decision and Control (CDC) (2020). arXiv:2004.02294 - Krawtschenko, R., Uribe, C. A., Gasnikov, A., and Dvurechensky, P. Distributed optimization with

quantization for computing Wasserstein barycenters. http://10.20347/WIAS.PREPRINT.2782, arXiv:2010.14325 (2020).

**Selected Pictures
**

For details see

Dvurechensky, P., Dvinskikh, D., Gasnikov, A., Uribe, C. A., and Nedic, A. Decentralize and randomize:

Faster algorithm for Wasserstein barycenters. In Advances in Neural Information Processing Systems

31 (2018), S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, Eds., NeurIPS

2018, Curran Associates, Inc., pp. 10783-10793.

For details see

Dvurechensky, P., Dvinskikh, D., Gasnikov, A., Uribe, C. A., and Nedic, A. Decentralize and randomize:

Faster algorithm for Wasserstein barycenters. In Advances in Neural Information Processing Systems

31 (2018), S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, Eds., NeurIPS

2018, Curran Associates, Inc., pp. 10783-10793.

Please insert any kind of pictures (photos, diagramms, simulations, graphics) related to the project in the above right field (Image with Text), by choosing the green plus image on top of the text editor. (You will be directed to the media library where you can add new files.)

(We need pictures for a lot of purposes in different contexts, like posters, scientific reports, flyers, website,…

Please upload pictures that might be just nice to look at, illustrate, explain or summarize your work.)

As Title in the above form please add a copyright.

And please give a short description of the picture and the context in the above textbox.

Don’t forget to press the “Save changes” button at the bottom of the box.

If you want to add more pictures, please use the “clone”-button at the right top of the above grey box.