Chrestenson函数序列的生成方法及其数学分析

本文提出了适于三种序号的Ｃｈｒｅｓｔｅｎｓｏｎ函数序列的复制方法，对其复制过程进行了数学分析，并指出当Ｃｈｒｅｓｔｅｎｓｏｎ函数退化为Ｗａｌｓｈ函数时，此方法即为复制理论中的平移复制方法。     

全金属反射光学系统结构的有限元分析

用有限元分析方法对全金属反射光学系统在各种受力状态下的变形、应力及固有频率做了全面的分析，并给出了结构多次优化后的分析结果。     

单液晶光阀彩色大屏幕投影显示

设计一电路,将彩色图象信息编码到黑白CRT的亮度之中,并将其写入液晶光阀,用白光读出,当编码合适时,读出的象颜色可与原图像一致。本文讨论了这一技术原理并进行了单液晶光阀彩色大屏幕投影的实验验证。     

A genetic algorithm for the optimisation of assembly sequences

This paper describes a Genetic Algorithm (GA) designed to optimise the Assembly Sequence Planning Problem (ASPP), an extremely diverse, large scale and highly constrained combinatorial problem. The modelling of the ASPP problem, which has to be able to encode any industrial-size product with realistic constraints, and the GA have been designed to accommodate any type of assembly plan and component. A number of specific modelling issues necessary for understanding the manner in which the algorithm works and how it relates to real-life problems, are succinctly presented, as they have to be taken into account/adapted/solved prior to Solving and Optimising (S/O) the problem. The GA has a classical structure but modified genetic operators, to avoid the combinatorial explosion. It works only with feasible assembly sequences and has the ability to search the entire solution space of full-scale, unabridged problems of industrial size. A case study illustrates the application of the proposed GA for a 25-components product.     

Efficient Reflectance and Visibility Approximations for Environment Map Rendering

We present a technique for approximating isotropic BRDFs and precomputed self-occlusion that enables accurate and efficient prefiltered environment map rendering. Our approach uses a nonlinear approximation of the BRDF as a weighted sum of isotropic Gaussian functions. Our representation requires a minimal amount of storage, can accurately represent BRDFs of arbitrary sharpness, and is above all, efficient to render. We precompute visibility due to self-occlusion and store a low-frequency approximation suitable for glossy reflections. We demonstrate our method by fitting our representation to measured BRDF data, yielding high visual quality at real-time frame rates.     

Laplace spectra as fingerprints for image recognition

In the area of image retrieval from data bases and for copyright protection of large image collections there is a growing demand for unique but easily computable fingerprints for images. These fingerprints can be used to quickly identify every image within a larger set of possibly similar images. This paper introduces a novel method to automatically obtain such fingerprints from an image. It is based on a reinterpretation of an image as a Riemannian manifold. This representation is feasible for gray value images and color images. We discuss the use of the spectrum of eigenvalues of different variants of the Laplace operator as a fingerprint and show the usability of this approach in several use cases. Contrary to existing works in this area we do not only use the discrete Laplacian, but also with a particular emphasis the underlying continuous operator. This allows better results in comparing the resulting spectra and deeper insights in the problems arising. We show how the well known discrete Laplacian is related to the continuous Laplace-Beltrami operator. Furthermore, we introduce the new concept of solid height functions to overcome some potential limitations of the method.     

时间分幅全息技术及其应用

本文介绍了一种对研究发动机燃烧过程有着重要应用价值的实验技术－时间分幅全息技术，本文就该技术中常常出现的重影问题做了重点研究，通过分析重影出现的根源，找到了一种消除重影的新方法，文章还举例说明了该技术在液体破碎机理问题保研究中的应用。     

闪光X光噪声图象的局部统计滤波

本文介绍一种噪声图象的滤波方法 ,它不需要先验的图象模型 ,而且也不会损伤边界和细小的细节 ,在相加性和相乘性噪声的情况下 ,计算与边界方向有关的子集的局部平均值和方差 ,相应地沿着边界方向的噪声就被去掉 ,同时对边界有一定的增强效果     

An improved watershed algorithm based on efficient computation of shortest paths

The present paper describes a new algorithm to calculate the watershed transform through rain simulation of greyscale digital images by means of pixel arrowing. The efficiency of this method is based on limiting the necessary neighbouring operations to compute the transform to the outmost, and in the total number of scannings performed over the whole image. The experiments demonstrate that the proposed algorithm is able to significantly reduce the running time of the fastest known algorithm without involving any loss of efficiency.