检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘翠响[1] 李敏[1] 张凤林[1] LIU Cuixiang(School of Electronics Information Engineering, LI Min, ZHANG Fenglin Hebei University of Technology ,Tianjin 300401, China)
机构地区:[1]河北工业大学电子信息工程学院,天津市300401
出 处:《河北大学学报(自然科学版)》2017年第4期411-418,共8页Journal of Hebei University(Natural Science Edition)
基 金:国家自然科学基金资助项目(61203245)
摘 要:针对传统人脸识别方法实时性差的缺点,提出了一种加速鲁棒性特征(SURF,speed up robust features)和词包模型(BOW,bag-of-word)相结合的人脸识别方法.图像经过预处理后,使用SURF算法自动提取图像的关键点和相应的特征描述符,再进一步用BOW方法将其编成视觉单词作为人脸的局部特征.最后,采用K最邻近结点算法进行分类识别.使用了2个数据集验证了提出的方法——标准CMU-PIE(卡内基梅隆大学——姿势、光照、表情人脸数据库)人脸库和采集的数据库,分别达到了97.5%和99.3%的识别率,而且特征提取的时间少于0.108 s,识别的时间少于0.017 s.结果表明,本文提出的算法不仅精确而且快速,具有更好的稳定性和有效性.To overcome the limitations of traditional face recognition methods for real-time, a face rec- ognition method which based on speed up robust features and bag-of-word model was proposed. Image after preprocessing, we used SURF to extract key points of images and corresponding feature descriptors au-tomatically. Further, bag-of word model was used to code the descriptors into visual words as local features of the face. Finally, K-Nearest Neighbor algorithm was adopted to recognize the human faces. The proposed method is validated with both CMU-PIE dataset and dataset collected in the laboratory. It can a- chieve 97.50//00 and 99.3%0 recognition rates on these two datasets, respectively. In average, it took less than 0.108 s for feature extraction and less than 0.017 s for matching. The results indicate that the pro- posed method not only precise moreover fast, and had better stability and effectiveness.
关 键 词:人脸识别 词包模型 SURF 局部特征 K-NN
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249