A two-step phase-retrieval method in Fourier-transform ghost imaging

A two-step phase-retrieval method, based on Fourier-transform ghost imaging, was demonstrated. For the complex objects, the phase-retrieval process was divided into two steps: first got the complex object's amplitude from the Fourier-transform patterns of the squared object function, then combining with the Fourier-transform patterns of the object function to get the phase. The theoretical basis of this technique is outlined, and the experimental results are presented. (C) 2008 Elsevier B.V. All rights reserved.

Observing the fractional Fourier transform by free-space Fresnel diffraction

The fractional Fourier transform of an object can be observed in the free-space Fresnel diffraction pattern of the object. (C) 1997 Optical Society of America

Scaled fractional Fourier transform and its optical implementation

The scaled fractional Fourier transform is suggested and is implemented optically by one lens for different values of phi and output scale. In addition, physically it relates the FRT with the general lens transform-the optical diffraction between two asymmetrically positioned planes before and after a lens. (C) 1997 Optical Society of America.

Phase unwrapping algorithms, respectively, based on path-following and discrete cosine transform

This paper describes a path-following phase unwrapping algorithm and a phase unwrapping algorithm based on discrete cosine transform (DCT) which accelerates the Computation and suppresses the propagation of noise. Through analysis of fringe pattern with serious noises simulated in mathematic model, we make a contrast between path-following algorithm and DCT algorithm. The advantages and disadvantages or analytical fringe pattern are also given through comparison of two algorithms. Three-dimensional experimental results have been given to prove the validity of these algorithms. Despite DCT phase unwrapping technique robustness and speed in some cases, it cannot be unwrapping inconsistencies phase. The path-following algorithm can be used in automation analysis of fringe patterns with little influence of noise. (c) 2007 Elsevier GmbH. All rights reserved.

Linear Chromatic Adaptation Transform Based on Delaunay Triangulation

Computer vision algorithms that use color information require color constant images to operate correctly. Color constancy of the images is usually achieved in two steps: first the illuminant is detected and then image is transformed with the chromatic adaptation transform ( CAT). Existing CAT methods use a single transformation matrix for all the colors of the input image. The method proposed in this paper requires multiple corresponding color pairs between source and target illuminants given by patches of the Macbeth color checker. It uses Delaunay triangulation to divide the color gamut of the input image into small triangles. Each color of the input image is associated with the triangle containing the color point and transformed with a full linear model associated with the triangle. Full linear model is used because diagonal models are known to be inaccurate if channel color matching functions do not have narrow peaks. Objective evaluation showed that the proposed method outperforms existing CAT methods by more than 21%; that is, it performs statistically significantly better than other existing methods.

Bessel functions and equations of mathematical physics

The aim of this dissertation is to introduce Bessel functions to the reader, as well as studying some of their properties. Moreover, the final goal of this document is to present the most well- known applications of Bessel functions in physics.