检索结果-内蒙古大学图书馆

Fusion of visible and thermal images for facial expression recognition

Frontiers of Computer science 2014年第2期8卷 232-242页

作者： Shangfei WANG Shan HE Yue WU Menghua HE Qiang JI School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Key Lab of Computing and Communicating Software of Anhui Province Hefei 230027 China Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute Troy NY12180-3590 USA

Most present research into facial expression recognition focuses on the visible spectrum, which is sen- sitive to illumination change. In this paper, we focus on in- tegrating thermal infrared data with visible spectrum images for spontaneous facial expression recognition. First, the ac- tive appearance model AAM parameters and three defined head motion features are extracted from visible spectrum im- ages, and several thermal statistical features are extracted from infrared （IR） images. Second, feature selection is per- formed using the F-test statistic. Third, Bayesian networks BNs and support vector machines SVMs are proposed for both decision-level and feature-level fusion. Experiments on the natural visible and infrared facial expression （NVIE） spontaneous database show the effectiveness of the proposed methods, and demonstrate thermal 1R images＇ supplementary role for visible facial expression recognition.

关键词： facial expression recognition feature-level fu-sion decision-level fusion support vector machine Bayesiannetwork thermal infrared images visible spectrum images

来源：评论

学校读者我要写书评

暂无评论

A novel method to handle the partial occlusion and shadow detection of highway vehicles

引用

Research Journal of Applied sciences, engineering and Technology 2015年第4期9卷 245-256页

作者： Hadi, Raad Ahmed Sulong, Ghazali George, Loay Edwar UTM-IRDA Media and Games Innovation Centre of Excellence (MaGIC-X) Faculty of Computing Universiti Teknologi Malaysia Skudai Johor 81310 Malaysia Department of Software and Networking Engineering College of Engineering Iraqi University Baghdad Iraq Department of Computer Science College of Science Baghdad University Baghdad Iraq

This study proposes a novel method for resolving the partial occlusion and shadow of moving vehicles seen in a sequence of highway traffic images captured from a single roadside fixed camera position. The proposed method detects the shadow regions of foreground/moving vehicles in any direction with no human intervention. Also, it handles the partially occluded vehicles in three different states on the highway traffic scene. The moving vehicles are detected using the background subtraction method followed by using the dilation and erosion operations. In this step, every segmented moving vehicle has an extracted Feature Vector (FV) which is used to initialize the Shadow Searching Window (SSW). Then, a chromatic based analysis technique uses the semi mean value of RGB colour space of moving vehicle region pixels as a threshold value to discriminate the shadow of moving vehicles despite the direction of movement. Finally, the partially occluded vehicles are handled using a new training procedure based on previous estimations to calculate the new moving vehicle sizes. These sizes are employed to separate and highlight the partially occluded vehicles by drawing the bounding boxes for each moving vehicle. © Maxwell Scientific Organization, 2015.

关键词： Background subtraction Occlusion handling Shadow Vehicle sizes

来源：评论

学校读者我要写书评

暂无评论

A new approach for water demand forecasting based on empirical mode decomposition 8

A new approach for water demand forecasting based on empiric...

引用

8th Malaysian software engineering Conference, MySEC 2014

作者： Shabri, Ani Samsudin, Ruhaidah Science Mathematics Department Faculty of Science Universiti Teknologi Malaysia Johor Malaysia Department of Software Engineering Faculty of Computing Universiti Teknologi Malaysia Johor Malaysia

ISBN: (纸本)9781479954391

Forecasting of water demand is becoming an essential tool for the design, management and modernization of water supply and distribution systems. In this paper, the hybrid ensemble learning paradigm integrating ensemble empirical mode decomposition (EMD) and several single forecasting methods such as Autoregressive Integrated Moving Average (ARIMA) and artificial neural networks (ANN) models are proposed to improve the accuracy of water demand forecasting. In the hybrid model, EMD is used to decompose original data into a finite and often small number of sub-series. The each sub-series is modeled and forecasted by a several single models. Finally the forecast of water demand is obtained by aggregating all forecasting results of sub-series. To assess the effectiveness and predictability of proposed models, monthly water demand record data from Batu Pahat city in Johor of Peninsular Malaysia, have been used as a case study. The result shows that EMD-ANN model yield better forecasts than the single ARIMA, ANN and EMD-ARIMA models on several criteria. © 2014 IEEE.

关键词： Empirical mode decomposition

来源：评论

学校读者我要写书评

暂无评论

Tournament selection based artificial bee colony algorithm with elitist strategy

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8916卷 387-396页

