Analysis of the Entropy-guided Switching Trimmed Mean Deviation-based Anisotropic Diffusion filter
This report describes the experimental analysis of a proposed switching filter-anisotropic diffusion hybrid for the filtering of the fixed value (salt and pepper) impulse noise (FVIN). The filter works well at both low and high noise densities though it was specifically designed for high noise density levels. The filter combines the switching mechanism of decision-based filters and the partial differential equation-based formulation to yield a powerful system capable of recovering the image signals at very high noise levels. Experimental results indicate that the filter surpasses other filters, especially at very high noise levels. Additionally, its adaptive nature ensures that the performance is guided by the metrics obtained from the noisy input image. The filter algorithm is of both global and local nature, where the former is chosen to reduce computation time and complexity, while the latter is used for best results.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
CEBoosting: Online Sparse Identification of Dynamical Systems with Regime Switching by Causation Entropy Boosting
Regime switching is ubiquitous in many complex dynamical systems with multiscale features, chaotic behavior, and extreme events. In this paper, a causation entropy boosting (CEBoosting) strategy is developed to facilitat…
parameter estimationFinite-Time Error Analysis of Soft Q-Learning: Switching System Approach
Soft Q-learning is a variation of Q-learning designed to solve entropy regularized Markov decision problems where an agent aims to maximize the entropy regularized value function. Despite its empirical success, there hav…
Q-LearningDepth Coefficients for Depth Completion
Depth completion involves estimating a dense depth image from sparse depth measurements, often guided by a color image. While linear upsampling is straight forward, it results in artifacts including depth pixels being in…
Depth Completionobject-detectionObject DetectionRobust Distributed Estimation: Extending Gossip Algorithms to Ranking and Trimmed Means
This paper addresses the problem of robust estimation in gossip algorithms over arbitrary communication graphs. Gossip algorithms are fully decentralized, relying only on local neighbor-to-neighbor communication, making …
From Broad Exploration to Stable Synthesis: Entropy-Guided Optimization for Autoregressive Image Generation
Combining Chain-of-Thought (CoT) with Reinforcement Learning (RL) improves text-to-image (T2I) generation, yet the underlying interaction between CoT's exploration and RL's optimization remains unclear. We present a syst…
Reinforcement LearningImage Generation