Algorithm for multiple faces tracking

C. Lerdsudwichai, M. Abdel-Mottaleb

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations


Robust real-time face tracking is a challenging task. This paper presents an algorithm for tracking faces of multiple people even in case of total occlusion. The method uses the color distribution of each face with the mean shift tracking method. Mean shift tracking is fast and robust to partial occlusion, and it is rotation invariant and computationally efficient. Since the mean shift algorithm does not deal with the problem of total occlusion, we overcome this problem by using an occlusion grid to detect occlusion. We then use the color distribution of the occluded person's clothes to distinguish that person after the occlusion ends. We also use the speed and the trajectory of the occluded person to predict the locations that should be searched after occlusion ends. The proposed face tracking method integrates multiple features to handle tracking of multiple people even in case of occlusion. The experiments show the robustness of the algorithm.

Original languageEnglish (US)
Title of host publicationProceedings - 2003 International Conference on Multimedia and Expo, ICME
PublisherIEEE Computer Society
Number of pages4
ISBN (Electronic)0780379659
StatePublished - 2003
Event2003 International Conference on Multimedia and Expo, ICME 2003 - Baltimore, United States
Duration: Jul 6 2003Jul 9 2003

Publication series

NameProceedings - IEEE International Conference on Multimedia and Expo
ISSN (Print)1945-7871
ISSN (Electronic)1945-788X


Other2003 International Conference on Multimedia and Expo, ICME 2003
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications


Dive into the research topics of 'Algorithm for multiple faces tracking'. Together they form a unique fingerprint.

Cite this