Fast and Accurate Computation of the Myriad Filter via Branch-and-Bound Search

DOI10.1109/TSP.2008.917889zbMATH Open1390.90477OpenAlexW2128315540MaRDI QIDQ4568995FDOQ4568995

Authors: Rafael C. Núñez, Juan G. Gonzalez, Gonzalo R. Arce, John P. Nolan 

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (4)

• New polynomial approach to myriad filter computation
• Nonlocal myriad filters for Cauchy noise removal
• Exponential myriad smoothing algorithm for robust signal processing in \(\alpha \)-stable noise environments
• Fast algorithms for weighted myriad computation by fixed-point search

This page was built for publication: Fast and Accurate Computation of the Myriad Filter via Branch-and-Bound Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568995)