Interference, reduced action, and trajectories

Instead of investigating the interference between two stationary, rectilinear wave functions in a trajectory representation by examining the two rectilinear wave functions individually, we examine a dichromatic wave function that is synthesized from the two interfering wave functions. The physics of interference is contained in the reduced action for the dichromatic wave function. As this reduced action is a generator of the motion for the dichromatic wave function, it determines the dichromatic wave function's trajectory. The quantum effective mass renders insight into the behavior of the trajectory. The trajectory in turn renders insight into quantum nonlocality.Comment: 12 pages text, 5 figures. Typos corrected. Author's final submission. A companion paper to "Welcher Weg? A trajectory representation of a quantum Young's diffraction experiment", quant-ph/0605121. Keywords: interference, nonlocality, trajectory representation, entanglement, dwell time, determinis

OPERA data and The Equivalence Postulate of Quantum Mechanics

An interpretation of the recent results reported by the OPERA collaboration is that neutrinos propagation in vacuum exceeds the speed of light. It has been further been suggested that this interpretation can be attributed to the variation of the particle speed arising from the Relativistic Quantum Hamilton Jacobi Equation. I show that this is in general not the case. I derive an expression for the quantum correction to the instantaneous relativistic velocity in the framework of the relativistic quantum Hamilton-Jacobi equation, which is derived from the equivalence postulate of quantum mechanics. While the quantum correction does indicate deviations from the classical energy--momentum relation, it does not necessarily lead to superluminal speeds. The quantum correction found herein has a non-trivial dependence on the energy and mass of the particle, as well as on distance travelled. I speculate on other possible observational consequences of the equivalence postulate approach.Comment: 8 pages. Standard LaTex. References adde

Shape from periodic texture using the eigenvectors of local affine distortion

This paper shows how the local slant and tilt angles of regularly textured curved surfaces can be estimated directly, without the need for iterative numerical optimization, We work in the frequency domain and measure texture distortion using the affine distortion of the pattern of spectral peaks. The key theoretical contribution is to show that the directions of the eigenvectors of the affine distortion matrices can be used to estimate local slant and tilt angles of tangent planes to curved surfaces. In particular, the leading eigenvector points in the tilt direction. Although not as geometrically transparent, the direction of the second eigenvector can be used to estimate the slant direction. The required affine distortion matrices are computed using the correspondences between spectral peaks, established on the basis of their energy ordering. We apply the method to a variety of real-world and synthetic imagery

Structural graph matching using the EM algorithm and singular value decomposition

This paper describes an efficient algorithm for inexact graph matching. The method is purely structural, that is, it uses only the edge or connectivity structure of the graph and does not draw on node or edge attributes. We make two contributions: 1) commencing from a probability distribution for matching errors, we show how the problem of graph matching can be posed as maximum-likelihood estimation using the apparatus of the EM algorithm; and 2) we cast the recovery of correspondence matches between the graph nodes in a matrix framework. This allows one to efficiently recover correspondence matches using the singular value decomposition. We experiment with the method on both real-world and synthetic data. Here, we demonstrate that the method offers comparable performance to more computationally demanding method

Correcting curvature-density effects in the Hamilton-Jacobi skeleton

The Hainilton-Jacobi approach has proven to be a powerful and elegant method for extracting the skeleton of two-dimensional (2-D) shapes. The approach is based on the observation that the normalized flux associated with the inward evolution of the object boundary at nonskeletal points tends to zero as the size of the integration area tends to zero, while the flux is negative at the locations of skeletal points. Nonetheless, the error in calculating the flux on the image lattice is both limited by the pixel resolution and also proportional to the curvature of the boundary evolution front and, hence, unbounded near endpoints. This makes the exact location of endpoints difficult and renders the performance of the skeleton extraction algorithm dependent on a threshold parameter. This problem can be overcome by using interpolation techniques to calculate the flux with subpixel precision. However, here, we develop a method for 2-D skeleton extraction that circumvents the problem by eliminating the curvature contribution to the error. This is done by taking into account variations of density due to boundary curvature. This yields a skeletonization algorithm that gives both better localization and less susceptibility to boundary noise and parameter choice than the Hamilton-Jacobi method

