Understanding Symmetric Smoothing Filters: A Gaussian Mixture Model Perspective
Stanley H. Chan, Todd Zickler, Yue M. Lu

TL;DR
This paper links symmetric smoothing filters in image denoising to Gaussian mixture models via the Sinkhorn-Knopp algorithm, offering a new GSF method that improves performance by leveraging EM interpretation.
Contribution
It establishes a novel statistical learning perspective connecting Sinkhorn-Knopp to EM for GMMs, leading to a new effective denoising algorithm called GSF.
Findings
GSF outperforms many existing smoothing filters
GSF achieves comparable results to state-of-the-art denoising methods
Theoretical connection between symmetrization and Gaussian mixture models
Abstract
Many patch-based image denoising algorithms can be formulated as applying a smoothing filter to the noisy image. Expressed as matrices, the smoothing filters must be row normalized so that each row sums to unity. Surprisingly, if we apply a column normalization before the row normalization, the performance of the smoothing filter can often be significantly improved. Prior works showed that such performance gain is related to the Sinkhorn-Knopp balancing algorithm, an iterative procedure that symmetrizes a row-stochastic matrix to a doubly-stochastic matrix. However, a complete understanding of the performance gain phenomenon is still lacking. In this paper, we study the performance gain phenomenon from a statistical learning perspective. We show that Sinkhorn-Knopp is equivalent to an Expectation-Maximization (EM) algorithm of learning a Gaussian mixture model of the image patches. By…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
