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

International Conference on Information Sciences,Machinery,Materials and Energy（ICISMME 2015）

作者： Xiaoling LI Jimin YUAN School of Computer Science and Technology Chengdu University University Key Laboratory of Pattern Recognition and Intelligent information Processing The Department Computer Engineering Chengdu Aeronautic Vocational and Technical College

In view of the draw backs of apple grade identification in China,which still relies on photoelectric sorting and manual separation,this paper presents a processing method on the basis of the technology of computer vision and digital *** image processing technology,the researcher calculated the length of the long-short-axis,marked the location of it and calculated the 4 parameters,color,mean square,shape,size,as the key characteristics of the BP input of network to build a network and identify the level of apple through analysis of the external characteristics of *** optimum structure parameters of the BP neural network which had 9 hidden layer neurons were determined by RP training *** showed that average accuracy for fruit classification can reach 92.5% by using this model,and the executing time of microcomputer for grading of one apple is 9.3 *** method has the characteristics of high accuracy and good real-time performance.

关键词： characteristic parameter BP neural network apple detect level

来源：评论

学校读者我要写书评

暂无评论

Matrix Factorization Based Models Considering Item Categories and User Neighbors

Matrix Factorization Based Models Considering Item Categorie...

引用

International Symposium on Computational Intelligence and Design

作者： Lin Zhao Bo Xiao Pattern Recognition and Intelligent System Laboratory Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781467395885

Matrix factorization is a popular collaborative filtering method for recommendation techniques with predictive accuracy and good scalability. In this paper, we propose two models on the basis of basic matrix factorization, namely CW-MF, NICW-MF. CW-MF considers user's preference on item categories and NICW-MF takes into account the impact of user's neighbors to minimize the preference between user and his neighbors. We conduct empirical experiments on MovieLens dataset, and results show that our two models perform well.

关键词： matrix factorization item categories user neighbors collaborative Jiltering recommendation

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to ‘Modeling the packing coloring problem of graphs’ [Appl. Math. Model. 39 (2015) 3588–3595]

引用

Applied Mathematical Modelling 2016年第2期40卷 1683-1683页

作者： Zehui Shao Aleksander Vesel School of Information Science and Technology Chengdu University Chengdu 610106 China Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province China Faculty of Natural Sciences and Mathematics University of Maribor Maribor Slovenia

来源：评论

学校读者我要写书评

暂无评论

Shape driven kernel adaptation in Convolutional Neural Network for robust facial trait recognition

Shape driven kernel adaptation in Convolutional Neural Netwo...

引用

Conference on Computer Vision and pattern recognition (CVPR)

作者： Shaoxin Li Junliang Xing Zhiheng Niu Shiguang Shan Shuicheng Yan Department of Electrical and Computer Engineering National University of Singapore Singapore Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China National Laboratory of Pattern Recognition Institute of Automation CAS Beijing China

ISBN: (纸本)9781467369657

One key challenge of facial trait recognition is the large non-rigid appearance variations due to some irrelevant real world factors, such as viewpoint and expression changes. In this paper, we explore how the shape information, i.e. facial landmark positions, can be explicitly deployed into the popular Convolutional Neural Network (CNN) architecture to disentangle such irrelevant non-rigid appearance variations. First, instead of using fixed kernels, we propose a kernel adaptation method to dynamically determine the convolutional kernels according to the spatial distribution of facial landmarks, which helps learning more robust features. Second, motivated by the intuition that different local facial regions may demand different adaptation functions, we further propose a tree-structured convolutional architecture to hierarchically fuse multiple local adaptive CNN subnetworks. Comprehensive experiments on WebFace, Morph II and MultiPIE databases well validate the effectiveness of the proposed kernel adaptation method and tree-structured convolutional architecture for facial trait recognition tasks, including identity, age and gender recognition. For all the tasks, the proposed architecture consistently achieves the state-of-the-art performances.

关键词： Kernel Shape Face Face recognition Robustness Neural networks Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Object classification via PCANet and color constancy model 4

Object classification via PCANet and color constancy model

引用

4th International Conference on Advanced Design and Manufacturing Engineering, ADME 2014

作者： Hu, De Kun Zhang, L. Zhao, Wei Dong Yan, Tao Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province Chengdu University Chengdu China

ISBN: (纸本)9783038352570

In order to classify the objects in nature images, a model with color constancy and principle component analysis network (PCANet) is proposed. The new color constancy model imitates the functional properties of the HVS from the retina to the double-opponent cells in V1. PCANet can be designed and learned extremely, which comprises only the very basic data processing components: cascaded principal component analysis (PCA), binary hashing, and block-wise histograms. At last, a SVM is trained to classify the object in the image. The results of experiments demonstrate the potential of the model for object classification in wild color images. © (2014) Trans Tech Publications, Switzerland.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

recognition of facial expression via kernel PCA network 3

Recognition of facial expression via kernel PCA network

引用

3rd International Conference on Information Technology and Management Innovation, ICITMI 2014

作者： Hu, De Kun Ye, An Sheng Li, Li Zhang, Li Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province Chengdu University Chengdu China

ISBN: (纸本)9783038352396

