This paper is published in Volume-4, Issue-2, 2018
Area
Image processing
Author
S. P. Deepika, M. Ananthi, P. Rajkumar
Org/Univ
Info Institute of Engineering, Anna University, Chennai, Tamil Nadu, India
Keywords
Graph Matching, Robust Name, Data Base, Complexity.
Citations
IEEE
S. P. Deepika, M. Ananthi, P. Rajkumar. Video Based Face Detection Process, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARIIT.com.
APA
S. P. Deepika, M. Ananthi, P. Rajkumar (2018). Video Based Face Detection Process. International Journal of Advance Research, Ideas and Innovations in Technology, 4(2) www.IJARIIT.com.
MLA
S. P. Deepika, M. Ananthi, P. Rajkumar. "Video Based Face Detection Process." International Journal of Advance Research, Ideas and Innovations in Technology 4.2 (2018). www.IJARIIT.com.
S. P. Deepika, M. Ananthi, P. Rajkumar. Video Based Face Detection Process, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARIIT.com.
APA
S. P. Deepika, M. Ananthi, P. Rajkumar (2018). Video Based Face Detection Process. International Journal of Advance Research, Ideas and Innovations in Technology, 4(2) www.IJARIIT.com.
MLA
S. P. Deepika, M. Ananthi, P. Rajkumar. "Video Based Face Detection Process." International Journal of Advance Research, Ideas and Innovations in Technology 4.2 (2018). www.IJARIIT.com.
Abstract
The project entitled “Movie Character Discovery” is used to identify movie characters in videos. Automatic face identification of characters in movies has drawn significant research interests and led to many interesting applications. It is a challenging problem due to the huge variation in the appearance of each character. Although existing methods demonstrate 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. In this paper we present two schemes of global face-name matching based framework for robust character identification. The contributions of this work include: Complex character changes are handled by simultaneously graph partition and graph matching. 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 genres of movies.