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

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

折线链节点标注技术

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

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

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

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.     

Distributed match-making

In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called distributed match-making as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies.The work of the second author was supported in part by the Office of Naval Research under Contract N00014-85-K-0168, by the Office of Army Research under Contract DAAG29-84-K-0058, by the National Science Foundation under Grant DCR-83-02391, and by the Defence Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. Current address of both authors: CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.     

A Universal Method of Scientific Inquiry

A paradigm of scientific discovery is defined within a first-order logical framework. Within this paradigm, the concept of successful scientific inquiry is formalized and investigated. Among other results, it is shown that a simple method of scientific inquiry is universal in the sense that it leads to success on every problem for which success is in principle possible.     

图像半色调化算法研究综述

半色调化算法是图像打印输出的关键技术之一。介绍了简单阈值比较算法、使用随机数的半色调化算法、误差扩散算法、点扩散算法、按序抖动算法和抖动算法等一系列半色调化算法,并揭示了这些算法之间的联系。为了高效率地对图像做半色调化操作,商用光栅图像处理器一般使用抖动算法。抖动算法生成的半色调化图像的质量取决于所采用的抖动矩阵。基于几何分割设计半色调化抖动矩阵的方法可以在满足堆栈限制的前提下优化半色调化图像的质量。使用随机数的半色调化算法可以消除图像半色调化中产生的莫尔纹。随机半色调化算法的基础是将一定数量的随机点均匀地分布到一个正方形区域中。Asano提出了随机点均匀分布问题等价于圆形装填问题的命题,本文对该命题给出了初步的证明。最后,给出了一些有待进一步研究的图像半色调化课题。     

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.     

On problem transformability in VLSI

The two basic performance parameters that capture the complexity of any VLSI chip are the area of the chip,A, and the computation time,T. A systematic approach for establishing lower bounds onA is presented. This approach relatesA to the bisection flow, . A theory of problem transformation based on , which captures bothAT ² andA complexity, is developed. A fundamental problem, namely, element uniqueness, is chosen as a computational prototype. It is shown under general input/output protocol assumptions that any chip that decides ifn elements (each with (1+)lognbits) are unique must have =(nlogn), and thus, AT²=(n ²log² n), andA= (nlogn). A theory of VLSI transformability reveals the inherentAT ² andA complexity of a large class of related problems.This work was supported in part by the Semiconductor Research Corporation under contract RSCH 84-06-049-6.