𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast linear iterative algorithms of image restoration

✍ Scribed by A.B. Bakushinskii; A.V. Goncharskii; S.Yu. Levitan

Publisher
Elsevier Science
Year
1988
Weight
287 KB
Volume
28
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Spatially adaptive iterative algorithm f
Spatially adaptive iterative algorithm for the restoration of astronomical images
✍ Aggelos K. Katsaggelos; Moon Gi Kang πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 803 KB

This article develops an iterative spatially adaptive regularized image restoration algorithm. The proposed algorithm is based on the minimization of a weighted smoothing functional. The weighting matrices are defined as functions of the partially restored image at each iteration step. As a result,

A fast BNM (Best Neighborhood Matching):
A fast BNM (Best Neighborhood Matching): Algorithm and parallel processing for image restoration
✍ Wen Li; David Zhang; Zhiyong Liu; Xiangzhen Qiao πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 744 KB

## Abstract Best Neighborhood Matching (BNM) algorithm is a good approach of error concealment in terms of restored image quality. However, this kind of error concealment algorithm is commonly computation‐intensive, which restricts their real applications on large‐scale image or video sequence rest

Fast Fully Data-Driven Image Restoration
Fast Fully Data-Driven Image Restoration by means of Edge-Preserving Regularization
✍ Luigi Bedini; Anna Tonazzini πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 598 KB

Fast Fully Data-Driven Image Restoration by means of Edge-Preserving Regularization T he fully data driven deconvolution of noisy images is a highly ill-posed problem, where the image, the blur and the noise parameters have to be simultaneously estimated from the data alone. Our approach is to explo