Inexact graph matching for facial feature segmentation and recognition in video sequences: Results on face tracking

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a method for the segmentation and recognition of facial features and face tracking in digital video sequences based on inexact graph matching. It extends a previous approach proposed for static images to video sequences by incorporating the temporal aspect that is inherent to such sequences. Facial features are represented by attributed relational graphs, in which vertices correspond to different feature regions and edges to relations between them. A reference model is used and the search for an optimal homomorphism between its corresponding graph and that of the current frame leads to the recognition. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Graciano, A. B. V., Cesar, R. M., & Bloch, I. (2003). Inexact graph matching for facial feature segmentation and recognition in video sequences: Results on face tracking. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2905, 71–78. https://doi.org/10.1007/978-3-540-24586-5_8

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