Article Fingerprint
ReserarchID
CSTGV4345L
The crux of the character identification problem is to exploit the relations between videos and the associated texts in order to label the faces of characters with names. It has similarities to identifying faces in news videos. However, in news videos, candidate names for the faces are available from the simultaneously appearing captions or local transcripts. While in TV and movies, the names of characters are seldom directly shown in the subtitle or closed caption, and script/screenplay containing character names has no time stamps to align to the video. According to the utilized textual cues, we roughly divide the existing movie character identification methods into three categories In this Robust Face-Name Graph Matching for Movie Character Identification is used to detect the face of movie characters and the Proposed system is taking the minimum time to detect the face. In this one we can do it in a minute process.
Roshan Kavuri. 1970. \u201cRobust Automatic Face Recognition\u201d. Global Journal of Computer Science and Technology - F: Graphics & Vision GJCST-F Volume 13 (GJCST Volume 13 Issue F4).
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 103
Country: India
Subject: Global Journal of Computer Science and Technology - F: Graphics & Vision
Authors: Roshan Kavuri, Sani Kommu Vasavi , Ramisety Sravani (PhD/Dr. count: 0)
View Count (all-time): 313
Total Views (Real + Logic): 25068
Total Downloads (simulated): 10944
Publish Date: 1970 01, Thu
Monthly Totals (Real + Logic):
This study aims to comprehensively analyse the complex interplay between
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.