ROBUST FACE-NAME GRAPH MATCHING FOR DIFFERENT MOVIE FRAMES

R. Aravind, T.P.Senthil kumar

Abstract


Auto face identification of characters in films has drawn most research interests and led to many interesting applications. Since huge variation in the appearance of each character is found, it is a challenging problem. Existing methods evaluate promising results in clean environment, the performances are limited in complex movie scenes due to the noises generated during the face tracking and face clustering process. This study presents two scheme of global face-name matching based frame work for robust character identification. This contribution of this study include: 1) A noise insensitive character relationship representation is incorporated.2) The study introduces an edit operation based graph matching algorithm.3) Complex character changes are handled by simultaneously graph partition and graph matching. algorithm4) Beyond existing character identification approaches, we further perform an in-depth sensitivity analysis by introducing two types of simulated noises. The proposed schemes demonstrate state-of-the-art performance on movie character identification in various movies.

Keywords: Character identification, graph matching, graphpartition, graph edit, sensitivity analysis.


Full Text:

PDF


DOI: https://doi.org/10.26483/ijarcs.v6i6.2562

Refbacks

  • There are currently no refbacks.




Copyright (c) 2016 International Journal of Advanced Research in Computer Science