Файл: Ersoy O.K. Diffraction, Fourier optics, and imaging (Wiley, 2006)(ISBN 0471238163)(427s) PEo .pdf

ВУЗ: Не указан

Категория: Не указан

Дисциплина: Не указана

Добавлен: 28.06.2024

Просмотров: 4804

Скачиваний: 1

ВНИМАНИЕ! Если данный файл нарушает Ваши авторские права, то обязательно сообщите нам.

TWO-POINT RESOLUTION AND RECOVERY OF SIGNALS

217

Figure 14.2. Kaiser windows for N ¼ 20, and a ¼ 2, 4, 8, and 20.

Figure 14.3. The intensity diffraction pattern from a square aperture in the Fraunhofer region when apodization with the Hanning window is used along the x-direction.

x-direction than along the y-direction. This is a consequence of the apodization along the x-direction.

14.3TWO-POINT RESOLUTION AND RECOVERY OF SIGNALS

Consider the Fraunhofer diffraction pattern from a circular aperture of radius R. As discussed in Example 5.8, the intensity distribution due to a plane wave incident on


218 APODIZATION, SUPERRESOLUTION, AND RECOVERY OF MISSING INFORMATION

the circular aperture has a central lobe whose radius is given by

d ¼

0:61 ld0

ð14:3-1Þ

R

where d0 is the distance from the circular aperture. d is called the Rayleigh distance and is a measure of the limit by which two point sources can be resolved. Note that d is due to the exit pupil of the optical system, which is a finite aperture.

Finite aperture means the same thing as missing information since the wave field is truncated outside the aperture. Below the wave field is referred to as the signal since the topic discussed is the same as signal recovery in signal processing. In addition, the window function is generalized to be a distortion or transformation operator D, as commonly used in the literature on signal recovery. The coverage will still be in 1-D without loss of generality.

For a space-limited signal, the exact recovery of the signal is theoretically possible since the Fourier transform of such a signal is an analytic function [Stark, 1987]. If an analytic function is exactly known in an arbitrarily small region, the entire function can be found by analytic continuation. Consequently, if only a small part of the spectrum of such a signal is known exactly, the total spectrum and the signal can be recovered.

Unfortunately, especially due to measurement noise, the exact knowledge of part of the spectrum is often impossible. Instead, imperfect measurements and a priori information about the signal, such as positivity, finite extent, etc. are the available information.

The measured signal v can be written in terms of the desired signal u as

v ¼ Du

ð14:3-2Þ

where D is a distortion or transformation operator. With known D, the problem is to recover z (in system identification, the problem is to estimate D when v and u are known).

The straightforward approach to solve for u is to find D 1 such that

u ¼ D 1v v ¼ Du

ð14:3-3Þ

Unfortunately, D is often a difficult transformation. For example, when more than one u corresponds to the same v, D 1 does not exist. Such is the case, for example, when D corresponds to a low-pass filter. Even if D 1 can be approximated, it is often ill-conditioned such that slight errors cause large errors in the estimation of u. The problem of recovery of u under such conditions is often referred to as the inverse problem. In the following sections, signal recovery by contractions and projections will be studied as potential methods for solving inverse problems. These methods are usually implemented in terms of a priori information in the signal and spectral domains.


CONTRACTIONS

219

14.4CONTRACTIONS

In what is discussed below, signals are assumed to be vectors in a complete normed linear vector space. See Appendix B for a discussion of linear vector spaces. Vector norms are discussed in Section B.3. The Euclidian norms to be used below are as follows:

Continuous Signal

2 1

2dt31=2

juj ¼

zðtÞ

ð14:4-1Þ

4

ð

1

5

Discrete Signal

"n

ju½n&j2#1=2

juj ¼

1

ð14:4-2Þ

X

¼ 1

In the following, the signal u will be assumed to be discrete and to belong to a finite-dimensional vector space S, which can be considered to be a subset of the real space Rn or the complex space Cn, n being the dimension of the space.

Let S0 be a subspace of S. A mapping by an operator A of the vectors in S0 is defined to be nonexpansive if

jAu Avj ju vj

ð14:4-3Þ

for every u and v which belong to S0. The mapping is strictly nonexpansive if inequality holds whenever u v.

Linear operators on u are usually represented as matrices. The norm of a matrix can be defined in a number of ways. For example, the spectral norm of the linear operator A is given by

jAj ¼ RðAH AÞ 1=2

ð14:4-4Þ

where AH denotes the complex conjugate transpose of A, and R(B) is the spectral radius of B, which is the largest eigenvalue of B in absolute value. A matrix norm is said to be consistent with a vector norm if

jAuj jAjjxj

ð14:4-5Þ

For example, the spectral norm given by Eq. (14.4-4) is consistent. For a nonexpansive mapping, A must satisfy

jAj 1

ð14:4-6Þ

due to the inequality given by Eq. (14.4-3).


220 APODIZATION, SUPERRESOLUTION, AND RECOVERY OF MISSING INFORMATION

Another topic of importance is the fixed point(s) of the linear operator A. Consider

Au ¼ u

ð14:4-7Þ

Any vector u* which satisfies this equation is called a fixed point of A.

If the mapping A is strictly nonexpansive, and there are two fixed points u* and v*, then

ju v j ¼ jAu Av j < ju v j

ð14:4-8Þ

is a contradiction. It is concluded that there cannot be more than one fixed point in a strictly nonexpansive contraction.

14.4.1Contraction Mapping Theorem

When the mapping by A is strictly nonexpansive so that

jAu Avj ju vj

ð14:4-9Þ

where 0 < a < 1, then, A has a unique fixed point in S0.

Proof:

Let u0 be an arbitrary point in S0. The sequence uk ¼ Auk 1, k ¼ 1; 2; . . . is formed. The sequence ½uk& belongs to S0. We have

jukþ1

ukj ¼ jAuk

Auk 1j ajuk

uk 1j

ð14:4-10Þ

and, by repeated use of Schwarz inequality,

jukþp ukj ¼ jukþp ukþp 1 þ ukþp 1

ukþp 2 þ ukþpþ2 ukj

X

¼

p

ukþi 1j ðap 1 þ ap 2 þ þ 1Þjukþ1

ukj ð14:4-11Þ

jukþi

i¼1

Since

jzkþ1 zkj akjz1

z0j

ð14:4-12Þ

and

a

p 1

þ a

p

2

1

ap

1

ð14:4-13Þ

þ þ 1 ¼

<

;

1 a

1 a