Short communication: A domain decomposition technique for spline image restoration on distributed memory systems

Authors:
A. Baronio;F. Zama
Affiliations:
-;-
Venue:
Parallel Computing
Year:
1996

Citing 8
Cited 1

Analysis of discrete ill-posed problems by means of the L-curve

SIAM Review
Parallel image processing applications on a network of workstations

Parallel Computing
Restoring images degraded by spatially-variant blur

Restoring images degraded by spatially-variant blur
A method for solving the indirect approximation problem

Applied Mathematics and Computation
Least Squares Image Restoration Using Spline Basis Functions

IEEE Transactions on Computers
The Application of Constrained Least Squares Estimation to Image Restoration by Digital Computer

IEEE Transactions on Computers
A regularized iterative image restoration algorithm

IEEE Transactions on Signal Processing
Methods for choosing the regularization parameter and estimating the noise variance in image restoration and their relation

IEEE Transactions on Image Processing

Alignment of large image series using cubic B-splines tessellation: application to transmission electron microscopy data

MICCAI'07 Proceedings of the 10th international conference on Medical image computing and computer-assisted intervention

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of image restoration is considered when the point spread function is Space Variant Non Separable. The algorithm determines a continuous approximation of the original object, following the continuous object-discrete image approach. The image spatial domain is decomposed into subdomains and the local approximants are computed on a distributed memory environment. The continuity of the solution across the image subdomains is obtained by adding a suitable overlapping area to the sides of the subdomains. Numerical experiments have been carried out on a Hypercube Intel iPSC/860 and the most interesting results are reported.