Fast algorithms for weighted myriad computation by fixed-point search
From MaRDI portal
communicationsfixed-point iterationsiterative methodsmedian filtersnonlinear filterssignal processingweighted myriad filter
Iterative numerical methods for linear systems (65F10) Filtering in stochastic control theory (93E11) Communication theory (94A05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Recommendations
- scientific article; zbMATH DE number 4205881
- Fast computation of weight multiplicities
- Fast and Accurate Computation of the Myriad Filter via Branch-and-Bound Search
- A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem
- A multivariate approach for weighted FPT algorithms
- scientific article; zbMATH DE number 1804098
- Fast and Simple Algorithms for Weighted Perfect Matching
- Faster algorithms for computing plurality points
- Faster algorithms for computing plurality points
Cited in
(5)- Nonlocal myriad filters for Cauchy noise removal
- New polynomial approach to myriad filter computation
- Exponential myriad smoothing algorithm for robust signal processing in \(\alpha \)-stable noise environments
- Adaptive weighted meridian nonlinear filter used for filtering of signal with impulsive noise
- Two approaches to adaptation of sample myriad to characteristics of \(S\alpha S\) distribution data
This page was built for publication: Fast algorithms for weighted myriad computation by fixed-point search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2734279)
