Multiple Face Tracking using Kalman and Hungarian Algorithm to Reduce Face Recognition Computational Cost

  • Fauzi W
  • Nugroho S
  • Yuniarno E
  • et al.
N/ACitations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

Currently, research in face recognition systemsmainly utilized deep learning to achieve high accuracy. Usingdeep learning as the base platform, per frame image processingto detect and recognize faces is computationally expensive,especially for video surveillance systems using large numbers ofmounted cameras simultaneously streaming video data to thesystem. The idea behind this research is that the system does notneed to recognize every occurrence of faces in every frame. Weused MobileNet SSD to detect the face, Kalman filter to predictface location in the next frame when detection fails, andHungarian algorithm to maintain the identity of each face.Based on the result, using our algorithm 87.832 face that mustbe recognized is reduced to only 204 faces, and run at the realtime scenario. This method is proven to be used in surveillancesystems by reducing computational cost.

Cite

CITATION STYLE

APA

Fauzi, W. A., Nugroho, S. M. S., Yuniarno, E. M., Anggraeni, W., & Purnomo, M. H. (2021). Multiple Face Tracking using Kalman and Hungarian Algorithm to Reduce Face Recognition Computational Cost. JAREE (Journal on Advanced Research in Electrical Engineering), 5(1). https://doi.org/10.12962/jaree.v5i1.191

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free