By Topic

A fast quadratic programming algorithm for positive signal restoration

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
A. Levy ; Centre de Recherches en Physique de ĺEnvironnement, France

When processing a signal or picture by deconvolution, any additional a priori information is of prime interest since it can potentially lead to an improvement in results and to superresolution. In this framework, the positivity of the unknown signal is a current situation (each time this unknown is an intensity, a probability distribution, a histogram, etc.) but it involves a nonlinear constraint which is difficult to take into account. In this paper we state the problem in terms of a quadratic programming problem with positivity constraints and we propose a new algorithm derived from a conjugate gradient method, especially suited to this particular situation. It leads to a low cost solution. We then present experimental results on two-dimensional signals emphasizing relevant superresolution.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:31 ,  Issue: 6 )