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

Comparative analysis of identification methods for wheat leaf diseases

International Agricultural Engineering Journal 2016年第3期25卷 197-203页

作者： Zhang, D.Y. Xie, X.H. Liang, D. Huang, L.S. Zhang, X.Q. Teng, L. Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230039 China Anhui Engineering Laboratory of Agro-Ecological Big Data Anhui University School of Electronic and Information Engineering Hefei Anhui230601 China

How to fast, accurately and robustly recognize wheat diseases, particularly for those diseases with mild-to-moderate severity, is a challenge for prevention and control of crop disease timely. In this study, image processing technique was applied to segment the infected regions of disease leaves. Twenty disease features were extracted, and eighteen larger weight features were selected by Relief-F algorithm to generate the models of Support Vector Machine (SVM), Relevance Vector Machine (RVM) and Back Propagation Neural Network (BPNN). Subsequently, these models were used to identify two kinds of wheat diseases, namely, wheat stripe rust and powdery mildew. Total 136 samples, including 68 training samples and 68 test samples with different infection severities were used to study the recognition capabilities of the three models. Results showed that high predictive accuracies in identification of two wheat diseases with varying severity for all three models. Overall accuracy of RVM was 89.71%, which was superior to 83.82% of SVM and inferior to 92.64% of BPNN. Meanwhile, the recognition accuracies of SVM, RVM and BPNN models for mild-to-moderate disease were 83.33%, 88.33% and 91.67%, respectively. The prediction time of RVM was less than those of SVM and BPNN, with differences as large as 7.96 and 31.68 times, respectively. Therefore, RVM appeared to be the most suitable for real-time identifying wheat leaf diseases among the three models, which can provide important technical support for wheat diseases management.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Connected dominating set construction algorithm for wireless networks based on connected subset

引用

Journal of Communications 2016年第1期11卷 50-57页

作者： Tang, Qiang Luo, Yuan-Sheng Xie, Ming-Zhong Li, Ping Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha410114 China School of Computer and Communication Engineering Changsha University of Science and Technology Changsha410114 China

In this paper, a Connected Dominating Set (CDS) construction algorithm CSCDS (Connected Subset based CDS) is proposed, which is based on the connected subset concept. The CSCDS contains two main stages, which are dominating set construction stage and connected dominating set construction stage respectively. In the first stage, the dominators are proposed based on the one hop white neighbor information, and the redundant dominators are reduce to obtain the minimum number of dominators. In the second stage, the CDS is constructed based on the connected subset, which is used as the basis to select the connectors. The message complexity is O(Δ2) (O(Δ2) is a linear relationship function with Δ2, and Δ is the maximum one hop neighbor degree), Simulation results show that CSCDS has smaller size compared with the classical algorithms. © 2016 Journal of Communications.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Neighborhood collaborative classifiers

Neighborhood collaborative classifiers

引用

2016 International Conference on Machine Learning and Cybernetics, ICMLC 2016

作者： Xu, Suping Yang, Xibei Tsang, Eric C. C. Mantey, Eric A. School of Computer Science and Engineering Jiangsu University of Science and Technology Zhenjiang212003 China School of Economics and Management Nanjing University of Science and Technology Nanjing210094 China Faculty of Information Technology Macau University of Science and Technology C-Macau519020 China Intelligent Information Processing Key Laboratory of Shanxi Province Shanxi University Taiyuan030006 China Key Laboratory of Oceanographic Big Data Mining and Application of Zhejiang Province Zhejiang Ocean University Zhoushan316022 China

ISBN: (纸本)9781509003891

In neighborhood rough set model, the majority rule based neighborhood classifier (NC) is easy to be misjudged with the increasing of the size of information granules. To remedy this deficiency, we propose a neighborhood collaborative classifier (NCC) based on the idea of collaborative representation based classification (CRC). NCC first performs feature selection with neighborhood rough set, and then instead of solving the classification problem by the majority rule, NCC solves a similar problem with collaborative representation among the neighbors of each unseen sample. Experiments on UCI data sets demonstrate that: 1) Our NCC achieves satisfactory performance in larger neighborhood information granules when compared with NC;2) NCC reduces the size of dictionary when compared with CRC. © 2016 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

An attribute reduction framework for inconsistent decision tables from view of the boundary region

An attribute reduction framework for inconsistent decision t...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Jin Qian Yu-Hui Chang Ping Lv Jiangsu Key Laboratory of Big Data Analysis Technology/B-DAT Nanjing University of Information Science & Technology Nanjing China Key Laboratory of Cloud Computing and Intelligent Information Processing of Changzhou City Jiangsu University of Technology Changzhou China

