Parallel processing architectures for iterative image restoration

A. K. Katsaggelos; S. P.R. Kumar; M. Sarrafzadeh

Parallel processing architectures for iterative image restoration

A. K. Katsaggelos^*, S. P.R. Kumar, M. Sarrafzadeh

^*Corresponding author for this work

MRC - Materials Research Center

Research output: Contribution to journal › Conference article › peer-review

Abstract

Mesh and mesh-of-pyramids implementations of iterative image restoration algorithms are proposed. These implementations are based on a single-step algorithm as well as on a multistep iterative algorithm derived from the single step regularized iterative restoration algorithm. One processor is assigned to each picture element, with local memory depending on the support of the restoration filter. The implementations consist of interprocessor communication and intraprocessor computations. The efficiency of the proposed VLSI algorithms is judged by establishing lower bounds on AT² , where A is the area of the VLSI and T is its computation time.

Original language	English (US)
Pages (from-to)	2544-2547
Number of pages	4
Journal	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume	4
State	Published - 1989
Event	1989 International Conference on Acoustics, Speech, and Signal Processing - Glasgow, Scotland Duration: May 23 1989 → May 26 1989

ASJC Scopus subject areas

Software
Signal Processing
Electrical and Electronic Engineering

Cite this

@article{90a6853ffaf1451cb2d91de1b3d59b0c,

title = "Parallel processing architectures for iterative image restoration",

abstract = "Mesh and mesh-of-pyramids implementations of iterative image restoration algorithms are proposed. These implementations are based on a single-step algorithm as well as on a multistep iterative algorithm derived from the single step regularized iterative restoration algorithm. One processor is assigned to each picture element, with local memory depending on the support of the restoration filter. The implementations consist of interprocessor communication and intraprocessor computations. The efficiency of the proposed VLSI algorithms is judged by establishing lower bounds on AT2 , where A is the area of the VLSI and T is its computation time.",

author = "Katsaggelos, {A. K.} and Kumar, {S. P.R.} and M. Sarrafzadeh",

year = "1989",

language = "English (US)",

volume = "4",

pages = "2544--2547",

journal = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

issn = "0736-7791",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "1989 International Conference on Acoustics, Speech, and Signal Processing ; Conference date: 23-05-1989 Through 26-05-1989",

}

TY - JOUR

T1 - Parallel processing architectures for iterative image restoration

AU - Katsaggelos, A. K.

AU - Kumar, S. P.R.

AU - Sarrafzadeh, M.

PY - 1989

Y1 - 1989

N2 - Mesh and mesh-of-pyramids implementations of iterative image restoration algorithms are proposed. These implementations are based on a single-step algorithm as well as on a multistep iterative algorithm derived from the single step regularized iterative restoration algorithm. One processor is assigned to each picture element, with local memory depending on the support of the restoration filter. The implementations consist of interprocessor communication and intraprocessor computations. The efficiency of the proposed VLSI algorithms is judged by establishing lower bounds on AT2 , where A is the area of the VLSI and T is its computation time.

AB - Mesh and mesh-of-pyramids implementations of iterative image restoration algorithms are proposed. These implementations are based on a single-step algorithm as well as on a multistep iterative algorithm derived from the single step regularized iterative restoration algorithm. One processor is assigned to each picture element, with local memory depending on the support of the restoration filter. The implementations consist of interprocessor communication and intraprocessor computations. The efficiency of the proposed VLSI algorithms is judged by establishing lower bounds on AT2 , where A is the area of the VLSI and T is its computation time.

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

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

M3 - Conference article

AN - SCOPUS:0024907055

SN - 0736-7791

VL - 4

SP - 2544

EP - 2547

JO - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

JF - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

T2 - 1989 International Conference on Acoustics, Speech, and Signal Processing

Y2 - 23 May 1989 through 26 May 1989

ER -

Parallel processing architectures for iterative image restoration

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this