A Novel Two-Dimensional Smoothing Algorithm
Xufeng Chen, Liang Yan, Xiaoshan Gao

TL;DR
This paper introduces a new Two-Dimensional Smoothing (TDS) algorithm that effectively separates trend and noise in 2D sequences without relying on traditional filtering windows, using a novel loss function approach.
Contribution
The paper presents a simple, window-independent 2D smoothing algorithm based on a loss function, with proven existence and uniqueness of the trend and fluctuation sequences.
Findings
Effective noise reduction in 2D sequences demonstrated
Algorithm outperforms traditional filtering methods in accuracy
Validated through numerical simulations and image processing
Abstract
Smoothing and filtering two-dimensional sequences are fundamental tasks in fields such as computer vision. Conventional filtering algorithms often rely on the selection of the filtering window, limiting their applicability in certain scenarios. To this end, we propose a novel Two-Dimensional Smoothing (TDS) algorithm for the smoothing and filtering problem of two-dimensional sequences. Typically, the TDS algorithm does not require assumptions about the type of noise distribution. It is simple and easy to implement compared to conventional filtering methods, such as 2D adaptive Wiener filtering and Gaussian filtering. The TDS algorithm can effectively extract the trend contained in the two-dimensional sequence and reduce the influence of noise on the data by adjusting only a single parameter. In this work, unlike existing algorithms that depend on the filtering window, we introduce a…
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.
