Camouflage texture evaluation using a saliency map

Multimedia Systems - Camouflage effect evaluation and examination is an important procedure in digital camouflage pattern design as it is helpful in improving the objectivity and effectiveness...     

Recover Fault Services via Complex Service-to-Node Mappings in Wireless Sensor Networks

With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node’s perspective i.e., migrating the service of faulty node to it’s nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don’t fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level.     

An interactive lung field segmentation scheme with automated capability

Feasible clinical application of any automated segmenting methodology demands more than just accuracy. Amendment to the automated delineation is necessary when the algorithm fails, however, integrated solution to such a scenario is largely absent in literature. Hence in this survey we devised an architecture that does both the automated and interactive lung field localizations using a single segmenting engine—random walker algorithm—so that intuitive amendment is only necessary when the automated generated delineation is unsatisfactory. The algorithm proceeds by first extracting 18 intensity profiles running horizontally, each of them equally spacing apart, and in each intensity profile three extreme points denoting the two lungs and the esophagus are determined through profile matching. This done, the algorithm removes profiles that do not intersect with the lung, and the rest of the extreme points are plugged into random walker algorithm to perform segmentation. The achieved accuracy in localization by the above was 0.8875 in terms of overlap measure (the maximum value for this parameter is 1) over 341 images. In the case where unsatisfactory delineation prompts amendment necessary, the user can interactively segment the lung by just a shift on some of the previous-determined points to the desired locations, and random walker algorithm is run again with the amended input. By such a fusion, the benefits of both the automated and interactive segmentation are shared in a single architecture.     

Extension of the gap statistics index to fuzzy clustering

The well-known gap statistic index proposed by Tibshirani et al. has successfully applied in many clustering evaluations. However, the gap statistic index cannot evaluate the clustering partitions from any fuzzy clustering algorithm. This is because fuzzy clustering cannot provide the within-cluster similarity measure that is used in the gas statistic index. Thus, the applicable range of the gap statistic index is very limited. In this paper, we present a new method that extends the gap statistic index to fuzzy clustering by using fuzzy membership notations. Our proposed method can extend the applicability of the gap statistic index, and outperform other existing fuzzy indices in several aspects. Experiments on eight sets of synthetic and real datasets are used to verify the applicability and efficiency of the proposed method.     

高压切割喷嘴冲击磨损的数值分析

以复用矿井含煤颗粒的水对高压切割喷嘴的磨损物理问题为研究对象,采用计算流体力学理论进行数值计算,分析讨论了质量浓度为10、15、20、25、30、40 mg/L条件下速度、剪应力、磨损的分布以及变化关系。计算、分析结果表明:磨损主要发生在出口部位和锥体的后半部份,入口部份和锥体前半部份磨损较小;入口部位、锥体部位磨损量、剪应力随质量浓度增加变化较小;出口部位磨损量在质量浓度为10～20 mg/L减小较快,超过20 mg/L后变化不大;出口部位流体速度、磨损量、剪应力与质量浓度间存在对应关系。煤粒入口速度与混合物速度相同、锥体部位煤粒流体速度低于锥体部位混合物速度(平均值)约79.4%;煤粒出口部位速度随质量浓度的增大而呈现先增加后减小的趋势,速度最大值发生在浓度20 mg/L。     

光学薄膜元器件外观特性机器视觉检测系统

本系统利用工业级摄像头及开发包的机器视觉功能与计算软件编程控制技术相结合,通过与输入控制系统中的标准膜片模板外观品质进行对比,实现高速高效、准确识别检测光学薄膜器件中滤光片的外观缺陷。可在生产线上根据外观品质标准模板中设定的类别进行自动分类装盒。     

浅谈我国网络数据库的发展及对策

从网络数据库的概念、特点、发展趋势等方面论述了我国网络数据库的发展情况,针对我国网络数据库存在的问题提出了发展我国网络数据库的对策.     

Supervised classification of share price trends

Share price trends can be recognized by using data clustering methods. However, the accuracy of these methods may be rather low. This paper presents a novel supervised classification scheme for the recognition and prediction of share price trends. We first produce a smooth time series using zero-phase filtering and singular spectrum analysis from the original share price data. We train pattern classifiers using the classification results of both original and filtered time series and then use these classifiers to predict the future share price trends. Experiment results obtained from both synthetic data and real share prices show that the proposed method is effective and outperforms the well-known K-means clustering algorithm.