Similarity and denoising

DOI10.1098/rsta.2012.0091zbMath1353.94021OpenAlexW2117776171WikidataQ51282330 ScholiaQ51282330MaRDI QIDQ2955479

Paul M. B. Vitányi

Publication date: 13 January 2017

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rsta.2012.0091

Mathematics Subject Classification ID

Taxonomy, cladistics, statistics in mathematical biology (92B10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (1)

Fourier transform bounded Kolmogorov complexity

Cites Work

• A fast quartet tree heuristic for hierarchical clustering
• Nonapproximability of the normalized information distance
• Clustering by Compression
• The Similarity Metric
• Kolmogorov's Structure Functions and Model Selection
• The Normalized Compression Distance Is Resistant to Noise
• Information distance
• Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
• Information Distance in Multiples
• Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Similarity and denoising