Redundancy of signals and transformations and computational complexity of signal and image processing

Leonid P. Yaroslavsky, Vitaly Kober

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We demonstrate the use of informational redundancy of signals and transforms for reducing the computational costs of signal processing. Four concrete examples of accelerated signal processing algorithms are presented to support the idea of purposive use of signal and transform redundancy for saving the computational costs. These are an accelerated algorithm/or Fourier spectral analysis, an accelerated algorithm for computing the signal local histograms, the Quantized Discrete Fourier Transforms and recursive implementation of arbitrary digital filters. The former two reduce computation time by exploiting signal redundancy. The latter two save processing time at the expense of the accuracy of representation of the corresponding signal transforms.

Original languageEnglish
Title of host publicationProceedings - International Conference on Pattern Recognition
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages164-166
Number of pages3
ISBN (Electronic)0818662751
DOIs
StatePublished - 1994
Externally publishedYes
Event12th IAPR International Conference on Pattern Recognition - Conference C: Signal Processing - Conference D: Parallel Computing, ICPR 1994 - Jerusalem, Israel
Duration: 9 Oct 199413 Oct 1994

Publication series

NameProceedings - International Conference on Pattern Recognition
Volume3
ISSN (Print)1051-4651

Conference

Conference12th IAPR International Conference on Pattern Recognition - Conference C: Signal Processing - Conference D: Parallel Computing, ICPR 1994
Country/TerritoryIsrael
CityJerusalem
Period9/10/9413/10/94

Fingerprint

Dive into the research topics of 'Redundancy of signals and transformations and computational complexity of signal and image processing'. Together they form a unique fingerprint.

Cite this