3D Reconstruction of Large-Depth Objects Using Fresnel Diffraction of a Ronchi Grating and Simultaneous Recording of Reference and Object Fringes

We propose an active triangulation based range-finding system that, besides its simplicity, has two advantages over similar existing systems. First, the system can acquire range data for large-depth objects since it generates an illumination pattern with large-depth of focus using Fresnel diffraction from a Ronchi grating projected over the entire object surface. Secondly, the system does not need preliminary recording of reference fringes since it displays simultaneously, on a single image, both reference and object deformed fringes. This system offers other properties: it is mechanically simple, uses everyday optical components, is low cost, can be operated via a PC and uses relatively simple image analysis software. Three dimensional reconstructions are illustrated for various objects having 10 cm maximum depth variations. The depth accuracy (typically 0.5 mm for an object located at 350 mm from the camera) is comparable with other systems, but a certain compromise has to be accepted in acquisition time (typically 1 minute). This system can find applications in research laboratories as a tool to provide range data with relatively good depth accuracy.     

NA随机变量序列的最大部分和不等式及有界重对数律

本文给出了NA随机变量序列关于最大部分和的概率不等式及矩不等式,并获得了NA随机变量序列的Teicher型和Egorov型有界重对数律等.     

Characteristics pathlength Fresnel number equations and ideal lens wavefront Kirchhoff formulation: analysis of focused spherical wave diffraction fields

Derivation and applications of the characteristics optical pathlength Fresnel number equation for spherical waves focused by an ‘ideal’ circular lens illustrate the wealth of information which is quickly available from its use. A Kirchhoff wavefront diffraction formulation of this problem is developed and used to aid in this analysis. New characteristics about the diffraction field are revealed.     

Playing with mixed strategies on infinite sets

We prove that the property of having a value and Vervoort's Strong Zero-One Law transfer from infinite perfect information games played with mixed strategies on finite sets to those on countable sets. Received April 2001/Final version June 2002     

PN结内建电势是电源吗

文献[1]作者认为“效应“一文是错误的,是曲解了经曲光伏理论,并认为经典光伏理论是“无暇可击“的,不用修正的观点,本文根据微分欧姆定律,证明了经典光伏理论存在严重错误,必须修正.     

光激光拾自谐振传感器的光学特性及优化设计

建立了光激、光拾自谐振多晶硅微机械传感器的多层膜系模型,利用该模型对传感器的光学特性进行了理论分析,并对传感器谐振微梁厚度和空腔高度进行了优化.     

A note on the functional law of iterated logarithm for maxima of Gaussian sequences

Let {X_n, n ≥ 1} be a real-valued stationary Gaussian sequence with mean zero and variance one. Let M_n = max{X_t, i ≤ n} and H_n(t) = (M_[nt] ? b_n)a_n^?1 be the maximum resp. the properly normalised maximum process, where $\text{c}{}_{\mathrm{n}}\text{= (2}\text{log}\text{n)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$, $\text{a}{}_{\mathrm{n}}\text{=}\text{(}\text{log log}\text{n)}\text{c}{}_{\mathrm{n}}$ and $\text{b}{}_{\mathrm{n}}\text{= c}{}_{\mathrm{n}}\text{?}\text{1}\text{2}\text{(}\text{log}\text{(4π}\text{log}\text{n))}\text{c}{}_{\mathrm{n}}$. We characterize the almost sure limit functions of (H_n)_n≥3 in the set of non-negative, non-decreasing, right-continuous, real-valued functions on (0, ∞), if r(n) (log n)^3?Δ = O(1) for all Δ > 0 or if r(n) (log n)^2?Δ = O(1) for all Δ > 0 and r(n) convex and fulfills another regularity condition, where r(n) is the correlation function of the Gaussian sequence.     

复通菲涅耳光学相关滤波器

本文介绍了一种同区复通菲涅耳全息滤波器的制备方法,井基于此种滤波器实现了多个模式的光学相关识别。文中给出了同区复通菲涅耳全息滤波器的理论分析,并给出了相关识别的实验结果。     

On random power series with nonidentically distributed coefficients

The distribution of the radius of convergence r(ω) of a random power series with nonidentically distributed coefficients is considered. The results obtained here extend the well-known work in the identically distributed case.     

The Law of the Iterated Logarithm for the Total Length of the Nearest Neighbor Graph

Let be the Poisson point process with intensity 1 in [–n,n] ^d . We prove the law of the iterated logarithm for the total length of the nearest neighbor graph on .