Fast and Accurate Computation of the Myriad Filter via Branch-and-Bound Search
From MaRDI portal
Publication:4568995
DOI10.1109/TSP.2008.917889zbMath1390.90477OpenAlexW2128315540MaRDI QIDQ4568995
Rafael C. Núñez, Juan G. Gonzalez, John P. Nolan, Gonzalo R. Arce
Publication date: 27 June 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2008.917889
Related Items (3)
Exponential myriad smoothing algorithm for robust signal processing in \(\alpha \)-stable noise environments ⋮ New polynomial approach to myriad filter computation ⋮ Nonlocal myriad filters for Cauchy noise removal
This page was built for publication: Fast and Accurate Computation of the Myriad Filter via Branch-and-Bound Search
