Gelfand-Yaglom-Perez theorem for generalized relative entropy functionals

The measure-theoretic definition of Kullback-Leibler relative-entropy (or simply KL-entropy) plays a basic role in defining various classical information measures on general spaces. Entropy, mutual information and conditional forms of entropy can be expressed in terms of KL-entropy and hence properties of their measure-theoretic analogs will follow from those of measure-theoretic KL-entropy. These measure-theoretic definitions are key to extending the ergodic theorems of information theory to non-discrete cases. A fundamental theorem in this respect is the Gelfand-Yaglom-Perez (GYP) Theorem [M.S. Pinsker, Information and Information Stability of Random Variables and Process, 1960, Holden-Day, San Francisco, CA (English ed., 1964, translated and edited by Amiel Feinstein), Theorem. 2.4.2] which states that measure-theoretic relative-entropy equals the supremum of relative-entropies over all measurable partitions. This paper states and proves the GYP-theorem for Rényi relative-entropy of order greater than one. Consequently, the result can be easily extended to Tsallis relative-entropy.     

Testing the robustness of CIECAM02

CIE TC8‐01 has adopted a new color appearance model: CIECAM02¹ replaces the CIECAM97s.² The new model consists of a number of refinements and simplifications of the CIECAM97s color appearance model. This article describes further tests to the robustness of the forward and reverse modes. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 99–106, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20087     

浅析朱赛普·特拉尼的代表作法西斯大厦

介绍了法西斯大厦的基本情况，通过对朱赛普·特拉尼的代表作法西斯大厦的空间结构、承重结构、围护结构、立面结构的分析，以使人们更深刻地理解特拉尼的建筑思想，探索其积极的现实意义。     

方格网法在城市公共绿地建设规划中的应用

阐述了方格网法的含义及特点,探讨了该法的应用领域和要点,认为它在城市绿地系统规划和近期绿地建设规划中可有效指导公共绿地进行均衡布局,并分析了广州市在近期绿地建设规划中运用该法的具体实践案例,以进一步完善和论证该法的应用。     

An Efficient Code-Based Voxel-Traversing Algorithm

The paper considers an efficient approach to traversing a uniformly-subdivided space pierced by a line segment. A voxel, as the basic constituent element of the uniformly subdivided space, is restricted to having the form of a cube. The algorithm works in two steps. In the first step, the so-called Bresenham voxels are identified and, by comparing their position codes, their type of connectivity is determined. To achieve the required connectivity between neighbouring voxels, the second step of the algorithm is applied to find the missing voxels. In this way, the algorithm efficiently switches between face-, edge- and vertex-connectivity. Although the algorithm works with oating-point precision, it is extremely computationally efficient, and tests of speed compared with the Müller, Cleary & Wyvill, Amanatides & Woo, and Zemčik algorithms are described.     

用傅里叶变换计算单缝衍射的光强分布

现代光学和通讯理论由于引入了傅里叶变换的方法，使计算光学系统和通讯系统的物像的对应关系简洁、清晰。该文用傅氏变换计算长为２ａ、照度为Ａ的均匀缝光源在观察面上的光强分布为Ｉ（ｘ）＝│Ｅ（ｘ）│＾２＝ＡＡ＾２ａ＾２（ｓｉｎ２πｆａ／２πｆａ）此方法也可运用于矩形孔、圆孔等。     

Two years of operational use of Subpixel Automatic Navigation of AVHRR scheme: accuracy assessment and validation

Automated techniques for satellite imagery navigation and co-location are especially required for environmental monitoring activities intensively using satellite data. In this work are presented the results obtained after 2 years of operational use of the Subpixel Automatic Navigation of AVHRR (SANA) scheme. An automatic method for accuracy assessment of satellite navigation techniques, which permits a preliminary evaluation of their performances, dealing with a large collection of test images is also proposed. The navigation accuracy assessment, performed by using a selection of small islands as reference points, is discussed.Results achieved over more than 400 Advanced Very-High-Resolution Radiometer (AVHRR) scenes confirm that the SANA scheme is a very accurate one (computed mean navigation error is generally about one AVHRR pixel). Furthermore, because of its high processing speed, it can be considered a suitable tool for intensive satellite data processing in multitemporal analyses, especially required for environmental studies as well as for operational monitoring purposes.     

A method to find all solutions of a system of multivariate polynomial equalities and inequalities in the max algebra

In this paper we show that finding solutions of a system of multivariate polynomial equalities and inequalities in the max algebra is equivalent to solving an Extended Linear Complementarity Problem. This allows us to find all solutions of such a system of multivariate polynomial equalities and inequalities and provides a geometrical insight in the structure of the solution set. We also demonstrate that this enables us to solve many important problems in the max algebra and the max-min-plus algebra such as matrix decompositions, construction of matrices with a given characteristic polynomial, state space transformations and the (minimal) state space realization problem.Research assistant with the N.F.W.O. (Belgian National Fund for Scientific Research).Senior research associate with the N.F.W.O.     

The Method of Dynamic Palette Construction in Realistic Visualization Systems

The paper describes the colour approximation problem and the method of dynamic palette construction is suggested for its solution. The method uses the graphic display palette based on the computed true colour of the individual picture. Some aspects of human colour perception are considered. Two metrics in colour space are introduced to estimate closeness of the suggested colour approximation. The method was applied to visualize 3D scenes generated by ray tracing.     

基于双正交小波和加权NLDA的人脸识别

文章针对基于零空间线性判别分析方法在高维多类别的人脸识别应用中存在的“次优性”和“效率低”两个问题,提出了一种改进方法.该方法用加权函数重新定义类间离散矩阵以减弱边缘类带来的不良影响来改善次优性问题;并对图像进行双正交小波分解来降低分辨率以到达提高效率的目的.最后在ORL人脸库上进行了实验,通过实验确定了最优加权系数和小波分解的最佳层数,并验证了该方法比基于零空间线性判别分析方法有更高的效率和识别率.