Algorithm for multiple faces tracking

C. Lerdsudwichai, Mohamed Abdel-Mottaleb

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

7 Citations (Scopus)

Abstract

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
Title of host publicationProceedings - IEEE International Conference on Multimedia and Expo
PublisherIEEE Computer Society
PagesII777-II780
Volume2
ISBN (Print)0780379659
DOIs
StatePublished - Jan 1 2003
Event2003 International Conference on Multimedia and Expo, ICME 2003 - Baltimore, United States
Duration: Jul 6 2003Jul 9 2003

Other

Other2003 International Conference on Multimedia and Expo, ICME 2003
CountryUnited States
CityBaltimore
Period7/6/037/9/03

Fingerprint

Color
Trajectories
Experiments

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Lerdsudwichai, C., & Abdel-Mottaleb, M. (2003). Algorithm for multiple faces tracking. In Proceedings - IEEE International Conference on Multimedia and Expo (Vol. 2, pp. II777-II780). [1221732] IEEE Computer Society. https://doi.org/10.1109/ICME.2003.1221732

Algorithm for multiple faces tracking. / Lerdsudwichai, C.; Abdel-Mottaleb, Mohamed.

Proceedings - IEEE International Conference on Multimedia and Expo. Vol. 2 IEEE Computer Society, 2003. p. II777-II780 1221732.

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

Lerdsudwichai, C & Abdel-Mottaleb, M 2003, Algorithm for multiple faces tracking. in Proceedings - IEEE International Conference on Multimedia and Expo. vol. 2, 1221732, IEEE Computer Society, pp. II777-II780, 2003 International Conference on Multimedia and Expo, ICME 2003, Baltimore, United States, 7/6/03. https://doi.org/10.1109/ICME.2003.1221732
Lerdsudwichai C, Abdel-Mottaleb M. Algorithm for multiple faces tracking. In Proceedings - IEEE International Conference on Multimedia and Expo. Vol. 2. IEEE Computer Society. 2003. p. II777-II780. 1221732 https://doi.org/10.1109/ICME.2003.1221732
Lerdsudwichai, C. ; Abdel-Mottaleb, Mohamed. / Algorithm for multiple faces tracking. Proceedings - IEEE International Conference on Multimedia and Expo. Vol. 2 IEEE Computer Society, 2003. pp. II777-II780
@inproceedings{ecc7f6c8733b4dee86f943678510dc9b,
title = "Algorithm for multiple faces tracking",
abstract = "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.",
author = "C. Lerdsudwichai and Mohamed Abdel-Mottaleb",
year = "2003",
month = "1",
day = "1",
doi = "10.1109/ICME.2003.1221732",
language = "English",
isbn = "0780379659",
volume = "2",
pages = "II777--II780",
booktitle = "Proceedings - IEEE International Conference on Multimedia and Expo",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Algorithm for multiple faces tracking

AU - Lerdsudwichai, C.

AU - Abdel-Mottaleb, Mohamed

PY - 2003/1/1

Y1 - 2003/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34249277995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34249277995&partnerID=8YFLogxK

U2 - 10.1109/ICME.2003.1221732

DO - 10.1109/ICME.2003.1221732

M3 - Conference contribution

SN - 0780379659

VL - 2

SP - II777-II780

BT - Proceedings - IEEE International Conference on Multimedia and Expo

PB - IEEE Computer Society

ER -