In this work, a kernel principle component analysis network (KPCANet) is proposed for classification of the facial expression in unconstrained images, which comprises only the very basic data processing components: cascaded kernel principal component analysis (KPCA), binary hashing, and block-wise histograms. In the proposed model, KPCA is employed to learn multistage filter banks. It is followed by simple binary hashing and block histograms for indexing and pooling. For comparison and better understanding, We have tested these basic networks extensively on many benchmark visual datasets(such as the JAFFE [13] database, the CMU AMP face expression database, a part of the Extended Cohn-Kanade (CK+) database), The results demonstrate the potential of the KPCANet serving as a simple but highly competitive baseline for facial expression recognition. © 2014 Trans Tech Publications, Switzerland.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

A Novel Ordinal Regression Method with Minimum Class Variance Support Vector Machine

A Novel Ordinal Regression Method with Minimum Class Varianc...

引用

2015 International Conference on Materials Engineering and Information Technology Applications(MEITA 2015)

作者： Jinrong Hu Xiaoming Wang Zengxi Huang School of Computer and Soft Engineering Xihua University Key Laboratory of Pattern Recognition and Intelligent Information Processing Chengdu University

ISBN: (纸本)9781510812055

In the paper, we propose a novel ordinal regression method called minimum class variance support vector ordinal regression(MCVSVOR). MCVSVOR is derived from minimum class variance support vector machine(MCVSVM) which is a variant of SVM, and so inherits the latter's characteristics such as taking the distribution of the categories into consideration and good generalization performance. Finally, the experimental results validate the effectiveness of MCVSVOR and indicate its superior generalization performance over SVOR.

关键词： Machine learning Ordinal regression Support vector machine Support vector ordinal regression

来源：评论

学校读者我要写书评

暂无评论

A Robust CPD Approach Based on Shape Context 33

A Robust CPD Approach Based on Shape Context

引用

第三十三届中国控制会议

作者： YANG Yawen ZHANG Peng Peng QIAO Yu YANG Jie WANG Sheng Zheng The Key Laboratory of Ministry of Education for System Control and Information Processing Institute of Image Processing and Pattern RecognitionShanghai Jiao Tong University Merchant Marine College Shanghai Maritime University

ISBN: (纸本)9781479947249

Point matching is an important component of image *** years,Coherent Point Drift(CPD) method becomes a very popular point matching *** treats point matching as a probability estimation problem and speeds up the process of matching a *** this method,one set of points are thought to be sampled from a Gaussian Mixture Model(GMM),which is centered by the other set of ***,CPD is sensitive to outliers and noises,especially when the noise ratio increased or the number of outliers gets much *** deal with this problem,we introduce shape context into the step of searching for matching points and then improve the form of prior probabilities of GMM in this *** main idea of our method is that if the most points in a data set are likely to be matched to a particular centroid,this Gaussian component should be have a more influence to ***,we set prior probability of GMM with the similarity between GMM components and the data *** the computation of similarity is based on shape *** experiments on 2D and 3D images show that when noise ratio is low,our method performs as well as CPD does,but as the ratio increased,our method is more robust and satisfactory than CPD.

关键词： CPD,Shape context,Image registration,Point matching

来源：评论

学校读者我要写书评

暂无评论

pattern matching with flexible wildcard gaps

Pattern matching with flexible wildcard gaps

引用

5th International Symposium on IT in Medicine and Education, ITME 2013

作者： Junyan, Zhang Chenhui, Yang Information Science and Technology College Chengdu University Chengdu China Key Laboratory of Pattern Recognition and Intelligent Information Processing of Sichuan Chengdu University Chengdu China

ISBN: (纸本)9789400776173

pattern matching is a fundamental application in biomedicine and biological sequence analysis. A wildcard can match any one character in a sequence. Multiple wildcards form a gap. A flexible wildcard gap can match any characters with specific length which is specified by users. Therefore, the effective algorithm performing this kind of matching is in great need. In this paper, we design PMFG algorithm and achieve it by dividing a pattern into multiple sub-patterns with different length based on gap segmentation. After computing the starting positions and ending positions of each subpattern, the effective intervals and effective starting positions can be determined one by one. The number of the elements in the last effective position set equals to the number of the matching. A comparison experiments are done based on three DNA sequences. The results show that PMFG algorithm has better performance in the same fields. © Springer Science+Business Media Dordrecht 2014.

关键词： pattern matching

来源：评论

学校读者我要写书评

暂无评论

A bottom-up kernel of pattern learning for relation extraction

A bottom-up kernel of pattern learning for relation extracti...

引用

International Symposium on Chinese Spoken Language Processing

作者： Chunyun Zhang Weiran Xu Sheng Gao Jun Guo Pattern Recognition and Intelligent System Laboratory Beijing University of Posts and Telecommunications

Measuring the similarity of patterns is the key in pattern-based approaches in relation extraction. Most existing methods generally rely on inflexible pattern similarity measurements which often lead to low recall. In this work, a novel kernel-based model is proposed to address this problem. Depending on the pattern similarities produced by our bottom-up kernel, the most similar semantic shortest dependency patterns are selected to update seed patterns in each iteration of bootstrapping. To obtain insights of the reliability and applicability of our proposed method, we applied it to the task of English Slot Filling (ESF) in Knowledge Base Population (KBP) track at Text Analysis Conference (TAC). The experimental results validate our proposed method that importantly improves the recall which resulting in the improvement of F1 value. The effectiveness of the bottom-up kernel is also verified by further experimental results.

关键词： Kernel Semantics Computational linguistics pattern matching Natural language processing Feature extraction Computer architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：