11.4. Linear predictive coding

To conclude, we demonstrate an application for 2-D non-separable recursive filters. This is the method of linear predictive coding. Let us consider a 2-D signal x(u, ν) with a bounded support and centered, for example, a gray level image with M rows and N columns (we show such an image below), such that the summation below, which has a finite number of non-null terms, is null:

images

If the above conditions do not apply, we must subtract the constant μ/(MN) from each sample of x in order to have a centered signal.

It is important to reduce the redundancy of information between neighboring pixels. We can do this with a linear filtering operation: we look for a causal FIR filter, of transfer function:

images

where the order m and n are arbitrarily bounded, which, affected by the signal x(u, ν), give as an output signal y(u, ν), of minimal energy:

images

The filter being of finite impulse response and the input signal being of bounded support, the non-null terms are of finite number in the sum of equation (11.43).

To calculate this optimum filter, we can proceed in the following way. We write A = [ah,k] (0 ≤ hm and 0 ≤ kn) as the matrix of dimension (m + 1) × (n + 1) ...

Get Digital Filters Design for Signal and Image Processing now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.