Abstract
For the problem that the HAAR descriptors in the speed up robust feature (SURF) algorithm cannot make full use of the information around the feature points, the K-Mean clustering technology is used in this paper to improve the SURF, thus proposing a new face recognition algorithm. Firstly, the problem that the main direction is too dependent on the direction of the local area is avoided by expanding the scope of the main direction; then the information around the subblock that is masked by the 3 × 3 window template is made full use of to construct a descriptor with stronger recognition ability; finally, the problems of excessive time consumed and incorrect matching of interest points are solved by introducing the K-Mean clustering idea. The results of the experiment on FERET and Yale face database show that the proposed algorithm has higher recognition rate and efficiency than other face recognition techniques.
Similar content being viewed by others
References
Galar M, Fernández A, Barrenechea E et al (2015) DRCW-OVO: distance-based relative competence weighting combination for one-vs-one strategy in multi-class problems[J]. Pattern Recogn 48(1):28–42
He H, Chen J, Jin H et al (2007) Trading strategies based on K-means clustering and regression models[M]. In: Computational intelligence in economics and finance. Springer, Berlin, pp 123–134
Liu Y, Liu Y, Zhong S et al (2012) Tensor distance based multilinear globality preserving embedding: a unified tensor based dimensionality reduction framework for image and video classification[J]. Expert Syst Appl 39(12):10500–10511
Mingliang HE, Chen Z, Huang X et al (2017) Intrusion detection algorithm based on improved K-means clustering[J]. Computer & Digital Engineering
Mohammed MA, Ghani MKA, Arunkumar N, Mostafa SA, Abdullah MK, Burhanuddin MA (2018) Trainable model for segmenting and identifying nasopharyngeal carcinoma. Comput Electr Eng 71:372–387
Momeni H, Sadeghi MT, Abutalebi HR (2009) Fast face recognition using a combination of image pyramid and hierarchical clustering algorithms[C]. In: International conference on wireless communications & signal processing. IEEE, pp 1–5
Nacer F, Gang P, Zhaohui W et al (2011) Multiclass classification based on meta probability codes[J]. Int J Pattern Recognit Artif Intell 25(08):1219–1241
Qian C, Fang Y (2018) Adaptive tracking control of flapping wing micro-air vehicles with averaging theory. CAAI Transactions on Intelligence Technology 3(1):18–27
Rajendra Achary U, Hagiwara Y, Deshpande SN, Suren S, Koh JEW, Oh SL, Arunkumar N, Ciaccio EJ, Lim CM (2019) Characterization of focal EEG signals: a review. Futur Gener Comput Syst 91:290–299
Wang Y (2015) KD-tree based clustering algorithm for fast face recognition on large-scale data[C]. In: International conference on digital image processing. Seventh international conference on digital image processing (ICDIP 2015)
Wu J, Xu X (2018) Decentralised grid scheduling approach based on multi-agent reinforcement learning and gossip mechanism. CAAI Transactions on Intelligence Technology 3(1):8–17
Xie R, Chunlei MA, Zhang L et al (2018) Power transformer abnormal state recognition model based on improved K-means clustering[J]. Power Systems & Big Data
Younus ZS, Mohamad D, Saba T et al (2015) Content-based image retrieval using PSO and k-means clustering algorithm[J]. Arab J Geosci 8(8):6211–6224
Zhang J (2012) Image edge detection based on the improved K-means clustering algorithm[J]. Bull Sci Technol
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
He, Q., He, B., Zhang, Y. et al. Multimedia based fast face recognition algorithm of speed up robust features. Multimed Tools Appl 78, 24035–24045 (2019). https://doi.org/10.1007/s11042-019-7209-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-019-7209-0