Automatic face identification of characters inmovies become a challenging problem due to thehuge variation of each charact...
The objective is to identify the faces of the characters in thevideo and label them with the corresponding names in thecas...
During face tracking and face clustering process,    the noises has been generated.    The performance are limited at the ...
By using clustering mechanism, the face of the    movie character is detected more accurately.ADVANTAGES    In the propos...
   Two schemes considered in robust face name graph    matching algorithm     First, External script resources are utili...
   In ECGM, the difference between the two graph is    measured by edit distance which is a sequence of    graph edit ope...
FRONT END : Visual Studio 2010BACK END: C#.Net
DesignDetectionRecognition
Robust face name graph matching for movie character identification
Robust face name graph matching for movie character identification
Robust face name graph matching for movie character identification
Upcoming SlideShare
Loading in...5
×

Robust face name graph matching for movie character identification

3,427

Published on

Published in: Technology
1 Comment
2 Likes
Statistics
Notes
  • which college?
       Reply 
    Are you sure you want to  Yes  No
    Your message goes here
No Downloads
Views
Total Views
3,427
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
158
Comments
1
Likes
2
Embeds 0
No embeds

No notes for slide

Robust face name graph matching for movie character identification

  1. 1. Automatic face identification of characters inmovies become a challenging problem due to thehuge variation of each characters. In this paper, wepresent two schemes of global face name matchingbased frame work for robust character identification.A noise insensitive character relationshiprepresentation is incorporated. We introduce an editoperation based graph matching algorithm.
  2. 2. The objective is to identify the faces of the characters in thevideo and label them with the corresponding names in thecast.The textual clues like cast list, scripts, subtitles and closedcaptions are usually exploited.This occurrences provides lots of movie structure andcontent.Automatic character identification is essential for semanticmovie index and retrieval, scene segmentation and otherapplications.
  3. 3. During face tracking and face clustering process, the noises has been generated. The performance are limited at the time of noise generation.DISADVANTAGES The time taken for detecting the face is too long. The detected face cannot be more accurate.
  4. 4. By using clustering mechanism, the face of the movie character is detected more accurately.ADVANTAGES In the proposed system, the face detection is performed in a minute process. The faces are identified easily in low resolution, complex background also.
  5. 5.  Two schemes considered in robust face name graph matching algorithm First, External script resources are utilized in both schemes belong to the global matching based category. Second, The original graph is employed for face name graph representation.
  6. 6.  In ECGM, the difference between the two graph is measured by edit distance which is a sequence of graph edit operation. The optimal match is achieved with the least edit distance.
  7. 7. FRONT END : Visual Studio 2010BACK END: C#.Net
  8. 8. DesignDetectionRecognition
  1. A particular slide catching your eye?

    Clipping is a handy way to collect important slides you want to go back to later.

×