作者： Zhang, Meng-Dan Zhan, Zhi-Hui Li, Jing-Jing Zhang, Jun Department of Computer Science Sun Yat-sen University 510275 China Key Lab. Machine Intelligence and Advanced Computing Ministry of Education China Engineering Research Center of Supercomputing Engineering Software MOE China Key Lab. Software Technology Education Department of Guangdong Province China School of Computer Science South China Normal University China

Artificial bee colony (ABC) algorithm is a novel heuristic algorithm inspired from the intelligent behavior of honey bee swarm. ABC algorithm has a good performance on solving optimization problems of multivariable functions and has been applied in many fields. However, traditional ABC algorithm chooses solutions on the onlooker stage with roulette wheel selection (RWS) strategy which has several disadvantages. Firstly, RWS is suitable for maximization optimization problem. The fitness value has to be converted when solving minimization optimization problem. This makes RWS difficult to be generally used in real-world applications. Secondly, RWS has no any parameter that can control the selection pressure. Therefore, RWS is not easy to adapt to various optimization problems. This paper proposes a tournament selection based ABC (TSABC) algorithm to avoid these disadvantages of RWS based ABC. Moreover, this paper proposes an elitist strategy that can be applied to traditional ABC, TSABC, and any other ABC variants, so as to avoid the phenomenon that ABC algorithm may abandon the globally best solution in the scout stage. We compare the performance of traditional ABC and TSABC on a set of benchmark functions. The experiment results show that TSABC is more flexible and can be efficiently adapted to solve various optimization problems by controlling the selection pressure. © Springer International Publishing Switzerland 2014.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Testing model transformation programs using metamorphic testing 26

Testing model transformation programs using metamorphic test...

引用

26th International Conference on software engineering and Knowledge engineering, SEKE 2014

作者： Jiang, Mingyue Chen, Tsong Yueh Kuo, Fei-Ching Zhou, Zhi Quan Ding, Zuohua Department of Computer Science and Software Engineering Swinburne University of Technology HawthornVIC Australia School of Computer Science and Software Engineering University of Wollongong WollongongNSW Australia Laboratory of Scientific Computing and Software Engineering Zhejiang Sci-Tech University Hangzhou Zhejiang China

Model transformations are crucial for the success of Model Driven engineering. Testing is a prevailing technique of verifying the correctness of model transformation programs. A major challenge in model transformation testing is the oracle problem, which refers to the difficulty or high cost in determining the correctness of the output models. Metamorphic Testing alleviates the oracle problem by making use of the relationships among the inputs and outputs of multiple executions of the target function. This paper investigates the effectiveness and feasibility of metamorphic testing in testing model transformation programs. Empirical results show that metamorphic testing is an effective testing method for model transformation programs. Copyright © 2014 by Knowledge Systems Institute Graduate School.

关键词： Metamorphic testing Model transformation software quality software testing Test oracle

来源：评论

学校读者我要写书评

暂无评论

Panel: BPC fireside chat

Panel: BPC fireside chat

引用

Research in Equity and Sustained Participation in engineering, computing, and Technology (RESPECT)

作者： Tiffany Barnes Ann Gates Kim McLeod Cheryl Seals Sheila Castañeda Mark Guzdial Jamie Payton Jeff Forbes Richard Ladner Beth Quinn Department of Computer Science North Carolina State University Raleigh North Carolina Department of Computer Science University of Texas El Paso El Paso Texas Center for Minorities and People with Disabilities in IT (CMD-IT) Department of Computer Science and Software Engineering Auburn University Auburn Alabama Department of Computer Science Clarke University Dubuque Iowa College of Computing Georgia Institute of Technology Atlanta Georgia Department of Computer Science University of North Carolina Charlotte Charlotte North Carolina Department of Computer Science Duke University Durham North Carolina Department of Computer Science and Engineering University of Washington Seattle Washington National Center for Women and Information Technology

Summary form only given, as follows. The complete presentation was not made available for publication as part of the conference proceedings. The leaders of organizations dedicated to broadening participation briefly present their best practices and lessons learned, and engage with the RESPECT and STARS audiences in a lively discussion about the future of broadening participation work and research.

关键词： Best practices Organizations

来源：评论

学校读者我要写书评

暂无评论

Cross-Speed Gait Recognition Using Speed-Invariant Gait Templates and Globality-Locality Preserving Projections

引用

IEEE Transactions on Information Forensics and Security 2015年第10期10卷 2071-2083页

作者： Huang, S. Elgammal, A. Lu, J. Yang, D. School of Software Engineering Chongqing University Chongqing401331 China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing400044 China Department of Computer Science Rutgers University PiscatawayNJ08854 United States Advanced Digital Sciences Center Singapore138632 Singapore

