Share Email Print

Proceedings Paper

Progressive orthogonal tilings of the time-frequency plane
Author(s): Manuel A. Sola; Sebastia Sallent-Ribes
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper proposes a fast splitting algorithm (FSA) for a signal that when combined with an optimally criterion defined in the frequency domain leads to coherent tilings of the time- frequency plane. For a given set of basis regions formed by allowed subsets of the signal and a cost function defined over this set, we find the minimum cost cover of the signal by means of a fast algorithm. We show how when an additive cost measure is defined over the subband decomposition induced by a given filter bank, the method admits a solution in the form of a progressive orthogonal tiling. When progressive conditions are verified this method can be modelled with simple structures such as trellis diagrams or ordinary Petri nets. The extension of this method to bidimensional signals and conditions for fast algorithms are also discussed. The set of partitions obtained by the double tree algorithm is included in those considered by the FSA, allowing the later better signal analysis. We also present two approaches that reduced properly the complexity of the FSA maintaining the improvements of the method. The first one is based in constraining the set of basis regions to those with dyadic support, while the second one bounds the maximum support of basis regions.

Paper Details

Date Published: 16 September 1994
PDF: 12 pages
Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); doi: 10.1117/12.185870
Show Author Affiliations
Manuel A. Sola, Univ. Politecnica de Catalunya (Spain)
Sebastia Sallent-Ribes, Univ. Politecnica de Catalunya (Spain)

Published in SPIE Proceedings Vol. 2308:
Visual Communications and Image Processing '94
Aggelos K. Katsaggelos, Editor(s)

© SPIE. Terms of Use
Back to Top