Recovery of surface orientation from diffuse polarization

When unpolarized light is reflected from a smooth dielectric surface, it becomes partially polarized. This is due to the orientation of dipoles induced in the reflecting medium and applies to both specular and diffuse reflection. This paper is concerned with exploiting polarization by surface reflection, using images of smooth dielectric objects, to recover surface normals and, hence, height. This paper presents the underlying physics of polarization by reflection, starting with the Fresnel equations. These equations are used to interpret images taken with a linear polarizer and digital camera, revealing the shape of the objects. Experimental results are presented that illustrate that the technique is accurate near object limbs, as the theory predicts, with less precise, but still useful, results elsewhere. A detailed analysis of the accuracy of the technique for a variety of materials is presented. A method for estimating refractive indices using a laser and linear polarizer is also given

Graph matching with a dual-step EM algorithm

This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifying point-correspondence matches. Unification is realized by constructing a mixture model over the bipartite graph representing the correspondence match and by affecting optimization using the EM algorithm. According to our EM framework, the probabilities of structural correspondence gate contributions to the expected likelihood function used to estimate maximum likelihood transformation parameters. These gating probabilities measure the consistency of the matched neighborhoods in the graphs. The recovery of transformational geometry and hard correspondence matches are interleaved and are realized by applying coupled update operations to the expected log-likelihood function. In this way, the two processes bootstrap one another. This provides a means of rejecting structural outliers. We evaluate the technique on two real-world problems. The first involves the matching of different perspective views of 3.5-inch floppy discs. The second example is furnished by the matching of a digital map against aerial images that are subject to severe barrel distortion due to a line-scan sampling process. We complement these experiments with a sensitivity study based on synthetic data

A study of pattern recovery in recurrent correlation associative memories

In this paper, we analyze the recurrent correlation associative memory (RCAM) model of Chiueh and Goodman. This is an associative memory in which stored binary memory patterns are recalled via an iterative update rule. The update of the individual pattern-bits is controlled by an excitation function, which takes as its arguement the inner product between the stored memory patterns and the input patterns. Our contribution is to analyze the dynamics of pattern recall when the input patterns are corrupted by noise of a relatively unrestricted class. We make three contributions. First, we show how to identify the excitation function which maximizes the separation (the Fisher discriminant) between the uncorrupted realization of the noisy input pattern and the remaining patterns residing in the memory. Moreover, we show that the excitation function which gives maximum separation is exponential when the input bit-errors follow a binomial distribution. Our second contribution is to develop an expression for the expectation value of bit-error probability on the input pattern after one iteration. We show how to identify the excitation function which minimizes the bit-error probability. However, there is no closed-form solution and the excitation function must be recovered numerically. The relationship between the excitation functions which result from the two different approaches is examined for a binomial distribution of bit-errors. The final contribution is to develop a semiempirical approach to the modeling of the dynamics of the RCAM. This provides us with a numerical means of predicting the recall error rate of the memory. It also allows us to develop an expression for the storage capacity for a given recall error rate

Gas separation properties of new polyoxadiazole and polytriazole membranes

The gas separation properties of new aromatic poly-1,2,4-triazole and poly-1,3,4-oxadiazole membranes have been systematically investigated. Various functional groups were incorporated as pendent groups onto the polymer backbone of poly-1,2,4-triazoles. A wide permeability/selectivity spectrum was covered with the choice of functional groups incorporated into the polymer backbone of poly-1,3,4-oxadiazoles. High permeabilities were found for poly-1,3,4-oxadiazoles with a 1,1,3-trimethyl-3-phenylindane (PIDA-POD) and a 4,4′(2,2′-diphenyl)hexafluor propane (HF-POD) unit in the polymer backbone, while incorporation of a 4,4′-diphenyl ether unit (DPE-POD) results in a polymer with a low permeability but an extremely high selectivity. While the permeabilities vary over four orders of magnitude, the solubility remains almost constant and, therefore, the increase in permeability is mainly due to an increase in diffusivity. The permeability is discussed in terms of the polymer free volume