ISBN: (纸本)9781509003914

Attribute reduction is one of the key issues for data preprocess in data mining. Many heuristic attribute reduction algorithms based on discernibility matrix have been proposed for inconsistent decision tables. However, these methods are usually computationally time-consuming. To address this issue, the derived consistent decision tables are defined for different definitions of relative reducts. The computations for different reducts of the original inconsistent decision tables are converted into the computations for their corresponding reducts of the derived consistent datasets. The relative discernibility object pair and the more optimal relative discernibility degree from view of the boundary region are designed to accelerate the attribute reduction process. An efficient attribute reduction framework using relative discernibility degree is proposed for large datasets. Experimental results show that our attribute reduction algorithms are effective and feasible for large inconsistent datasets.

关键词： Cybernetics Acceleration Time complexity Rough sets Heuristic algorithms data mining Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A characteristic-preserving steganographic method based on revision identifiers

International Journal of Multimedia and Ubiquitous Engineeri...

引用

International Journal of Multimedia and Ubiquitous Engineering 2016年第9期11卷 29-38页

作者： Xiang, Lingyun Sun, Caixia Liao, Niandong Wang, Weizheng Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology ChangshaHunan Province410114 China School of Computer and Communication Engineering Changsha University of Science and Technology ChangshaHunan Province410114 China

Since the majority of the available steganographic schemes in OOXML format documents suffered the disadvantages of unsatisfactory anti-detection capability and security level, a characteristic-preserving steganographic method with high security is proposed in this paper. The proposed method embeds secret information by replacing the last three bytes of the values of the revision identifiers in the main document body of the OOXML format document, while preserving the normal characteristics of the document. Meanwhile, position marks are added to track the locations of the embedded information. In order to keep the internal data consistency of the document, the newly created values are added into other related parts. Experimental results show that the method not only possesses good imperceptibility and anti-detection capability, but also has high security and large embedding capacity. © 2016 SERSC.

关键词： Anti-detection Characteristic-preserving OOXML Revision identifier Steganography

来源：评论

学校读者我要写书评

暂无评论

Price learning based load distribution strategies for demand response management in smart grid

引用

International Journal of Smart Home 2016年第11期10卷 79-94页

作者： Tang, Qiang Xie, Ming-Zhong Yang, Kun Luo, Yuan-Sheng Li, Ping Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha Hunan Province410114 China School of Computer and Communication Engineering Changsha University of Science and Technology Changsha China School of Computer Science and Electronic Engineering University of Essex Colchester United Kingdom

In this paper, a Price learning based Load Distribution Strategy (PLDS) is proposed at first. In PLDS model, Smart Power Service, Utility Company and History Load Curves are included, and by considering both the average electricity consumption cost and the average electricity consumption habit, we proposed a convex optimization model to solve the model. In order to accelerate the convergence of PLDS, a price learning mechanism is proposed, which learns a price curve according to the history price data, and predicts price as a learned price for the next iteration. The optimization cycle of PLDS is one day or 24 hours, and in order to further improve the peak shaving performance, an extended version of PLDS named PLRS (Price learning based Load Redistribution Strategy) is proposed, whose optimization cycle length is 1 hour. The optimization models of PLDS and PLRS are the same, and the differences between them are the optimization cycle and the constraint conditions. In the simulation, we compared the convergence performance, peaking shaving performance and total cost among PLDS, PLRS and other strategy ODC in reference [11], and we found that the convergence performances of PLDS and PLRS are both better than that of ODC. The peak shaving performance of PLRS is better than that of ODC in the long term, and the total cost of PLRS is very close to that of ODC. © 2016 SERSC.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Flickr group recommendation via heterogeneous information networks 15

Flickr group recommendation via heterogeneous information ne...

引用

7th International Conference on Internet Multimedia Computing and Service, ICIMCS 2015

作者： Wang, Yueyang Xia, Yuanfang Tang, Siliang Wu, Fei Zhuang, Yueting College of Computer Science and Technology Zhejiang University Key Laboratory of Big Data Intelligent Computing of Zhejiang Province Innovation Joint Research Center for ICPS China

ISBN: (纸本)9781450335287

