Background-subtraction using contour-based fusion of thermal and visible imagery

We present a new background-subtraction technique fusing contours from thermal and visible imagery for persistent object detection in urban settings. Statistical background-subtraction in the thermal domain is used to identify the initial regions-of-interest. Color and intensity information are used within these areas to obtain the corresponding regions-of-interest in the visible domain. Within each region, input and background gradient information are combined to form a Contour Saliency Map. The binary contour fragments, obtained from corresponding Contour Saliency Maps, are then fused into a single image. An A^* path-constrained search along watershed boundaries of the regions-of-interest is used to complete and close any broken segments in the fused contour image. Lastly, the contour image is flood-filled to produce silhouettes. Results of our approach are evaluated quantitatively and compared with other low- and high-level fusion techniques using manually segmented data.     

基于MapXtreme的数字校园房管系统的开发

校园规模在不断地扩大,校园房屋管理规划部门对日益更新和迅速增加的建筑物房屋信息的管理与维护愈感困难,而现有的系统对空间数据与属性数据没有很好集成,更不利于图文信息的相互查询、检索和更新等。针对如上现实问题,应用MapInfo平台中的WebGIS技术,即MapXtreme技术,以及UML统一建模技术和SQL Server数据库等技术,成功地实现了数字校园房屋管理系统设计与开发,解决了房管部门面临的查询搜索更新校园建筑房屋信息时效率低下、管理与维护困难等实际问题。     

Hadoop平台下的分形图像压缩编码

借助Hadoop平台实现了分形图像压缩编码,并将其应用于云渲染中对渲染后的图像进行压缩并传至用户阶段。采用4台PC机搭建Hadoop平台,并在此基础上进行分形图像压缩编码,实验结果表明,采用4台PC机的Hadoop平台并行压缩时间不到单台PC机压缩时间的30%,证实了该方案的现实有效性。采用分形压缩编码将云渲染后的图像传给用户具有压缩比大、传输时间短、解压缩快等特点,对改善云渲染用户体验具有重要意义。     

Map Reduce inspired loop mapping for coarse-grained reconfigurable architecture

Our work investigates how to map loops efficiently onto Coarse-Grained Reconfigurable Architecture （CGRA）. This paper examines the properties of CGRA and builds MapReduce inspired models for the loop parallelization problem. The proposed model has a more detailed performance metric and a more flexible unrolling scheme that can unroll different loop levels with different factors. A Geometric Programming based approach is proposed to resolve the optimization problem of loop parallelization problem. The proposed approach can find the optimal unrolling factor for each level loop, resulting in better parallelization of loops. Experimental results show that the proposed approach achieved up to 44% performance gain compared to the state-of-the-art loop mapping scheme.     

当前GIS软件平台简介及展望

本文比较详细的介绍了当前国内外GIS平台系统的现状,并对系统的发展进行了展望。     

基于OpenGL的电子地图

用GIS制作的电子地图成本非常高。本文介绍了一种通过OpenGL技术搭建电子地图的方法。该方法将地图信息分别放置在不同的层中,通过调整视点的位置对地图进行放大、缩小、显示特定区域。     

基于MapX的电磁环境态势显示系统研究

现代战争条件下,电子对抗与反对抗日趋激烈,各种电子装备往往采用调制复杂、参数多变的信号形式,导致战场空间的电磁环境信号空前复杂、密集且相互交迭,因此有效地显示战场电磁环境能为指挥员准确把握战场态势和作战主动权打下坚实基础。本文首先介绍了MapX控件的主要特点和功能,然后以电子地图为基础,分析了态势显示系统的组成结构和系统运行流程,其中重点介绍了系统的功能模块设计,并基于MapX控件给出了实现方法,最后以VC为开发平台,研究提出了系统的实现策略。     

A method of stepwise benchmarking for inefficient DMUs based on the proximity-based target selection

DEA is a useful nonparametric method of measuring the relative efficiency of a DMU and yielding a reference target for an inefficient DMU. However, it is very difficult for inefficient DMUs to be efficient by benchmarking a target DMU which has different input use. Identifying appropriate benchmarks based on the similarity of input endowment makes it easier for an inefficient DMU to imitate its target DMUs. But it is rare to find out a target DMU, which is both the most efficient and similar in input endowments, in real situation. Therefore, it is necessary to provide an optimal path to the most efficient DMU on the frontier through several times of a proximity-based target selection process. We propose a dynamic method of stepwise benchmarking for inefficient DMUs to improve their efficiency gradually.The empirical study is conducted to compare the performance between the proposed method and the prior methods with a dataset collected from Canadian Bank branches. The comparison result shows that the proposed method is very practical to obtain a gradual improvement for inefficient DMUs while it assures to reach frontier eventually.     

Efficient search of combinatorial maps using signatures

In this paper, we address the problem of computing canonical representations of n-dimensional combinatorial maps and of using them for efficiently searching for a map in a database. We define two combinatorial map signatures: the first one has a quadratic space complexity and may be used to decide an isomorphism with a new map in linear time whereas the second one has a linear space complexity and may be used to decide an isomorphism in quadratic time. We show that these signatures can be used to efficiently search for a map in a database.     

一种自组织特征映射网络的模糊学习方法

本文提出一种模糊熵准则以及基于模糊熵准则的复合学习准则,可以较好地指导自组织特征遇射网络的学习过程。