|Title||Information Theoretic Principles of Universal Discrete Denoising|
|Publication Type||Conference Paper|
|Year of Publication||2017|
|Authors||Noetzel, J, Winter, A|
|Conference Name||2017 International Symposium on Wireless Communication Systems (ISWCS)|
Social media platforms make tremendous amounts of data available. Often times, the same information is behind multiple different available data sets. This lends growing importance to latent variable models that try to learn the hidden information from the available imperfect versions. For example, social media platforms can contain an abundance of pictures of the same person, yet all of which are taken from different perspectives. In a simplified scenario, one may consider pictures taken from the same perspective, which are distorted by noise. This latter application allows for a rigorous mathematical treatment, which is the content of this contribution. We apply a recently developed method of dependent component analysis to image denoising when multiple distorted copies of one and the same image are available, each being corrupted by a different and unknown noise process. In a simplified scenario, one may assume such a distorted image to be corrupted by noise that acts independently on each pixel. We answer completely the question of how to perform optimal denoising, when at least three distorted copies are available: First we define optimality of an algorithm in the presented scenario, and then we describe an aymptotically optimal universal discrete denoising algorithm (UDDA).