Rate the Article: Robust Face-Name Graph Matching for Movie Character Identification, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 122 | Views: 341

Informative Article | Computer Science & Engineering | India | Volume 6 Issue 4, April 2017 | Rating: 6.8 / 10


Robust Face-Name Graph Matching for Movie Character Identification

Jonnadula Narasimha, S Nishanth Kumar, Chiluka Shiva Kumar, D Vamshi Krishna Rao


Abstract: 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.


Keywords: face identifies expression, graph matching, name face match, face detection


Edition: Volume 6 Issue 4, April 2017,


Pages: 1418 - 1421



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top