{"title":"基于快速静态粒子群优化的人脸特征选择","authors":"Fan Lei, Yao Lu, Wei Huang, Lujun Yu, Lin-Na Jia","doi":"10.1109/CIS.2012.96","DOIUrl":null,"url":null,"abstract":"Feature selection only using wrapper method in high-dimensional data space is always time-consuming. A new feature selection method, named fast static particle swarm optimization, is proposed for tackling this problem. It treats the whole initial feature set as a static particle swarm in which no new particle would be generated in high dimensional space, and the proposed method takes filter and wrapper strategy to pick out the most discriminative feature particle subset. Compared with the existing methods, experimental results show that the proposed method is faster than the existing methods in frontal face detection, and the detection error rate is lower than them on average.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Fast Static Particle Swarm Optimization Based Feature Selection for Face Detection\",\"authors\":\"Fan Lei, Yao Lu, Wei Huang, Lujun Yu, Lin-Na Jia\",\"doi\":\"10.1109/CIS.2012.96\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Feature selection only using wrapper method in high-dimensional data space is always time-consuming. A new feature selection method, named fast static particle swarm optimization, is proposed for tackling this problem. It treats the whole initial feature set as a static particle swarm in which no new particle would be generated in high dimensional space, and the proposed method takes filter and wrapper strategy to pick out the most discriminative feature particle subset. Compared with the existing methods, experimental results show that the proposed method is faster than the existing methods in frontal face detection, and the detection error rate is lower than them on average.\",\"PeriodicalId\":294394,\"journal\":{\"name\":\"2012 Eighth International Conference on Computational Intelligence and Security\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Eighth International Conference on Computational Intelligence and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2012.96\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Eighth International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2012.96","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast Static Particle Swarm Optimization Based Feature Selection for Face Detection
Feature selection only using wrapper method in high-dimensional data space is always time-consuming. A new feature selection method, named fast static particle swarm optimization, is proposed for tackling this problem. It treats the whole initial feature set as a static particle swarm in which no new particle would be generated in high dimensional space, and the proposed method takes filter and wrapper strategy to pick out the most discriminative feature particle subset. Compared with the existing methods, experimental results show that the proposed method is faster than the existing methods in frontal face detection, and the detection error rate is lower than them on average.