Multidimensional signal restoration

Electrical engineering problem

This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (January 2017)

|

This article's lead section may be too short to adequately summarize the key points. Please consider expanding the lead to provide an accessible overview of all important aspects of the article. (December 2023)

|

In multidimensional signal processing, Multidimensional signal restoration refers to the problem of estimating the original input signal from observations of the distorted or noise contaminated version of the original signal using some prior information about the input signal and /or the distortion process.[1] Multidimensional signal processing systems such as audio, image and video processing systems often receive as input, signals that undergo distortions like blurring, band-limiting etc. during signal acquisition or transmission and it may be vital to recover the original signal for further filtering. Multidimensional signal restoration is an inverse problem, where only the distorted signal is observed and some information about the distortion process and/or input signal properties is known.[1] A general class of iterative methods have been developed for the multidimensional restoration problem with successful applications to multidimensional deconvolution,[2][3][4] signal extrapolation[5][6] and denoising.[7][8]

## Definition

[edit]

In general, the multidimensional signal restoration problem can be represented by an equation of the form,[1]

y ( n 1 , n 2 , . . . . , n m ) = D [ x ( n 1 , n 2 , . . . . . , n m ) ] {\displaystyle y(n_{1},n_{2},....,n_{m})=D[x(n_{1},n_{2},.....,n_{m})]}

where  y ( n 1 , n 2 , . . . . , n m ) {\displaystyle y(n_{1},n_{2},....,n_{m})} represents the observed m-dimensional distorted output signal,  x ( n 1 , n 2 , . . . . , n m ) {\displaystyle x(n_{1},n_{2},....,n_{m})} represents the m-dimensional undistorted input signal and  D [ ⋅ ] {\displaystyle D[\cdot ]} represents the distortion operator acting upon the input signal.  D [ ⋅ ] {\displaystyle D[\cdot ]} can be used to model a wide range of transformations such as blurring, additive noise, time limiting, band limiting etc. of multidimensional signals.[1]

A simple straightforward solution to above equation is of the form,

x ( n 1 , n 2 , . . . . , n m ) = D − 1 [ y ( n 1 , n 2 , . . . . . , n m ) ] {\displaystyle x(n_{1},n_{2},....,n_{m})=D^{-1}[y(n_{1},n_{2},.....,n_{m})]}

where  D − 1 [ ⋅ ] {\displaystyle D^{-1}[\cdot ]} is the inverse distortion operator.

However, in most cases of practical use, it may be extremely difficult to implement the inverse distortion operator  D − 1 [ ⋅ ] {\displaystyle D^{-1}[\cdot ]} or the such an inverse distortion operator may not exist and even in situations where the distortion operator  D [ ⋅ ] {\displaystyle D[\cdot ]} is known and its inverse can be approximately implemented, the resultant reconstructed signal  x ~ ( n 1 , n 2 , . . . . , n m ) {\displaystyle {\tilde {x}}(n_{1},n_{2},....,n_{m})} can have very large reconstruction errors due to the inaccuracies present in the estimation of the inverse operator  D − 1 [ ⋅ ] {\displaystyle D^{-1}[\cdot ]} .[1] A general class of iterative methods based on the idea of successive approximation is used to estimate the unknown input signal  x ( n 1 , n 2 , . . . . , n m ) {\displaystyle x(n_{1},n_{2},....,n_{m})} .

## Generalized constrained iIterative signal restoration

[edit]

Since a simple approach of recovering the input signal  x ( n 1 , n 2 , . . . . , n m ) {\displaystyle x(n_{1},n_{2},....,n_{m})} by implementing the inverse distortion operator  D − 1 [ ⋅ ] {\displaystyle D^{-1}[\cdot ]} on the observed signal  y ( n 1 , n 2 , . . . . , n m ) {\displaystyle y(n_{1},n_{2},....,n_{m})} is not practical, specific iterative restoration algorithms were developed for certain types of distortions like blurring,[3] finite signal domain support,[5] finite frequency domain support of signals[6] etc. making certain assumptions about the properties of the input signal such as finite time/spatial-domain support, non-negativity etc.[2] A generalized iterative method that can model the above-mentioned distortions and signal domain specific constraints was later developed.[2]

