Robust Face-Name Graph Matching for Movie Character Identification
Pages: 15 (3558 words) /
Published: Feb 19th, 2013
Title :- Robust Face-Name Graph Matching for
Movie Character Identification.
Domain :- 1. Face detection system. 2. Language:- C#
Group Members :- 1.Pallavi S. Malode. 2.Archana S. Aher. 3.Sonali M.Gotraj.
Introduction About METHODOLOGY:- 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 project 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.
Architecture Diagram :-
I/O And / Or
I/O And / Or
1. Design & Explain with Login
In this module is going to explain the Robust Face-Name Graph Matching for Movie Character Identification designing and how we did the face detection and recognition in this project. The images will explain about the facial fetching