Mathemtical Image Analysis
Registration
Please write a mail to jonathan.schwarz@iwr.uni-heidelberg.de until October 31st, 2020 if you want to participate.
Modalities
General
In order to receive a seminar certificate you have to:
- give a talk,
- hand in a written summary of your topic and the slides of your presentation as PDF and
- attend the other talks (at most once missing without excuse).
We recommend that you make at least one appointment with us to discuss the topic.
The Talk
You have to give a talk on your topic
- The talk will be done using heiCONF or zoom
- You are free to choose any format for your presentation (slides or writing some notes during the presentation)
- If you are using slides, you can use this template for the presentation (just optional)
- The talk should last between 30 and 40 minutes.
- There will be a discussion session after your talk of around 5 to 10 minutes
Send the slides as PDF to jonathan.schwarz@iwr.uni-heidelberg.de the latest the day before your talk.
The Summary
You have to hand in a written summary of your topic the latest 7 days after your talk.
- The summary should be created with LaTeX,
- I recommend the LNCS LaTeX Template, but you don't have to use it.
- The summary should be between 3 and 6 pages long
Send the summary as PDF to jonathan.schwarz@iwr.uni-heidelberg.de.
Schedule
- Submission slides: at least one day in advance of your presentation
- Submission summary: one week after of your presentation
- Talks: on zoom (you get the link via e-mail)
Date | Paper | Speaker |
---|---|---|
11.11.20 | first meeting, organisation, choosing the papers | Jonathan Schwarz |
09.12.20 | Information geometry connecting Wasserstein distance and Kullback–Leibler divergence via the entropy-relaxed transportation problem | Yuchen Ma |
Paper
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering by Kuang, Yun and Park, Journal of Global Optimization, 2015, pdf
- k-MLE: A fast algorithm for learning statistical mixture models by Frank Nielsen, arXiv preprint, 2012, pdf
- Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning by Schmitz et al., SIAM Journal on Imaging Sciences, 2018, pdf
- Ising and Potts models on the hypercubic lattice by Duminil-Copin H., arXiv preprint arXiv:1707.00520, 2017 link (only one of the chapters 1, 2, 4, 5.1, 6.1)
- Information geometry connecting Wasserstein distance and Kullback–Leibler divergence via the entropy-relaxed transportation problem by Shun-ichi Amari et. al., Information Geometry, Springer, 2018, pdf
- Escort Evolutionary Game Theory by Marc Harper, arXiv, 2012, pdf