Loading...
conference paper
Efficient String Matching Algorithms for Combinatorial Universal Denoising
2005
2005 IEEE Data Compression Conference
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.
Loading...
Name
DCC05.ps.gz.gz
Access type
openaccess
Size
99.26 KB
Format
Unknown
Checksum (MD5)
2fdbf9db81f7d60dd05bc480266151a6