Filtering random noise via data compression

Data Compression Conference Proceedings

Volumn , Issue , 1993, Pages 60-69

  Natarajan, B K ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OCCAM'S RAZOR; RANDOM NOISE; SPECTRAL FILTERS;

DATA COMPRESSION;

EID: 0006300651     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.1993.253144     Document Type: Conference Paper

References (5)

1. Berger, T. (1971). Rate Distortion Theory, Prentice Hall, Englewood Cliffs, NJ.
2. Imai, H., and Iri, M., (1986). An optimal algorithm for approximating a piecewise linear function. J. of Information Processing, Vo1.9, No.3, pp. 159-162.
3. Natarajan, B.K., (1992). Occam's Razor for Functions, submitted for publication.
4. Oppenheim, A.V., and Schafer, R., (1974). Digital Signal Processing, Prentice Hall, Englewood Cliffs, N.J.
5. Suri, S., (1988). On some link distance problems in a simple polygon. IEEE Trans. on Robotics and Automation, Vo1.6, No.1, pp.108-113.