Recognisation and Identification of Automatic Face-Name Detection by using Spectral Graph Matching Algorithm |
Author(s): |
| Kanike Vijay Kumar , RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN; P Kishor Kumar, RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN |
Keywords: |
| Character Identification, Graph Edit, Graph Matching, Graph Partition, Sensitivity Analysis |
Abstract |
|
In Real Time, 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. We present two schemes of global face-name matching based framework for robust character identification. The contributions of this work include the following. 1) A noise insensitive character relationship representation is incorporated. 2) We introduce an edit operation based graph matching algorithm. 3) Complex character changes are handled by simultaneously graph partition and graph matching. 4) 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. |
Other Details |
|
Paper ID: IJSRDV6I120204 Published in: Volume : 6, Issue : 12 Publication Date: 01/03/2019 Page(s): 289-294 |
Article Preview |
|
|
|
|
