Projection algorithms for two-dimensional adaptive filtering applications

Robert A. Soni, W. Kenneth Jenkins

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

In this paper, we present a family of `new' two-dimensional adaptive filtering algorithms for image processing applications. These algorithms are multi-dimensional versions of the families of data-reusing and projection algorithms. These two classes of algorithms allow the adaptive filtering system designer to choose performance and computational complexity by changing parameters without actually changing algorithm structure. By changing parameters, the desired convergence rate can be achieved at the expense of additional computational complexity. Experiments show that significant improvement may be obtained by marginal increases in computational complexity over the traditional normalized LMS algorithm.

Original languageEnglish (US)
Pages (from-to)333-337
Number of pages5
JournalConference Record of the Asilomar Conference on Signals, Systems and Computers
Volume1
StatePublished - 1998

Fingerprint

Adaptive filtering
Computational complexity
Image processing
Experiments

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{4bf84028aa3541bdb8735dcd809d58f6,
title = "Projection algorithms for two-dimensional adaptive filtering applications",
abstract = "In this paper, we present a family of `new' two-dimensional adaptive filtering algorithms for image processing applications. These algorithms are multi-dimensional versions of the families of data-reusing and projection algorithms. These two classes of algorithms allow the adaptive filtering system designer to choose performance and computational complexity by changing parameters without actually changing algorithm structure. By changing parameters, the desired convergence rate can be achieved at the expense of additional computational complexity. Experiments show that significant improvement may be obtained by marginal increases in computational complexity over the traditional normalized LMS algorithm.",
author = "Soni, {Robert A.} and Jenkins, {W. Kenneth}",
year = "1998",
language = "English (US)",
volume = "1",
pages = "333--337",
journal = "Conference Record of the Asilomar Conference on Signals, Systems and Computers",
issn = "1058-6393",
publisher = "IEEE Computer Society",

}

Projection algorithms for two-dimensional adaptive filtering applications. / Soni, Robert A.; Jenkins, W. Kenneth.

In: Conference Record of the Asilomar Conference on Signals, Systems and Computers, Vol. 1, 1998, p. 333-337.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Projection algorithms for two-dimensional adaptive filtering applications

AU - Soni, Robert A.

AU - Jenkins, W. Kenneth

PY - 1998

Y1 - 1998

N2 - In this paper, we present a family of `new' two-dimensional adaptive filtering algorithms for image processing applications. These algorithms are multi-dimensional versions of the families of data-reusing and projection algorithms. These two classes of algorithms allow the adaptive filtering system designer to choose performance and computational complexity by changing parameters without actually changing algorithm structure. By changing parameters, the desired convergence rate can be achieved at the expense of additional computational complexity. Experiments show that significant improvement may be obtained by marginal increases in computational complexity over the traditional normalized LMS algorithm.

AB - In this paper, we present a family of `new' two-dimensional adaptive filtering algorithms for image processing applications. These algorithms are multi-dimensional versions of the families of data-reusing and projection algorithms. These two classes of algorithms allow the adaptive filtering system designer to choose performance and computational complexity by changing parameters without actually changing algorithm structure. By changing parameters, the desired convergence rate can be achieved at the expense of additional computational complexity. Experiments show that significant improvement may be obtained by marginal increases in computational complexity over the traditional normalized LMS algorithm.

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

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

M3 - Article

VL - 1

SP - 333

EP - 337

JO - Conference Record of the Asilomar Conference on Signals, Systems and Computers

JF - Conference Record of the Asilomar Conference on Signals, Systems and Computers

SN - 1058-6393

ER -