Proactive replication for rare objects in unstructured peer-to-peer networks

Unstructured peer-to-peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. The search efficiency problem in unstructured P2P networks has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve search efficiency for rare objects. It uses an object-probing technique for peers to decide whether or not to establish replications for their objects when they join the network. This strategy can effectively increase the popularity of rare objects in order to enhance search efficiency. We also present a rare object search algorithm to reduce the overhead caused by the replication strategy. When a peer forwards a search request, the forward probability is calculated according to its neighbors' degrees and the number of neighbors' objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that our proactive replication strategy greatly improves search efficiency for rare objects with moderate communication overhead. The rare object search algorithm not only improves search efficiency for rare objects, but also achieves load balance in search.     

红外弱小目标的匹配方法研究与仿真

研究红外图像中的目标匹配问题。针对传统的红外图像中目标匹配效果不理想,匹配不准确。当红外图像中是弱小目标时,背景灰度值与目标灰度值非常相近,灰度直方图均衡化无法实现目标与背景的完整分离,导致漏匹配率较高的问题。为提高目标的匹配精度,提出一种形态学预处理的红外目标匹配方法,通过形态学算法提取出图像中的形状信息,利用形状信息将红外图像中的目标与背景完整分离,避免了只依靠灰度图像信息造成的不能完整分离目标与背景带来的漏匹配问题。进行仿真的结果证明,采用的形态学与处理的匹配方法能够完整将目标与背景分离,成功完成目标匹配,取得了满意的结果。     

一种新的知觉分割模型*

根据知觉的最新理论研究和实验结果,提出一种新的知觉模型,并用于考查计算机视觉中的分割问题.分割问题实质上是知觉表达问题,现在分割的困难性可能是知觉上局部到整体的还原论假设造成的;分割可能不是一次完成的,而是经过整体到局部的过程才最终完成.新的知觉模型将对建立更好的分割模型提供理论基础.     

Online learning and fusion of orientation appearance models for robust rigid object tracking

We introduce a robust framework for learning and fusing of orientation appearance models based on both texture and depth information for rigid object tracking. Our framework fuses data obtained from a standard visual camera and dense depth maps obtained by low-cost consumer depth cameras such as the Kinect. To combine these two completely different modalities, we propose to use features that do not depend on the data representation: angles. More specifically, our framework combines image gradient orientations as extracted from intensity images with the directions of surface normals computed from dense depth fields. We propose to capture the correlations between the obtained orientation appearance models using a fusion approach motivated by the original Active Appearance Models (AAMs). To incorporate these features in a learning framework, we use a robust kernel based on the Euler representation of angles which does not require off-line training, and can be efficiently implemented online. The robustness of learning from orientation appearance models is presented both theoretically and experimentally in this work. This kernel enables us to cope with gross measurement errors, missing data as well as other typical problems such as illumination changes and occlusions. By combining the proposed models with a particle filter, the proposed framework was used for performing 2D plus 3D rigid object tracking, achieving robust performance in very difficult tracking scenarios including extreme pose variations.     

复杂体制雷达辐射源信号特征的集对分析

为解决复杂体制雷达辐射源信号特征的评价问题,提出了基于集对分析理论的复杂体制雷达辐射源信号特征分析模型.首先对复杂体制雷达辐射源信号特征评价指标体系的指标权重作层次分析,再通过集对分析理论对复杂体制雷达辐射源信号特征评估的决策矩阵进行同一度分析,最后联合指标权重矩阵和决策同一度矩阵对复杂体制雷达辐射源信号特征进行综合评判.仿真结果表明,该模型是有效、可行的,能够更好地实现对复杂体制雷达辐射源信号特征的分析和评估.     

基于自由运动一维标定物的多摄像机参数标定方法与实验

一维标定方法易于实现且标定效率高,为了克服现有一维标定方法的一些不足,本文提出一种用一维标定物标定多摄像机内外参数的方法,首先进行两两标定,在此过程中,假定主点坐标近似已知而仅考虑畸变、焦距、旋转和平移等参数,接着利用基本矩阵及一维标定物上特征点之间的几何约束,估计两摄像机的内外参数,两两标定完成后,采用Dijkstra最短路径法和捆绑调整对多摄像机系统进行全局标定(含主点坐标),仿真和真实实验表明本文的方法是切实有效的.     

基于模糊梯度卷积核的在线棒材断面中心识别

针对传动带上严重堆叠、形状尺寸不规则的棒材,提出基于模糊梯度卷积核的在线棒材断面中心识别方法.以标准圆边缘为中心环,结合棒材断面边缘点偏离中心环的程度定义一个模糊梯度卷积核;通过模糊梯度卷积核与实时棒材断面梯度图像的卷积操作,实现棒材断面中心的增强;依次执行候选点选取、局部峰值抑制、距离检测步骤确定中心位置.实验结果表明,该方法能有效抑制棒材中心增强过程中易产生的峰值扩散现象,减少误识别和漏识别;平均计算时间为8.3 ms,满足系统实时性要求.     

基于物元分析法的水资源管理现代化评价

为科学合理地评价区域水资源管理现代化水平,从水资源保障、用水效率、水资源保护、水资源公共管理能力、水资源支撑能力5个方面构建评价指标体系,将模糊层次分析法(FAHP)和熵权法耦合,确定评价指标综合权重,基于物元理论建立水资源管理现代化评价模型。以南京市高淳区为例进行评价,结果表明,南京市高淳区水资源现代化管理水平处于初等现代化阶段,与实际情况相符,验证了所构建评价模型的可行性和有效性。     

HEGM: A hierarchical elastic graph matching for hand gesture recognition

A hierarchical scheme for elastic graph matching applied to hand gesture recognition is proposed. The proposed algorithm exploits the relative discriminatory capabilities of visual features scattered on the images, assigning the corresponding weights to each feature. A boosting algorithm is used to determine the structure of the hierarchy of a given graph. The graph is expressed by annotating the nodes of interest over the target object to form a bunch graph. Three annotation techniques, manual, semi-automatic, and automatic annotation are used to determine the position of the nodes. The scheme and the annotation approaches are applied to explore the hand gesture recognition performance. A number of filter banks are applied to hand gestures images to investigate the effect of using different feature representation approaches. Experimental results show that the hierarchical elastic graph matching (HEGM) approach classified the hand posture with a gesture recognition accuracy of 99.85% when visual features were extracted by utilizing the Histogram of Oriented Gradient (HOG) representation. The results also provide the performance measures from the aspect of recognition accuracy to matching benefits, node positions correlation and consistency on three annotation approaches, showing that the semi-automatic annotation method is more efficient and accurate than the other two methods.     

Runtime home mapping for effective memory resource usage

In tiled Chip Multiprocessors (CMPs) last-level cache (LLC) banks are usually shared but distributed among the tiles. A static mapping of cache blocks to the LLC banks leads to poor efficiency since a block may be mapped away from the tiles actually accessing it. Dynamic policies either rely on the static mapping of blocks to a set of banks (D-NUCA) or rely on the OS to dynamically load pages to statically mapped addresses (first-touch).