Efficient String Matching Algorithms for Combinatorial Universal Denoising

Inspired by the combinatorial denoising method {\tt DUDE} \cite{WOSVW04}, 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.


Presented at:
IEEE Data Compression Conference (DCC), Snow Bird, UTAH, March 2005
Year:
2005
Keywords:
Laboratories:




 Record created 2006-12-11, last modified 2018-03-17

n/a:
Download fulltext
PS.GZ

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)