Spatial filtering in tone reproduction and vision

This thesis is concerned with spatial filtering. What is its utility in tone reproduction? Does it exist in vision, and if so, what constraints does it impose on the nervous system?

Tone reproduction is just the art and science of taking a picture and then displaying it. The sensors available to capture an image have a greater dynamic range than the media that may be used to display it. Conventionally, spatial filtering is used to boost contrast; it ameliorates the loss of contrast that results when the sensor signal range is scaled down to fit the display range. In this thesis, a type of nonlinear spatial filtering is discussed that results in direct range reduction without range scaling. This filtering process is instantiated in a real-time image processor built using analog CMOS VLSI.

Spatial filtering must be applied with care in both artificial and natural vision systems. It is argued that the nervous system does not simply filter linearly across an image. Rather, the way that we see things implies that the nervous system filters nonlinearly. Further, many models for color vision include a high-pass filtering step in which the DC information is lost. A real-time study of filtering in color space leads to the conclusion that the nervous system is not that simple, and that it maintains DC information by referencing to white.

Random propagation in complex systems : nonlinear matrix recursions and epidemic spread

This dissertation studies long-term behavior of random Riccati recursions and mathematical epidemic model. Riccati recursions are derived from Kalman filtering. The error covariance matrix of Kalman filtering satisfies Riccati recursions. Convergence condition of time-invariant Riccati recursions are well-studied by researchers. We focus on time-varying case, and assume that regressor matrix is random and identical and independently distributed according to given distribution whose probability distribution function is continuous, supported on whole space, and decaying faster than any polynomial. We study the geometric convergence of the probability distribution. We also study the global dynamics of the epidemic spread over complex networks for various models. For instance, in the discrete-time Markov chain model, each node is either healthy or infected at any given time. In this setting, the number of the state increases exponentially as the size of the network increases. The Markov chain has a unique stationary distribution where all the nodes are healthy with probability 1. Since the probability distribution of Markov chain defined on finite state converges to the stationary distribution, this Markov chain model concludes that epidemic disease dies out after long enough time. To analyze the Markov chain model, we study nonlinear epidemic model whose state at any given time is the vector obtained from the marginal probability of infection of each node in the network at that time. Convergence to the origin in the epidemic map implies the extinction of epidemics. The nonlinear model is upper-bounded by linearizing the model at the origin. As a result, the origin is the globally stable unique fixed point of the nonlinear model if the linear upper bound is stable. The nonlinear model has a second fixed point when the linear upper bound is unstable. We work on stability analysis of the second fixed point for both discrete-time and continuous-time models. Returning back to the Markov chain model, we claim that the stability of linear upper bound for nonlinear model is strongly related with the extinction time of the Markov chain. We show that stable linear upper bound is sufficient condition of fast extinction and the probability of survival is bounded by nonlinear epidemic map.

Enlarging the depth of focus by filtering in the phase-space domain

The ambiguity function was employed as a merit function to design an optical system with a high depth of focus. The ambiguity function with the desired enlarged-depth-of-focus characteristics was obtained by using a properly designed joint filter to modify the ambiguity function of the original pupil in the phase-space domain. From the viewpoint of the filter theory, we roughly propose that the constraints of the spatial filters that are used to enlarge the focal depth must be satisfied. These constraints coincide with those that appeared in the previous literature on this topic. Following our design procedure, several sets of apodizers were synthesized, and their performances in the defocused imagery were compared with each other and with other previous designs. (c) 2005 Optical Society of America.

Filtering N.M.R. spectra

Methods of filtering an n.m.r. spectrum which can improve the resolution by as much as a factor of ten are examined. They include linear filters based upon an information theory approach and non-linear filters based upon a statistical approach. The appropriate filter is determined by the nature of the problem. Once programmed on a digital computer they are both simple to use.

These filters are applied to some examples from ¹³C and ¹⁵N n.m.r. spectra.

Some generalizations of commutativity for linear transformations on a finite dimensional vector space

Let L be the algebra of all linear transformations on an n-dimensional vector space V over a field F and let A, B, ƐL. Let A_i+1 = A_iB - BA_i, i = 0, 1, 2,…, with A = A_o. Let f_k (A, B; σ) = A_2K+1 - ^σ1^A2K-1 ^{+ σ}2^A2K-3 -… +(-1)^Kσ_KA₁ where σ = (σ₁, σ₂,…, σ_K), σ_i belong to F and K = k(k-1)/2. Taussky and Wielandt [Proc. Amer. Math. Soc., 13(1962), 732-735] showed that f_n(A, B; σ) = 0 if σ_i is the i^th elementary symmetric function of (β₄- β_s)², 1 ≤ r ˂ s ≤ n, i = 1, 2, …, N, with N = n(n-1)/2, where β₄ are the characteristic roots of B. In this thesis we discuss relations involving f_k(X, Y; σ) where X, Y Ɛ L and 1 ≤ k ˂ n. We show: 1. If F is infinite and if for each X Ɛ L there exists σ so that f_k(A, X; σ) = 0 where 1 ≤ k ˂ n, then A is a scalar transformation. 2. If F is algebraically closed, a necessary and sufficient condition that there exists a basis of V with respect to which the matrices of A and B are both in block upper triangular form, where the blocks on the diagonals are either one- or two-dimensional, is that certain products X₁, X₂…X_r belong to the radical of the algebra generated by A and B over F, where X_i has the form f₂(A, P(A,B); σ), for all polynomials P(x, y). We partially generalize this to the case where the blocks have dimensions ≤ k. 3. If A and B generate L, if the characteristic of F does not divide n and if there exists σ so that f_k(A, B; σ) = 0, for some k with 1 ≤ k ˂ n, then the characteristic roots of B belong to the splitting field of g_k(w; σ) = w^2K+1 - σ₁w^2K-1 + σ₂w^2K-3 - …. +(-1)^K σ_Kw over F. We use this result to prove a theorem involving a generalized form of property L [cf. Motzkin and Taussky, Trans. Amer. Math. Soc., 73(1952), 108-114]. 4. Also we give mild generalizations of results of McCoy [Amer. Math. Soc. Bull., 42(1936), 592-600] and Drazin [Proc. London Math. Soc., 1(1951), 222-231].

Focusing properties of concentric piecewise cylindrical vector beam

The focusing properties of a concentric piecewise cylindrical vector beam is investigated theoretically in this paper. The beam consists of three portions with different and changeable phase retardation and polarization. Numerical simulations show that the evolution of the focal shape is very considerable by changing the radius and polarization rotation angle of each portion of the vector beam. And some interesting focal spots may occur, such as two- or three-peak focus, dark hollow focus, ring focus, and two-ring-peak focus. Corresponding gradient force patterns are also computed, and novel trap patterns, including cup shell shape trap with one trap at its each side along axis, rectangle shell shape trap with one trap at its each side, dumbbell optical trap, spherical shell optical trap, may occur, which shows that the concentric piecewise cylindrical vector beam can be used to construct controllable optical tweezers. (c) 2006 Elsevier GmbH. All rights reserved.