The general iterative solution based on successive approximation can have the following form,

x ~ k + 1 ( n 1 , n 2 , . . . . , n m ) = F [ x ~ k ( n 1 , n 2 , . . . . . , n m ) ] {\displaystyle {\tilde {x}}_{k+1}(n_{1},n_{2},....,n_{m})=F[{\tilde {x}}_{k}(n_{1},n_{2},.....,n_{m})]}

where  x ~ k + 1 ( n 1 , n 2 , . . . . , n m ) {\displaystyle {\tilde {x}}_{k+1}(n_{1},n_{2},....,n_{m})} is the estimate of the input signal at iteration  k + 1 {\displaystyle k+1} ,  x ~ k ( n 1 , n 2 , . . . . , n m ) {\displaystyle {\tilde {x}}_{k}(n_{1},n_{2},....,n_{m})} is the estimate at iteration  k {\displaystyle k} and  F [ ⋅ ] {\displaystyle F[\cdot ]} represents the iteration operator that relates signal estimate at iteration  k + 1 {\displaystyle k+1} to the signal estimate at iteration  k {\displaystyle k} .

In many cases, certain signal domain properties of the input signal to be reconstructed are known and can usually be modelled as a constraint. The constraint can be defined by the constraint operator  C {\displaystyle C} , such that

x ( n 1 , n 2 , . . . . , n m ) = C x ( n 1 , n 2 , . . . . , n m ) {\displaystyle x(n_{1},n_{2},....,n_{m})=Cx(n_{1},n_{2},....,n_{m})}

only if  x ( n 1 , n 2 , . . . . , n m ) {\displaystyle x(n_{1},n_{2},....,n_{m})} satisfies the constraint  C {\displaystyle C} . It has been shown that such a constraint operator formulation can be used to model signal domain properties like non-negativity, finite frequency domain support, finite spatial domain support.[2] The observed signal  y ( n 1 , n 2 , . . . . , n m ) {\displaystyle y(n_{1},n_{2},....,n_{m})} can thus be represented in terms of the distortion operator  D {\displaystyle D} and signal domain constraint  C {\displaystyle C} as

y ( n 1 , n 2 , . . . . , n m ) = D C x ( n 1 , n 2 , . . . . , n m ) {\displaystyle y(n_{1},n_{2},....,n_{m})=DCx(n_{1},n_{2},....,n_{m})}

where the concatenation  D C {\displaystyle DC} represents the sequence of enforcing a signal domain constraint followed by a distortion operation on the input signal  x ( n 1 , n 2 , . . . . , n m ) {\displaystyle x(n_{1},n_{2},....,n_{m})} . Under the assumption that the conditions for uniqueness and convergence of the iterative solution are met,[2] the generalized constrained iterative restoration solution is given as

x ~ k + 1 ( n 1 , n 2 , . . . . , n m ) = x ~ 0 ( n 1 , n 2 , . . . , n m ) + ( I − λ D ) C x k ( n 1 , n 2 , . . . . , n m ) {\displaystyle {\tilde {x}}_{k+1}(n_{1},n_{2},....,n_{m})={\tilde {x}}_{0}(n_{1},n_{2},...,n_{m})+(I-\lambda D)Cx_{k}(n_{1},n_{2},....,n_{m})}

x ~ 0 ( n 1 , n 2 , . . . . , n m ) = λ y {\displaystyle {\tilde {x}}_{0}(n_{1},n_{2},....,n_{m})=\lambda y}

where  λ {\displaystyle \lambda } is a constant to control convergence rate,  I {\displaystyle I} is the identity matrix and  x ~ 0 ( n 1 , n 2 , . . . , n m ) {\displaystyle {\tilde {x}}_{0}(n_{1},n_{2},...,n_{m})} is the initial estimate of  x ( n 1 , n 2 , . . . . , n m ) {\displaystyle x(n_{1},n_{2},....,n_{m})} .[2]

## Constrained iterative deconvolution

[edit]

In cases where the distortion operator is both linear and shift invariant, the distortion of the input signal can be easily modelled as a convolution

