基于LBP的眼睛开闭检测方法

在基于机器视觉的疲劳驾驶预警系统中通过驾驶人员眼睛的状态来判断其是否疲劳是最直接和有效的途径,对眼睛的开与闭这两个基本状态的检测是判断疲劳的一个关键技术.针对红外视频人脸图像序列,提出一种基于LBP纹理检测算子的快速准确人眼开闭检测方法.该方法首先精确提取眼睛区域,然后利用对光照具有鲁棒性的LBP纹理检测算子检测眼睛区域纹理并计算其二阶矩、熵和边际分布二阶矩作为特征向量,最后使用SVM对特征向量进行分类以达到开闭检测的目的.大量实验结果表明,该方法不仅具有较高的检测准度,而且能完全满足实时要求.     

大规模定制环境下基于产品结构复杂度的工时定额制定研究

针对大规模定制环境下产品种类多、工时制定困难的特点,为了能够快速且准确获取产品工时,研究了产品结构复杂度与工时之间的关系,提出了一种基于产品结构复杂度的工时估算方法.综合考虑影响产品结构复杂度的各种因素后,针对决策结果的排序向量决定决策者权重,引入灰色关联理论,建立了产品结构复杂度计算模型.基于数据库中的工时信息,运用MATLAB软件进行编程确定产品结构复杂度和工时之间的函数关系.最后,以某企业产品加工工时估算实例,证明了所提出的估算方法的可行性.     

云环境下基于数据流的k-means聚类算法

k-means算法是一种 最常用的基于划分的聚类算法。传统的集中式k-means算法已不能适应当前呈爆炸式增长的数据规模,设计分布式k-means算法成为了目前亟需解决的问题。现有分布式k-means算法基于MapReduce计算框架且没有考虑初始聚类中心的影响。由于每个MapReduce任务均需要读写分布式文件系统,导致MapReduce不能有效表达多个任务之间的依赖关系,因此提出了一种基于数据流的计算框架,该框架建立在MapReduce之上,将数据处理过程按照数据流图建模。在该框架的基础上,提出了一种高效的k-means算法,它采用基于多次采样的初始聚类中心选取方法来实现负载均衡及减少迭代次数。实验结果表明,该算法的可扩展性较好,且效率比现有算法高。     

电动汽车参与经济调度的多目标模型

电动汽车通过V2G技术可以作为电网负荷侧的备用容量,由此提出了一个多目标优化模型,将电动汽车车主成本和经济调度成本作为其目标函数,并让电动汽车通过有序充放电来作为经济调度时的备用容量.在满足各种约束条件下,采用多目标遗传算法(NSGA-Ⅱ)对模型进行求解.电动汽车的负荷特性、负荷波动、真实风能输出和机组停运状态均采用蒙特卡洛算法得到,并以一小时为时间间隔来进行仿真.由模型的求解结果可知,通过选择合适的pareto解集中的值,可以节省车主成本和经济调度的成本,并且可以实现对负荷削峰填谷的功能.     

城市轨道交通设备监控系统的研究与探索

随着经济的发展,地铁逐渐融入我们的日常生活并成为我们生活中不可分割的一部分,越来越多的城市也将修建城市轨道交通系统.众所周知,目前地铁运营成本居高不下,在轨道交通的电力能源消耗中,照明、通风空调系统、和列车动力各占三分之一.本文结合深圳地铁龙岗线设备监控系统,,研究分析新型的城轨交通设备监控系统的组织结构及运行特点,对设备功能和节能的实现进行了进一步的探索和思考,并能在火灾等灾害或阻塞状态下,更好地协调车站设备的运行,充分发挥各种设备应有的作用,保证乘客的安全和设备的正常运行.     

基于Landsat 8影像和能量平衡的西安市热场格局研究!

基于2014年8月15日的Landsat 8影像,通过劈窗算法反演西安中心城区地表温度,定量测算热岛中心范围。估算多种地表能量分量,分析热环境格局与地表能量分量的关系。结果表明:(1)西安中心城区城市热岛集中分布在人口、居住、商业密集区、经济技术开发区以及植被覆盖较差的区域;(2)感热、波文比与地表温度呈正相关,人为热与温度呈不显著正相关,净辐射、潜热与地表温度呈显著负相关;(3)城市热岛的地表能量结构中感热与潜热差异是构成城市热岛差异的主要原因。     

Semi-supervised classification using multiple clusterings

Graph determines the performance of graph-based semi-supervised classification. In this paper, we investigate how to construct a graph from multiple clusterings and propose a method called Semi-Supervised Classification using Multiple Clusterings (SSCMC in short). SSCMC firstly projects original samples into different random subspaces and performs clustering on the projected samples. Then, it constructs a graph by setting an edge between two samples if these two samples are clustered in the same cluster for each clustering. Next, it combines these graphs into a composite graph and incorporates the resulting composite graph with a graph-based semi-supervised classifier based on local and global consistency. Our experimental results on two publicly available facial images show that SSCMC not only achieves higher accuracy than other related methods, but also is robust to input parameters.     

Multi-label classification via learning a unified object-label graph with sparse representation

Automatic annotation is an essential technique for effectively handling and organizing Web objects (e.g., Web pages), which have experienced an unprecedented growth over the last few years. Automatic annotation is usually formulated as a multi-label classification problem. Unfortunately, labeled data are often time-consuming and expensive to obtain. Web data also accommodate much richer feature space. This calls for new semi-supervised approaches that are less demanding on labeled data to be effective in classification. In this paper, we propose a graph-based semi-supervised learning approach that leverages random walks and ? ₁ sparse reconstruction on a mixed object-label graph with both attribute and structure information for effective multi-label classification. The mixed graph contains an object-affinity subgraph, a label-correlation subgraph, and object-label edges with adaptive weight assignments indicating the assignment relationships. The object-affinity subgraph is constructed using ? ₁ sparse graph reconstruction with extracted structural meta-text, while the label-correlation subgraph captures pairwise correlations among labels via linear combination of their co-occurrence similarity and kernel-based similarity. A random walk with adaptive weight assignment is then performed on the constructed mixed graph to infer probabilistic assignment relationships between labels and objects. Extensive experiments on real Yahoo! Web datasets demonstrate the effectiveness of our approach.     

Discriminative sequential association latent dirichlet allocation for visual recognition

Graphical models have been employed in a wide variety of computer vision tasks. Assignments of latent variables in typical models usually suffer the confused explanation in sampling way. In this paper we present discriminative sequential association Latent Dirichlet Allocation, a novel statistical model for the task of visual recognition, and especially focus on the case of few training examples. By introducing the switching variables and formulating the direct discriminative analysis, the sequential associations are considered as priori to establish a relevance determination mechanism to obtain the reasonable assignments of latent variables and avoid the invalid labeling oscillations. We demonstrate the power of our model on two common-used datasets, and the experiment results show that our model can achieve better performances with efficient convergence and give well interpretations of specific topic assignments at the same time.