Adaptive Morphological Representation of Signals: Polynomialand Wavelet Methods

  • Authors:
  • Hyungtai Cha;Luis F. Chaparro

  • Affiliations:
  • Department of Electrical Engineering, Soongsil University, Seoul, Korea 156-743. E-mail: hcha@saint.soongsil.ac.kr;Department of Electrical Engineering, 348 Benedum Hall, University of Pittsburgh, Pittsburgh, PA 15261. chaparro@ee.pitt.edu

  • Venue:
  • Multidimensional Systems and Signal Processing
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a novel signal representationbased on mathematical morphology, and with it develop representationsanalogous to the polynomial transform and the bank-of-filtersimplementation of the wavelet representation. The geometric decompositionof a signal is achieved by separating it into analysis framesand applying mathematical morphological operators with adaptivestructuring functions to each frame. The adaptation parametersare found by solving iteratively nonlinear equations that resultfrom constraining the morphological results to achieve optimalfitting. If the structuring functions are derived from real-valuedorthogonal polynomials defined on a window, the representationis analogous to the polynomial transform. Using a morphologicalinterpolation, we derive a pyramid-like structure to decomposea signal into gross and fine information components, at differentscales, just as in the wavelet transformation. Non-linear morphologicaloperators reduce the computational complexity of the proposedrepresentations. Although these representations are easily extendedto two-dimensions, one needs to consider the non–uniqueordering of the structuring functions, and the different sampling,decimation and interpolation procedures in two-dimensions. Theapplication of our procedures is mainly in image data compression,but they could also used in object identification. We illustrateour representations by means of one- and two-dimensional examples.