Share Email Print
cover

Proceedings Paper

Analysis of running discrete orthogonal transforms
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In this paper, we investigate a problem in computation of running discrete orthogonal transforms (RDOT). Due to overlapping blocks of signals, the RDOT for the signal block j can be computed recurrently by representing it as sum of tow terms. The first one is obtained by a multiplication of the circular advance matrix (CAM) by the RDOT of signal block j-1, and the second term is the transform of the sparse vector, formed from the weighted differences of the samples discarded from the block j-1 and the incoming samples of the block j. The second term of this RDOT decomposition could be efficiently implemented using fast prunned algorithms. The computational complexity of the RDOT depend mainly on the implementation of the first term. General conditions on the transform matrix for which CAM is completely sparse is established.

Paper Details

Date Published: 1 February 1998
PDF: 11 pages
Proc. SPIE 3346, Sixth International Workshop on Digital Image Processing and Computer Graphics: Applications in Humanities and Natural Sciences, (1 February 1998); doi: 10.1117/12.301384
Show Author Affiliations
Karen O. Egiazarian, Tampere Univ. of Technology (Finland)
Jaakko T. Astola, Tampere Univ. of Technology (Finland)


Published in SPIE Proceedings Vol. 3346:
Sixth International Workshop on Digital Image Processing and Computer Graphics: Applications in Humanities and Natural Sciences
Emanuel Wenger; Leonid I. Dimitrov, Editor(s)

© SPIE. Terms of Use
Back to Top