y ( n 1 , n 2 , . . . . , n m ) = x ( n 1 , n 2 , . . . . . , n m ) ∗ ∗ h ( n 1 , n 2 , . . , n m ) {\displaystyle y(n_{1},n_{2},....,n_{m})=x(n_{1},n_{2},.....,n_{m})\ast \ast h(n_{1},n_{2},..,n_{m})}

where  h ( n 1 , n 2 , . . , n m ) {\displaystyle h(n_{1},n_{2},..,n_{m})} represents the impulse response of the linear shift-invariant distortion filter. Under the assumption of linear shift-invariance, the general signal restoration problem can be transformed into a deconvolution problem with the following easily implementable iterative solution,[9]

x ~ k + 1 ( n 1 , n 2 , . . . , n m ) = λ y ( n 1 , n 2 , . . . . , n m ) + g ( n 1 , n 2 , . . . . , n m ) ∗ ∗ C [ x ~ k ( n 1 , n 2 , . . . . , n m ) ] {\displaystyle {\tilde {x}}_{k+1}(n_{1},n_{2},...,n_{m})=\lambda y(n_{1},n_{2},....,n_{m})+g(n_{1},n_{2},....,n_{m})\ast \ast C[{\tilde {x}}_{k}(n_{1},n_{2},....,n_{m})]}

g ( n 1 , n 2 , . . . . , n m ) = δ ( n 1 , n 2 , . . . . , n m ) − λ h ( n 1 , n 2 , . . . . , n m ) {\displaystyle g(n_{1},n_{2},....,n_{m})=\delta (n_{1},n_{2},....,n_{m})-\lambda h(n_{1},n_{2},....,n_{m})}

where  δ ( n 1 , n 2 , . . . , n m ) {\displaystyle \delta (n_{1},n_{2},...,n_{m})} is an m-dimensional impulse and  λ {\displaystyle \lambda } is a constant for controlling the rate of convergence. Although this solution can be easily implemented by convolution, the iterations converge to a solution only when  H ( ω 1 , ω 2 , . . . . , ω m ) ≠ 0 {\displaystyle H(\omega _{1},\omega _{2},....,\omega _{m})\neq 0} , where  H ( ω 1 , ω 2 , . . . . , ω m ) {\displaystyle H(\omega _{1},\omega _{2},....,\omega _{m})} represents the frequency response of the distortion filter  h ( n 1 , n 2 , . . . , n m ) {\displaystyle h(n_{1},n_{2},...,n_{m})} .[1][2][3]

By imposing a signal domain constraint of finite extent support and positivity over the finite region of support, the constrained iterative deconvolution solution can be guaranteed to converge.[1][2][3] Such a signal domain constraint can be realistically imposed for many cases of practical use.[3] For example, in the case of image deblurring, the blur kernel can be assumed to have a positive impulse response over a finite region of support.[3]

## Signal restoration from phase

[edit]

Image restoration from phase information and unit magnitude

In certain multidimensional signal processing applications, the phase of the frequency domain response of the input signal may be preserved even after undergoing distortion.[10] For phase preserving distortions, it is possible to uniquely restore a multidimensional signal entirely from the phase of its Fourier transform as long as conditions of uniqueness and convergence are met.[10][11]

The idea of recovering a signal from the phase of the frequency domain response of the input signal is a particularly useful result for images( 2-D signals). Assuming a phase preserving distortion and the existence of a unique solution for recovering a signal from its phase, the phase-based signal restoration algorithm takes the form of an iterative transformation between frequency domain and signal domain, where a frequency domain constraint (phase preservation) is first enforced on the Fourier Transform of the current estimate of the signal, followed by a spatial domain constraint (finite region of support) that is enforced in the signal domain on the current estimate of the signal.[10][11]

## Signal restoration from magnitude

[edit]

Image restoration from magnitude information and random initial phase Image restoration from magnitude information and 1 bit quantized initial phase

Similar to the phase-based restoration of an unknown input signal, it is also possible to restore a signal from the magnitude of the frequency domain response of the observed signal. In certain optical systems, it is much more easier to measure the magnitude of the signal or the magnitude of its Fourier transform, but it is very difficult to precisely measure the phase of either the signal or its Fourier transform. Such cases represent a magnitude preserving distortion acting on the input signal.[8][10]

