Data compression using the deconvolution algorithm CLEAN

✍ Scribed by Nathan Cohen; Guido Sandri

• Publisher: John Wiley and Sons
• Year: 1994
• Tongue: English
• Weight: 396 KB
• Volume: 5
• Category: Article
• ISSN: 0899-9457
• DOI: 10.1002/ima.1850050105

✦ Synopsis

We describe an application of the nonlinear deconvolution algorithm CLEAN in which a priori knowledge of the point-spread function allows transmission of nonredundant information. We refer to this as CLEAN compression. The point-spread function is viewed as a redundancy function. The data set may be regarded as a convolution of the nonredundant information with the redundancy function. Since the nonredundant data is a small subset of the overall data set, images or telecommunication messages may be transmitted over narrowband channels using CLEAN. Effective analog data compression is maximized; the analog signal may be significantly compressed with CLEAN even before any additional compression or digital encoding algorithms are applied.