Recursive overcomplete signal representations

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

For representing stationary signals several well-established methods are available. For non-stationary signals, however, these approaches can be used only with serious limitations. If the signal can be characterized as sequence of stationary intervals overcomplete signal representations help to handle such problems. This paper introduces the concept of recursive overcomplete representations using different recursive signal processing algorithms. The novelty of the paper is that an on-going set of signal transformations together with appropriate (e.g., L1 norm) minimization procedures can provide optimal on-going representations, on-going signal segmentations into stationary intervals, and on-going feature extractions for immediate utilization in diagnosis, or other applications.

Original languageEnglish
Title of host publicationConference Record - IEEE Instrumentation and Measurement Technology Conference
PublisherIEEE
Pages1090-1094
Number of pages5
Volume2
Publication statusPublished - 2000
EventIMTC/2000 - 17th IEEE Instrumentation and Measurement Technology Conference 'Smart Connectivity: Integrating Measurement and Control' - Baltimore, MD, USA
Duration: May 1 2000May 4 2000

Other

OtherIMTC/2000 - 17th IEEE Instrumentation and Measurement Technology Conference 'Smart Connectivity: Integrating Measurement and Control'
CityBaltimore, MD, USA
Period5/1/005/4/00

Fingerprint

Feature extraction
Signal processing
intervals
norms
pattern recognition
signal processing
optimization

ASJC Scopus subject areas

  • Instrumentation

Cite this

Várkonyi-Kóczy, A., & Fek, M. (2000). Recursive overcomplete signal representations. In Conference Record - IEEE Instrumentation and Measurement Technology Conference (Vol. 2, pp. 1090-1094). IEEE.

Recursive overcomplete signal representations. / Várkonyi-Kóczy, A.; Fek, Mark.

Conference Record - IEEE Instrumentation and Measurement Technology Conference. Vol. 2 IEEE, 2000. p. 1090-1094.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Várkonyi-Kóczy, A & Fek, M 2000, Recursive overcomplete signal representations. in Conference Record - IEEE Instrumentation and Measurement Technology Conference. vol. 2, IEEE, pp. 1090-1094, IMTC/2000 - 17th IEEE Instrumentation and Measurement Technology Conference 'Smart Connectivity: Integrating Measurement and Control', Baltimore, MD, USA, 5/1/00.
Várkonyi-Kóczy A, Fek M. Recursive overcomplete signal representations. In Conference Record - IEEE Instrumentation and Measurement Technology Conference. Vol. 2. IEEE. 2000. p. 1090-1094
Várkonyi-Kóczy, A. ; Fek, Mark. / Recursive overcomplete signal representations. Conference Record - IEEE Instrumentation and Measurement Technology Conference. Vol. 2 IEEE, 2000. pp. 1090-1094
@inproceedings{04bb66d4161d4eaf98c6e453f04c1a7b,
title = "Recursive overcomplete signal representations",
abstract = "For representing stationary signals several well-established methods are available. For non-stationary signals, however, these approaches can be used only with serious limitations. If the signal can be characterized as sequence of stationary intervals overcomplete signal representations help to handle such problems. This paper introduces the concept of recursive overcomplete representations using different recursive signal processing algorithms. The novelty of the paper is that an on-going set of signal transformations together with appropriate (e.g., L1 norm) minimization procedures can provide optimal on-going representations, on-going signal segmentations into stationary intervals, and on-going feature extractions for immediate utilization in diagnosis, or other applications.",
author = "A. V{\'a}rkonyi-K{\'o}czy and Mark Fek",
year = "2000",
language = "English",
volume = "2",
pages = "1090--1094",
booktitle = "Conference Record - IEEE Instrumentation and Measurement Technology Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Recursive overcomplete signal representations

AU - Várkonyi-Kóczy, A.

AU - Fek, Mark

PY - 2000

Y1 - 2000

N2 - For representing stationary signals several well-established methods are available. For non-stationary signals, however, these approaches can be used only with serious limitations. If the signal can be characterized as sequence of stationary intervals overcomplete signal representations help to handle such problems. This paper introduces the concept of recursive overcomplete representations using different recursive signal processing algorithms. The novelty of the paper is that an on-going set of signal transformations together with appropriate (e.g., L1 norm) minimization procedures can provide optimal on-going representations, on-going signal segmentations into stationary intervals, and on-going feature extractions for immediate utilization in diagnosis, or other applications.

AB - For representing stationary signals several well-established methods are available. For non-stationary signals, however, these approaches can be used only with serious limitations. If the signal can be characterized as sequence of stationary intervals overcomplete signal representations help to handle such problems. This paper introduces the concept of recursive overcomplete representations using different recursive signal processing algorithms. The novelty of the paper is that an on-going set of signal transformations together with appropriate (e.g., L1 norm) minimization procedures can provide optimal on-going representations, on-going signal segmentations into stationary intervals, and on-going feature extractions for immediate utilization in diagnosis, or other applications.

UR - http://www.scopus.com/inward/record.url?scp=0033718619&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033718619&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0033718619

VL - 2

SP - 1090

EP - 1094

BT - Conference Record - IEEE Instrumentation and Measurement Technology Conference

PB - IEEE

ER -