DocumentCode :
2031626
Title :
A morphological polynomial transform
Author :
Cha, H. ; Chaparro, L.F.
Author_Institution :
Dept. of Electr. Eng., Pittsburgh Univ., PA, USA
Volume :
5
fYear :
1993
fDate :
27-30 April 1993
Firstpage :
173
Abstract :
It is shown that, using grayscale morphology and a set of functions related to orthogonal polynomials-defined on a window-as structuring elements, a signal representation analogous to the polynomial transform can be developed. The geometric decomposition of a signal is achieved by windowing and using a morphological opening operation to approximate the windowed signal with each of the structuring elements. The resulting representation is made to resemble an orthogonal expansion by constraining the result of opening to be equal to the structuring function. Properties of the recursive decomposition algorithm make it possible to develop an algorithm for calculating a set of coefficients used in the reconstruction. The analysis and synthesis of one-dimensional signals are illustrated with an image data compression example.<>
Keywords :
data compression; image coding; mathematical morphology; polynomials; signal synthesis; geometric decomposition; grayscale morphology; image data compression; morphological polynomial transform; orthogonal polynomials; recursive decomposition algorithm; signal representation; windowing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on
Conference_Location :
Minneapolis, MN, USA
ISSN :
1520-6149
Print_ISBN :
0-7803-7402-9
Type :
conf
DOI :
10.1109/ICASSP.1993.319775
Filename :
319775
Link To Document :
بازگشت