Assuming a magnitude preserving distortion and the existence of a unique solution for recovering a signal from its magnitude, the magnitude-based signal restoration algorithm takes the form of an iterative transformation between frequency domain and signal domain, where a frequency domain constraint (magnitude preservation) is first enforced on the Fourier Transform of the current estimate of the signal, followed by a spatial domain constraint (finite region of support) that is enforced in the signal domain on the current estimate of the signal.[8][10][11]

Although the magnitude-based signal restoration approach is very similar to the phase-based recovery approach, the convergence of the magnitude-based recovery approach to an acceptable result is much more difficult to achieve. In general, starting with a zero phase estimate or a random phase estimate for the magnitude-based signal recovery approach may not result in convergence, where as in the case of the phase-based signal recovery approach, even starting with a constant unit magnitude for the Fourier transform of the estimated signal, results in convergence.[10] Random or zero phase initialization for magnitude-based signal recovery of images, usually does not result in acceptable reconstruction results even after a large number of iterations. On the other hand, starting with an initial phase information that is a noisy or heavily quantized version( but not random or uniform phase) of the original phase information, results in a very quick convergence of the magnitude-based signal recovery approach.[11] It has been shown that an image can be perfectly recovered from the magnitude of its Fourier transform and 1-bit quantization of the original signal phase information (i.e. the initial estimate for phase of the Fourier transform can have only two values, either  0 {\displaystyle 0} or  π {\displaystyle \pi } ).[10]

## See also

[edit]

* Deconvolution
* Deblurring
* Inverse problem
* Iterative method
* Denoising
* Blind deconvolution
* Estimation theory
* Multidimensional transform

## References

[edit]

1. ^ a b c d e f g D. Dudgeon and R. Mersereau, Multidimensional Digital Signal Processing, Prentice-Hall, First Edition, pp. 349-390, 1983.
2. ^ a b c d e f g h R. Shafer, R. Merserseau and M. Richards,"Constrained Iterative Restoration Algorithms," Proc. IEEE,69(Apr. 1981),432-50
3. ^ a b c d e f R. Merserseau and R. Schafer, "Comparitve study of iterative deconvolution algorithms," in Proc. 1978 IEEE Int. Conf. Acoustics, Speech and Signal Processing, pp.192-195, Apr.1978
4. ^ M.Richards, R. Schafer, and R. Mersereau, “An experimental study of the effects of noise on a class of iterative deconvolution algorithms,” in Proc. 1979 IEEE Int. Conf. Acoustics, Speech and Signal Processing, pp.401-404, Apr.1979
5. ^ a b A. Papoulis, “A new algorithm in spectral analysis and bandlimited extrapolation,” IEEE Trans. Circuits Syst., vol. CAS-22, pp. 735-742, 1975
6. ^ a b H. J. Landau and W. L. Miranker, “The recovery of distorted band-limited signals,’’ J. Mhth Anal. Appl., vol. 2, pp. 97-104, 1961
7. ^ B. R. Frieden, “Image enhancement and restoration,” in Picture Processing and Digital Filtering, T. S. Huang, Ed. New York: Springer-Verlag, 1975, ch. 5, pp. 177-247.
8. ^ a b c J. R Fienup, “Reconstruction of an object from the modulus of its Fourier transform,” Optics Letters, vol. 3, no. 1, pp. 27-29, July 1978
9. ^ P. H. Van Cittert, “Zum Einfluss der Spaltbreite auf die Intensitatswerteilung in Spektrallinien II,” 2. fir Physik, vol. 69, pp 298-308,1931
10. ^ a b c d e f g M. Hayes,"The Reconstruction of a Multidimensional Sequence from the phase or Magnitude of its Fourier Transform", IEEE Trans. Acoustics, Speech and Signal Processing, ASSP-30, no.2(APr. 1982),140-154
11. ^ a b c d M. Hayes III, "signal Reconstruction from Phase or Magnitude", Sc.D thesis, Department of Electrical Engineering and Computer Science, MIT (June 1981)