Learning a color distance metric for region-based image segmentation

In this paper we describe an experiment where we studied empirically the application of a learned distance metric to be used as discrimination function for an established color image segmentation algorithm. For this purpose we chose the Mumford–Shah energy functional and the Mahalanobis distance metric. The objective was to test our approach in an objective and quantifiable way on this specific algorithm employing this particular distance model, without making generalization claims. The empirical validation of the results was performed in two experiments: one applying the resulting segmentation method on a subset of the Berkeley Image Database, an exemplar image set possessing ground-truths and validating the results against the ground-truths using two well-known inter-cluster validation methods, namely, the Rand and BGM indexes, and another experiment using images of the same context divided into training and testing set, where the distance metric is learned from the training set and then applied to segment all the images. The obtained results suggest that the use of the specified learned distance metric provides better and more robust segmentations, even if no other modification of the segmentation algorithm is performed.     

基于Internet的无线Mesh网络节点接入策略

针对无线Mesh网络模型在整体性能和稳定性方面存在的缺陷,利用无线节点特性引入一种适用于Internet接入的无线Mesh网络模型——FIA—WMN网络模型,并提出该模型上的节点接入控制策略。仿真实验结果表明,该模型及接入策略能有效改善无线Mesh网络的性能。     

无线传感器网络中能量均衡可靠路由度量方法

针对无线传感器网络的资源限制以及对传输可靠性的特殊要求,提出一种能量均衡路由度量方法EBETX。以ETX值作为路由度量的同时,兼顾网络中节点能量消耗情况,保证网络各节点能量均衡消耗,延长网络的生存时间,实现高效路由与能量均衡的有效权衡。通过NS2仿真实验验证了该方法的可行性。     

基于概率的无监督缺陷预测方法

软件缺陷预测能够提高软件开发和测试的效率,保障软件质量。无监督缺陷预测方法具有不需要标签数据的特点,从而能够快速应用于工程实践中。提出了基于概率的无监督缺陷预测方法—PCLA,将度量元值与阈值的差值映射为概率,使用概率评估类存在缺陷的可能性,然后再通过聚类和标记来完成缺陷预测,以解决现有无监督方法直接根据阈值判断时对阈值比较敏感而引起的信息丢失问题。将PCLA方法应用在NetGen和Relink两组数据集,共7个软件项目上,实验结果表明PCLA方法在查全率、查准率、F-measure上相对现有无监督方法分别平均提升4.1%、2.52%、3.14%。     

Complexity and design of QoS routing algorithms in wireless mesh networks

Quality of service (QoS) provisioning in wireless mesh networks (WMNs) is an open issue to support emerging multimedia services. In this paper, we study the problem of QoS provisioning in terms of end-to-end bandwidth allocation in WMNs. It is challenging due to interferences in the networks. We consider widely used interference models and show that except a few special cases, the problem of finding a feasible path is NP-complete under the models. We propose a k-shortest path based algorithmic framework to solve this problem. We also consider the problem of optimizing network performance by on-line dynamic routing, and adapt commonly used conventional QoS routing metrics to be used in WMNs. We find the optimal solutions for these problems through formulating them as optimization models. A model is developed to check the existence of a feasible path and another to find the optimal path for a demand; moreover, an on-line optimal QoS routing algorithm is developed. Comparing the algorithms implemented by the proposed framework with the optimization models shows that our solution can find existing feasible paths with high probability, efficiently optimizes path lengths, and has a comparable performance to the optimal QoS routing algorithm. Furthermore, our results show that contrary to wireline networks, minimizing resource consumption should be preferred over load distribution even in lightly loaded WMNs.     

Mathematical Morphology Based on Linear Combined Metric Spaces on Z2 (Part I): Fast Distance Transforms

Mathematical Morphology (MM) is a general method for image processing based on set theory. The two basic morphological operators are dilation and erosion. From these, several non linear filters have been developed usually with polynomial complexity, and this because the two basic operators depend strongly on the definition of the structural element. Most efforts to improve the algorithm's speed for each operator are based on structural element decomposition and/or efficient codification.A new framework and a theoretical basis toward the construction of fast morphological operators (of zero complexity) for an infinite (countable) family of regular metric spaces are presented in work. The framework is completely defined by the three axioms of metric. The theoretical basis here developed points out properties of some metric spaces and relationships between metric spaces in the same family, just in terms of the properties of the four basic metrics stated in this work. Concepts such as bounds, neighborhoods and contours are also related by the same framework.The presented results, are general in the sense that they cover the most commonly used metrics such as the chamfer, the city block and the chess board metrics. Generalizations and new results related with distances and distance transforms, which in turn are used to develop the morphologic operations in constant time, in contrast with the polynomial time algorithms are also given.     

不同数据分配方式下并行系统的可扩展性

本文以高斯消去法为例,从理论和实验上给出了一般可扩展性分析步骤,分析了不同数据分配策略对并行算法和机器组合体可扩展性的影响。这对算法可扩展性分析的推广是很有意义的。     

并行程序的优化与性能评价

文中讨论了并行程序的优化问题,指出并行程序的优化应从数据划分、通信优化和串行优化三个方面着手。针对传统加速比的缺点和不足,我们提出了优化加速比模型来评价优化并行程序的性能;对ＮＡＳ基准测试程序ＭＧ和ＦＴ进行了优化,用优化加速比模型分析了上述两个程序在ＩＢＭ ＳＰ２上的性能。     

IEEE802.11p下删余卷积编码译码方法的研究

应用于智能交通系统的无线接入协议IEEE802.11p,其物理层卷积编码的码率可通过对(2,1,7)卷积编码器的删余来实现。讨论了删余位置的图案和算法,分析了在删余位置插入不同哑元时维特比译码后误码率的统计特性。仿真的同时比较了固定哑元下不同码率所引入的误比特率。