We present a novel manifold-based approach for cross-speed gait recognition. In our approach, the walking action is considered as residing on a manifold, in the feature space, that is homomorphic to a unit circle. We employ thin plate spline (TPS) kernel-based radial basis function (RBF) interpolation to fit such manifold. TPS kernel-based RBF interpolation separates the learned coefficients into an affine component and a nonaffine component, which, respectively, encodes the dynamic and static characteristics of the gait manifold. We introduce the use of the nonaffine component as a cross-speed gait representation, and denote it speed invariant gait template (SIGT). We also propose an enhanced locality preserving projections (LPP) algorithm named globality LPP (GLPP) for reducing the dimension of SIGT. In GLPP, the graph Laplacians of intrasubject part and intersubjects part are separately constructed, and then to combine as a new graph Laplacian. Finally, a manifold learning-based classifier named normalized hypergraph classifier is employed for classification. Experimental results on two gait databases demonstrate the effectiveness of our proposed approach in comparison with the state-of-the-art gait recognition methods. © 2005-2012 IEEE.

关键词： Speed

来源：评论

学校读者我要写书评

暂无评论

On deploying relays for connected indoor sensor networks

引用

Journal of Communications and Networks 2014年第3期16卷 335-343页

作者： Zhu, Yanmin Xue, Cuiyao Cai, Haibin Yu, Jiadi Ni, Lei Li, Minglu Li, Bo Shanghai Key Lab. of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China Department of Computer Science and Engineering Shanghai Jiao Tong University China Software Engineering Institute East China Normal University China Shanghai Jiao Tong University Hong Kong University of Science and Technology Hong Kong

This paper considers the crucial problem of deploying wireless relays for achieving a connected wireless sensor network in indoor environments, an important aspect related to the management of the sensor network. Several algorithms have been proposed for ensuring full sensing coverage and network connectivity. These algorithms are not applicable to indoor environments because of the complexity of indoor environments, in which a radio signal can be dramatically degraded by obstacles such as walls. We first prove theoretically that the indoor relay placement problem is NP-hard. We then predict the radio coverage of a given relay deployment in indoor environments. We consider two practical scenarios;wire-connected relays and radio-connected relays. For the network with wire-connected relays, we propose an efficient greedy algorithm to compute the deployment locations of relays for achieving the required coverage percentage. This algorithm is proved to provide a Hn factor approximation to the theoretical optimum, where Hn = 1 +1/2+⋯+1/n= ln(n) +1, and n is the number of all grid points. In the network with radio-connected relays, relays have to be connected in an ad hoc mode. We then propose an algorithm based on the previous algorithm for ensuring the connectivity of relays. Experimental results demonstrate that the proposed algorithms achieve better performance than baseline algorithms. © 2014 KICS.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Social relationship-based mobile node location prediction algorithm in participatory sensing systems 5

Social relationship-based mobile node location prediction al...

引用

2013 5th International Conference on Advanced Computer Control, ICACC 2013

作者： Li, J. Xing, X. Yu, R. Wang, X. Zhou, Y. Computing Center Northeastern University China School of Software Northeastern University China Information Science and Engineering Department Northeastern University China

ISBN: (纸本)9781845649203

This paper put forward a social relationship-based Mobilenode Location Prediction algorithm (SMLP) based on the existing scheme of mobile trace predication. This algorithm use the position of other nodes to update the prediction results based on the 1-order Markov model, and improve the accuracy of the prediction model by sparse of state transition matrix. Finally, we verify the feasibility of prediction modal based on the WTD dataset. The results show that the trajectory prediction modal based on social relationship can get better accuracy with than 1-order Markov prediction modal. Therefore, the algorithm has high value in practical application. © 2014 WIT Press.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Control network programming development environments

引用

WSEAS Transactions on Computers 2014年 13卷 645-659页

作者： Kratchanov, Kostadin Golemanov, Tzanko Yüksel, Buket Golemanova, Emilia Department of Software Engineering Yaşar University Universite Cad. No. 35-37 Bornova/Izmir35100 Turkey Department of Computing University of Ruse Ul. Studentska No. 8 Ruse7013 Bulgaria Department of Computer Science and Engineering Koç University Sariyer Istanbul Turkey

In this paper we discuss the unusual distinctive features of Control Network Programming as a hybrid programming paradigm. We postulate the maxim "Primitives + Control Network = Control Network Program", and use this observation in the design of programming environments for developing Control Network Programming projects. The various possible approaches to building such environments are the main focus of the paper, together with a relatively detailed presentation of the currently most powerful locally run SpiderCNP environment with graphical editing and tracing, as well as two light-weight and ready-to-use cloud-based environments. An extended survey of cloud compilers and IDEs is also included.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：