基于互联网图像集的室外场景建模技术综述

目前在互联网上有海量的室外场景照片,它们不仅内容覆盖面广,对同一场景有大量不同视点和光照条件下的采样,而且获取成本很低.如何利用这些照片中包含的丰富场景信息,快速、方便地构造各种逼真的虚拟场景,是互联网迅猛发展给虚拟现实、计算机图形学和计算机视觉带来的新的研究课题之一.文中分析、总结了近年来国内外互联网图像的真实场景几何建模、自然光照建模和材质反射属性建模的最新研究进展,并对其未来的发展趋势提出了一些看法.     

折线链节点标注技术

针对传统多边形位置关系计算比较烦琐,以及简单多边形的理论难以拓展到一般多边形的问题,提出标注节点状态的方法.通过定义11种位置来描述折线链上每个节点的状态,再采用"线段端点与线段"和"线段端点与邻折线"的标注方法来实现任意折线链的标注,同时利用两线段分割预处理使相交仅发生在端点处,从而使算法更高效;然后给出折线链基本位置关系的节点特征,并且探讨了三维顶点的标注方法.该方法的标注原理简单、方法实用,算法空间和时间复杂度分别为O(n)和O(n2).实验结果表明,该方法对任意形状的折线链都能实现稳定标注;通过搜索节点状态特征可以求解折线链间的相互关系,还可以实现一般折线链的碰撞检测、相交区域计算以及多边形简单化分解等.     

基于几何解析的双雷达地面目标定位算法

传统的双雷达地面目标定位算法因测量数据本身固有的误差和量测噪声,使得基于非线性估计定位算法的定位精度不高。本文研究了一种新的双雷达地面目标定位算法,该算法将已知雷达探测数据以几何方式加以表示,通过几何解析对地面目标进行定位。此外,还详细分析了各种因素在不同情况下对定位精度的影响。所研究的算法具有计算量小、远距离定位精度高等优点。最后,通过仿真验证了该算法能够提高远距离定位的定位精度。     

分布式信源编码在视频编码中的应用研究

分布式视频编码对编码器的功耗、复杂度、存储能力和传输能力都有较高的要求,而分布式信源编码理论正好适应了这一需求。为了使人们对这一技术有所了解,首先阐述了分布式视频编码的基本原理与其应用研究现状。并针对多视点分布式视频编码的Wyner—Ziv编解码器设计、虚拟“相关信道”建模、辅助边信息生成等几项关键技术存在的问题及最新研究进展进行分析和实验,最后总结了分布式信源编码理论在多视点视频编码的发展与研究方向。     

结构正则化多视图非负矩阵分解

现存非负矩阵分解（non-negative matrix factorization,NMF）研究多考虑单一视图分解数据,忽略了数据信息的全面性。此外,NMF限制其获取数据的内在几何结构。针对以上问题,提出一个结构正则化多视图非负矩阵分解算法（structure regularized multi-view nonnegative matrix factorization,SRMNMF）。首先,通过主成分分析来对数据进行全局结构的判别式学习;其次,利用流形学习来捕获数据的局部结构;然后,通过利用多视图数据的多样性和差异性来学习表征。模型提升了算法聚类的整体性能,更加有效地挖掘数据的结构信息。此外,采用高效的交替迭代算法优化目标函数得到最优的因子矩阵。在六个数据集上与现存的代表性方法比较,所提出的SRMNMF的准确率、NMI和Purity分别最大提高4.4%、6.1%和4.05%。     

An optimal algorithm for the boundary of a cell in a union of rays

In this paper we study a cell of the subdivision induced by a union ofn half-lines (or rays) in the plane. We present two results. The first one is a novel proof of theO(n) bound on the number of edges of the boundary of such a cell, which is essentially of methodological interest. The second is an algorithm for constructing the boundary of any cell, which runs in optimal (n logn) time. A by-product of our results are the notions of skeleton and of skeletal order, which may be of interest in their own right.This work was partly supported by CEE ESPRIT Project P-940, by the Ecole Normale Supérieure, Paris, and by NSF Grant ECS-84-10902.This work was done in part while this author was visiting the Ecole Normale Supérieure, Paris, France.     

An efficient algorithm for maxdominance, with applications

Given a planar setS ofn points,maxdominance problems consist of computing, for everyp S, some function of the maxima of the subset ofS that is dominated byp. A number of geometric and graph-theoretic problems can be formulated as maxdominance problems, including the problem of computing a minimum independent dominating set in a permutation graph, the related problem of finding the shortest maximal increasing subsequence, the problem of enumerating restricted empty rectangles, and the related problem of computing the largest empty rectangle. We give an algorithm for optimally solving a class of maxdominance problems. A straightforward application of our algorithm yields improved time bounds for the above-mentioned problems. The techniques used in the algorithm are of independent interest, and include a linear-time tree computation that is likely to arise in other contexts.The research of this author was supported by the Office of Naval Research under Grants N00014-84-K-0502 and N00014-86-K-0689, and the National Science Foundation under Grant DCR-8451393, with matching funds from AT&T.This author's research was supported by the National Science Foundation under Grant DCR-8506361.     

A faster divide-and-conquer algorithm for constructing delaunay triangulations

An easily implemented modification to the divide-and-conquer algorithm for computing the Delaunay triangulation ofn sites in the plane is presented. The change reduces its (n logn) expected running time toO(n log logn) for a large class of distributions that includes the uniform distribution in the unit square. Experimental evidence presented demonstrates that the modified algorithm performs very well forn2¹⁶, the range of the experiments. It is conjectured that the average number of edges it creates—a good measure of its efficiency—is no more than twice optimal forn less than seven trillion. The improvement is shown to extend to the computation of the Delaunay triangulation in theL _p metric for 1<p.This research was supported by National Science Foundation Grants DCR-8352081 and DCR-8416190.     

三维空间孔道的精确校核

二维空间孔道的传统校核方法是把三维问题化成二维问题,再简化或近似处理,这样的方法在高精度场合往往不能满足设计要求;还有的是对孔表面网格化、布尔运算等,算法复杂,难于实现。本文从计算几何理论上探讨了三维空间孔的精确校核方法,简单、易行、可靠。     

Theoretical analysis of β-LaNi5Hx(5≤x≤8): structure and energetics

The calculations of total energy, band structure, and electronic density of states and Mulliken population analysis of β-LaNi5 Hx (5≤x≤8) were performed by adopting the method of total energy based on the density functional theory. The augmented plane wave function was selected as the basis set in combination with ultra-soft pseudo-potential technology. The influence of the amount of H absorbed in alloys was discussed in terms of geometry, electronic structure and thermodynamic derived from calculated results. The results show that the amount of H absorbed and the preferred site occupation of the absorbed hydrogen atoms were controlled by the position of Hbands and the energy gap between H-bands and conduction bands. The β-phase hydrides of LaNi5 are most stable when hydrogen atom capacity coating in the range of 6 - 7.