Subscribe
Issue No.01 - January (1997 vol.19)
pp: 84-91
ABSTRACT
<p><b>Abstract</b>—Approximation techniques are an important aspect of digital signal and image processing. Many lossy signal compression procedures such as the Fourier transform and discrete cosine transform are based on the idea that a signal can be represented by a small number of transformed coefficients which are an approximation of the original.</p><p>Existing approximation techniques approach this problem in either a time/spatial domain or transform domain, but not both. This paper <it>briefly</it> reviews various existing approximation techniques. Subsequently, we present a new strategy to obtain an approximation <tmath>$\hat f\left( x \right)$</tmath> of <tmath>$f\left( x \right)$</tmath> in such a way that it is <it>reasonably</it> close to the original function in the domain of the variable <it>x</it>, and <it>exactly</it> preserves some properties of the transformed domain. In this particular case, the properties of the transformed values that are preserved are geometric moments of the original function. The proposed technique has been applied to single-variable functions, two-dimensional planar curves, and two-dimensional images, and the results obtained are demonstrative.</p>
INDEX TERMS
Signal processing, image processing, sampling, approximation, moment-preserving approximations.
CITATION
Thai B. Nguyen, B. John Oommen, "Moment-Preserving Piecewise Linear Approximations of Signals and Images", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.19, no. 1, pp. 84-91, January 1997, doi:10.1109/34.566816