✦ LIBER ✦

Implementation of the regularized structured total least squares algorithms for blind image deblurring

✍ Scribed by N. Mastronardi; P. Lemmerling; A. Kalsi; D.P. O’Leary; S. Van Huffel

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 406 KB
Volume: 391
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2004.07.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A regularized structured total least squ

A regularized structured total least squares algorithm for high-resolution image reconstruction

✍ Haoying Fu; Jesse Barlow 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 460 KB

High-resolution image reconstruction is an important problem in image processing. In general, the blurring matrices are ill-conditioned, and it is necessary to compute a regularized solution. Moreover, error exists not only in the blurred image but also the blurring matrix, thus the total least squa

Fast regularized structured total least

Fast regularized structured total least squares algorithm for solving the basic deconvolution problem

✍ N. Mastronardi; P. Lemmerling; S. Van Huffel 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB 👁 1 views

Systolic implementation of the lattice a

Systolic implementation of the lattice algorithm for least squares linear prediction problems

✍ A.W. Bojanczyk 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 656 KB

A fast, direct algorithm for the least-s

A fast, direct algorithm for the least-squares fitting of two sets of atomic coordinates of macromolecular structures

✍ Zong Jie Liu; Roland Van Rapenbusch 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB 👁 2 views

By use of rotation angle method a direct algorithm is derived, which determines the least-squares superposition that matches two sets of atomic coordinates. The program based on this algorithm runs fast. The solution obtained by this algorithm cannot be trapped by any local minimum. Testing examples