Abstract

An arithmetic operations (multiplications and divisions) count is presented for three recent algorithms that restore signals with missing high-frequency components. The cases when the discrete Fourier-transform (DFT) low-pass-filter matrices had dimensions (a) N by N and (b) N by L were studied, where N is the whole signal length and L is the length of its known part. We show that when N is large all these algorithms are 2 orders of magnitude slower for case (a) than for case (b). We also suggest a method for calculating the rank of the DFT low-pass-filter matrix for case (b) that gives more-accurate results than those previously published.

© 1985 Optical Society of America

Restoration of images with missing high-frequency components by minimizing the L₁ norm of the solution vector

Nabih N. Abdelmalek and Nobuyuki Otsu
Appl. Opt. 24(10) 1415-1420 (1985)

Restoration of images with missing high-frequency components using quadratic programming

Nabih N. Abdelmalek
Appl. Opt. 22(14) 2182-2188 (1983)

Digital image restoration using quadratic programming

N. N. Abdelmalek and T. Kasvand
Appl. Opt. 19(19) 3407-3415 (1980)

Frequency shifting of electromagnetic radiation in totally reflecting systems

D. Rogovin and B. Cox
J. Opt. Soc. Am. A 2(8) 1344-1355 (1985)

Direct fast method for time-limited signal reconstruction

Yanfei Wang, Zaiwen Wen, Zuhair Nashed, and Qiyu Sun
Appl. Opt. 45(13) 3111-3126 (2006)