Signal restoration using efficient constrained least squares techniques

D. O. Walsh, Michael W Marcellin, P. A. Delaney

Research output: Contribution to journalArticle

Abstract

The problem of restoring missing samples from a flnite-time or space-domain vector, given a portion of its discrete frequency spectrum (DFT) and known bounds on the missing samples, is investigated. A matrix-based solution technique is proposed as a numerically efficient alternative to iterative solution via alternating projections onto convex sets (POCS). The problem is formulated as a set of linear equations that relate the known time and frequency samples to the missing timedomain samples. Finitely convergent gradient-based search algorithms are employed to compute the constrained least squares solution to this set of linear equations. It is shown that if the set of linear equations is exactly or overdetermined, the POCS iteration will converge to the solution computed by the gradient search method. The numerical efficiency of the proposed technique is demonstrated by a 1-D slab profile inversion example.

Original languageEnglish (US)
Pages (from-to)818
Number of pages1
JournalIEEE Transactions on Signal Processing
Volume45
Issue number3
StatePublished - 1997

Fingerprint

Linear equations
Restoration

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing

Cite this

Signal restoration using efficient constrained least squares techniques. / Walsh, D. O.; Marcellin, Michael W; Delaney, P. A.

In: IEEE Transactions on Signal Processing, Vol. 45, No. 3, 1997, p. 818.

Research output: Contribution to journalArticle

@article{be4eae6f7c614ed5960cb72b06e46f2b,
title = "Signal restoration using efficient constrained least squares techniques",
abstract = "The problem of restoring missing samples from a flnite-time or space-domain vector, given a portion of its discrete frequency spectrum (DFT) and known bounds on the missing samples, is investigated. A matrix-based solution technique is proposed as a numerically efficient alternative to iterative solution via alternating projections onto convex sets (POCS). The problem is formulated as a set of linear equations that relate the known time and frequency samples to the missing timedomain samples. Finitely convergent gradient-based search algorithms are employed to compute the constrained least squares solution to this set of linear equations. It is shown that if the set of linear equations is exactly or overdetermined, the POCS iteration will converge to the solution computed by the gradient search method. The numerical efficiency of the proposed technique is demonstrated by a 1-D slab profile inversion example.",
author = "Walsh, {D. O.} and Marcellin, {Michael W} and Delaney, {P. A.}",
year = "1997",
language = "English (US)",
volume = "45",
pages = "818",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Signal restoration using efficient constrained least squares techniques

AU - Walsh, D. O.

AU - Marcellin, Michael W

AU - Delaney, P. A.

PY - 1997

Y1 - 1997

N2 - The problem of restoring missing samples from a flnite-time or space-domain vector, given a portion of its discrete frequency spectrum (DFT) and known bounds on the missing samples, is investigated. A matrix-based solution technique is proposed as a numerically efficient alternative to iterative solution via alternating projections onto convex sets (POCS). The problem is formulated as a set of linear equations that relate the known time and frequency samples to the missing timedomain samples. Finitely convergent gradient-based search algorithms are employed to compute the constrained least squares solution to this set of linear equations. It is shown that if the set of linear equations is exactly or overdetermined, the POCS iteration will converge to the solution computed by the gradient search method. The numerical efficiency of the proposed technique is demonstrated by a 1-D slab profile inversion example.

AB - The problem of restoring missing samples from a flnite-time or space-domain vector, given a portion of its discrete frequency spectrum (DFT) and known bounds on the missing samples, is investigated. A matrix-based solution technique is proposed as a numerically efficient alternative to iterative solution via alternating projections onto convex sets (POCS). The problem is formulated as a set of linear equations that relate the known time and frequency samples to the missing timedomain samples. Finitely convergent gradient-based search algorithms are employed to compute the constrained least squares solution to this set of linear equations. It is shown that if the set of linear equations is exactly or overdetermined, the POCS iteration will converge to the solution computed by the gradient search method. The numerical efficiency of the proposed technique is demonstrated by a 1-D slab profile inversion example.

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

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

M3 - Article

AN - SCOPUS:33747730872

VL - 45

SP - 818

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 3

ER -