• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Zhang Xingming and Li Heheng. A Face Verification Algorithm Based on Negative Independent Sample Set and SVM[J]. Journal of Computer Research and Development, 2006, 43(12): 2138-2143.
Citation: Zhang Xingming and Li Heheng. A Face Verification Algorithm Based on Negative Independent Sample Set and SVM[J]. Journal of Computer Research and Development, 2006, 43(12): 2138-2143.

A Face Verification Algorithm Based on Negative Independent Sample Set and SVM

More Information
  • Published Date: December 14, 2006
  • In many face verification applications, there are no face database for SVM training, such as PC face security logging-on system. A new face verification algorithm based on negative independent sample (NIS) set is presented, by analyzing existing SVM-based face verification algorithm and the demand for practical application. The approach generates enough positive samples by means of wobbling eyes of the user's registered image, employs FLD to extract feature, and deletes uniform samples in NIS with the rank-based FLD face recognition method. This scheme can resolves the classification conflict problem between the negative and the positive sample sets. After the negative and positive samples are sent to SVM for training, the SVM can do face verification for face image. The experiments on the SCUT face database indicate that the proposed method can ensure lower FAR if the negative samples are large enough, and the number of support vectors does not increase alone with the number of negative samples. A PC security logging-on system has been developed based on this face verification algorithm.
  • Related Articles

    [1]Zheng Wenping, Wu Zhikang, Yang Gui. A Novel Algorithm for Identifying Critical Nodes in Networks Based on Local Centrality[J]. Journal of Computer Research and Development, 2019, 56(9): 1872-1880. DOI: 10.7544/issn1000-1239.2019.20180831
    [2]Liu Haolin, Chi Jinlong, Deng Qingyong, Peng Xin, Pei Tingrui. Multi-Objective Evolutionary Sparse Recovery Approach Based on Adaptive Local Search[J]. Journal of Computer Research and Development, 2019, 56(7): 1420-1431. DOI: 10.7544/issn1000-1239.2019.20180557
    [3]Xu Zhengguo, Zheng Hui, He Liang, Yao Jiaqi. Self-Adaptive Clustering Based on Local Density by Descending Search[J]. Journal of Computer Research and Development, 2016, 53(8): 1719-1728. DOI: 10.7544/issn1000-1239.2016.20160136
    [4]Li Guilin, Yang Yuqi, Gao Xing, and Liao Minghong. Personalized Representation and Rank Algorithm for Enterprise Search Engines[J]. Journal of Computer Research and Development, 2014, 51(1): 206-214.
    [5]Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
    [6]Li Wenjun, Wang Jianxin, and Chen Jianer. An Improved Parameterized Algorithm for Hyperplane-Cover Problem[J]. Journal of Computer Research and Development, 2012, 49(4): 804-811.
    [7]Wang Chuyang, Li Xiaoping, Wang Qian, Yuan Yingchun. A New Local Search Algorithm for No-Wait Fowshops with Setup Time[J]. Journal of Computer Research and Development, 2010, 47(4): 653-662.
    [8]Zhang Peng. Approximation Algorithms for Generalized Multicut in Trees[J]. Journal of Computer Research and Development, 2008, 45(7): 1195-1202.
    [9]Zeng Liping and Huang Wenqi. A New Local Search Algorithm for the Job Shop Scheduling Problem[J]. Journal of Computer Research and Development, 2005, 42(4): 582-587.
    [10]Yang Jinji, Su Kaile. Improvement of Local Research in SAT Problem[J]. Journal of Computer Research and Development, 2005, 42(1): 60-65.

Catalog

    Article views (715) PDF downloads (663) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return