Data Compression Conference (DCC'05)
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Snowbird, Utah
March 29-March 31
ISBN: 0-7695-2309-9
Inspired by the combinatorial denoising method DUDE, 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.
Citation:
S. Chen, S. Diggavi, S. Dusad, S. Muthukrishnan, "Efficient String Matching Algorithms for Combinatorial Universal Denoising," dcc, pp.153-162, Data Compression Conference (DCC'05), 2005