Efficient String Matching Algorithms for Combinatorial Universal Denoising

Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We also propose effective, efficient denoising error estimators so we can find the best denoising of an input sequence over different context lengths. Our methods are simple, drawing from string matching methods and radix sorting. We also present experimental results of our proposed algorithms.

• Type: Conference
• Year: 2005
• Where: DCC
• Authors: S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthukrishnan
• Keywords: Computer Graphics, DCC 2005, Denoising Method Dude, Efficient Algorithms, Efficient Denoising Error