A portable stereo vision system for whole body surface imaging

This paper presents a whole body surface imaging system based on stereo vision technology. We have adopted a compact and economical configuration which involves only four stereo units to image the frontal and rear sides of the body. The success of the system depends on a stereo matching process that can effectively segment the body from the background in addition to recovering sufficient geometric details. For this purpose, we have developed a novel sub-pixel, dense stereo matching algorithm which includes two major phases. In the first phase, the foreground is accurately segmented with the help of a predefined virtual interface in the disparity space image, and a coarse disparity map is generated with block matching. In the second phase, local least squares matching is performed in combination with global optimization within a regularization framework, so as to ensure both accuracy and reliability. Our experimental results show that the system can realistically capture smooth and complete whole body shapes with high accuracy.     

Multi-sensor calibration through iterative registration and fusion

In this paper, a new multi-sensor calibration approach, called iterative registration and fusion (IRF), is presented. The key idea of this approach is to use surfaces reconstructed from multiple point clouds to enhance the registration accuracy and robustness. It calibrates the relative position and orientation of the spatial coordinate systems among multiple sensors by iteratively registering the discrete 3D sensor data against an evolving reconstructed B-spline surface, which results from the Kalman filter-based multi-sensor data fusion. Upon each registration, the sensor data gets closer to the surface. Upon fusing the newly registered sensor data with the surface, the updated surface represents the sensor data more accurately. We prove that such an iterative registration and fusion process is guaranteed to converge. We further demonstrate in experiments that the IRF can result in more accurate and more stable calibration than many classical point cloud registration methods.     

基于网格的散乱点曲面重构技术

提出一种利用网格技术实现散乱点曲面重构的方法,设计适合网格并行的松耦合分层重构算法,在此基础上研究基于Agent技术的智能任务分解机制和基于Condor-G技术的任务分配与调度策略,并搭建网格实验平台进行测试。对重构结果的分析表明,该技术可提高基于散乱点的曲面重构速度,降低应用成本。     

三维图像中边界曲面的抽取与半透明可视化

已有算法在重构及可视化梯度值从高到低变化且包含弱边界的边界曲面时无法分辨弱边界与噪声碎片。针对上述问题,提出边界曲面半透明显示方法。采用半透明显示技术显示边界曲面及附着在其上的小碎片,利用人的智能及知识在观察可视化结果时对小碎片及弱边界进行有效的区分。结果证明,该方法有助于正确理解及完整显示三维图像中梯度值从高到低变化的边界曲面,为进一步的交互式操作去除小碎片提供依据。     

计算机绘制曲面型房屋建筑

文中提出了一个主要解决房屋建筑中直纹曲面的计算机造型方法,为此,对这些曲面的几何性质作了分析,并结合流行的三种绘图软件进行试验;然后介绍每一种软件的造型方法,并作分析比较。     

巧用FANUC系统的刀具半径补偿功能

介绍了对刀尖补偿功能的作用、原理和使用方法 ,以车轮轮缘踏面的加工程序为例 ,说明刀具半径补偿功能的具体应用     

An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains

We describe an efficient parallel algorithm for hidden-surface removal for terrain maps. The algorithm runs in O(log ⁴ n) steps on the CREW PRAM model with a work bound of O((n+k) \polylog ( n)) where n and k are the input and output sizes, respectively. In order to achieve the work bound we use a number of techniques, among which our use of persistent data structures is somewhat novel in the context of parallel algorithms. Received July 29, 1998; revised October 5, 1999.     

竹红菌乙素对人红细胞膜蛋白荧光猝灭机理的研究

本文利用人红细胞膜蛋白内源荧光(主要指色氨酸),经加入不同的竹红菌乙素之后,引起了荧光猝灭现象,根据荧光猝灭原理分别从吸收光谱,荧光光谱,稳态变温实验和瞬态荧光等技术分析了上述的猝灭过程,实验证明:该猝灭是以动态碰撞过程为主要作用机理,据此作者提出了乙素可以用于生物膜体系的蛋白质荧光猝灭剂的理由。     

应用MODIS资料对城乡地表热通量的估算

为了揭示城市热岛形成机制,基于MODIS资料,结合自动气象站实测的气象资料,利用地表能量参数化方法估算了地表热通量,分析了城乡地表热通量的空间分布及变化特征.结果表明城乡地气热交换差异明显,与相关文献对比证明该方法是可行、有效的.     

Applications of the Conjugate Gradient method in optimal surface parameterizations

This paper concerns the solutions of very large symmetric semipositive definite (singular) linear systems involved in the problem of optimal surface parameterizations using inverse curvature mapping. Two approaches are presented that transform the singular linear systems into two kinds of symmetric positive definite linear systems, so that the famous Conjugate Gradient (CG) method can be used for solving them. Numerical experiments are run on two practical large problems to illustrate that the CG algorithm works very efficiently.