As an important characteristic of social media (i.e. Flickr or Facebook), user communities or groups are beginning to attract increasing attention. Most of the previous studies on group recommendation only consider a homogeneous relationship, such as the rating of users to groups in social network. In real world, each group has its textual descriptions (e.g. the "Sky & Cloud" group in Flickr), and the describing words about a given group may mention particular entities as well as their belonging categories (e.g. "Nature"). In fact, the group recommendation can be conducted in a heterogeneous information network, where informative cues are in general multi-typed. Motivated by the assumption that different types of relationships in heterogeneous information network can be potentially used to boost the performance of the group recommendation. We propose to combine heterogeneous relationship information for users with implicit user feedback. In general, the group recommendation in this paper is formulated as a non-negative matrix factorization (NMF) method regularized with user-user similarity via heterogeneous information networks. Experiments show that our proposed approach outperforms other counterpart recommendation techniques. © 2015 ACM.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Research on bearing micro deformation based on the frequency domain technique of white light speckle image

引用

Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument 2016年 37卷 46-52页

作者： Feng, Bo Xu, Chao Shao, Deyang Luo, Shixian Anhui Engineering Laboratory of Agro-Ecological Big Data Anhui University Hefei230601 China Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Hefei230601 China

In this paper, a new method of non contact and on-line measurement is presented for the change of the axis of the rotation axis. Under the condition of a constant light source, the image of the original position and the offset image in the original position are collected by the micro camera, These two pictures are calculated by the improved White light digital image point by point analysis method in this paper, and get the black and white stripes. The number and the angle of the fringe in the white light digital frequency domain interference image can be known as the offset and direction of the rotating shaft in the rotating process. Because this method only use a camera and a light source, and this method is very simple, and it can always detect, and it does not affect the normal work, so there is a wide range of industrial application prospects. This method can provide alarm before the plastic deformation occurs in the shaft, Reduce the risk of shaft damage. © 2016, Science Press. All right reserved.

关键词： Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

No reference video quality assessment based on 3D convolutional neural network

引用

Ruan Jian Xue Bao/Journal of Software 2016年 27卷 103-112页

作者： Wang, Chun-Feng Su, Li Zhang, Wei-Gang Huang, Qing-Ming Key Laboratory on Big Data Mining and Knowledge Management University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology The Chinese Academy of Sciences Beijing100190 China Weihai264209 China

No reference video quality assessment (NR-VQA) measures distorted videos quantitatively without the reference of original high quality videos. Conventional NR-VQA methods are generally designed for specific types of distortions, or not consistent with human's perception. This paper innovatively introduces 3D deep convolutional neural network (3D-CNN) into VQA and proposes a 3D-CNN based NR-VQA method, which is universal for non-specific types of distortions. First, the proposed method utilizes 3D patches to learn spatio-temporal features that represent video content effectively. Second, the original 3D-CNN model is modified which is used to classify videos to make it adapt to VQA task. Experiments demonstrate that the proposed method is highly consistent with human's perception across numerous distortions and metrics. Compared with other state-of-the-art no-reference VQA methods, the proposed method runs much faster while keeping the similar performance. As a no-reference VQA method, it is even comparable with many of the state-of-the-art full-reference VQA methods, which provides the proposed method with better application prospects. © Copyright 2016, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Neighborhood collaborative classifiers

Neighborhood collaborative classifiers

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Suping Xu Xibei Yang Eric C. C. Tsang Eric A. Mantey Intelligent Information Processing Key Laboratory of Shanxi Province Shanxi University Taiyuan China School of Computer Science and Engineering Jiangsu University of Science and Technology Zhenjiang China Key Laboratory of Oceanographic Big Data Mining & Application of Zhejiang Province Zhejiang Ocean University Zhoushan China School of Economics and Management Nanjing University of Science and Technology Nanjing China Faculty of Information Technology Macau University of Science and Technology Macau China

ISBN: (纸本)9781509003914

In neighborhood rough set model, the majority rule based neighborhood classifier (NC) is easy to be misjudged with the increasing of the size of information granules. To remedy this deficiency, we propose a neighborhood collaborative classifier (NCC) based on the idea of collaborative representation based classification (CRC). NCC first performs feature selection with neighborhood rough set, and then instead of solving the classification problem by the majority rule, NCC solves a similar problem with collaborative representation among the neighbors of each unseen sample. Experiments on UCI data sets demonstrate that: 1) Our NCC achieves satisfactory performance in larger neighborhood information granules when compared with NC; 2) NCC reduces the size of dictionary when compared with CRC.

关键词： Collaboration Rough sets Training Cybernetics Numerical models Error analysis Measurement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：