Robust Face Label Graph Matching for Movie Character Identification
نویسندگان
چکیده
منابع مشابه
A Review on: Automatic Movie Character Annotation by Robust Face-Name Graph Matching
Now a day's character Identification from films is a very challenging task due to the huge variation in the appearance of each & every character. It will lead significant research interests and may have many interesting applications in today's life. In this paper, we investigate the problem of identifying characters & annotating them with respective name using graph matching algorithm...
متن کاملCharacter Identification Using Graph Matching Algorithm
In this paper we are going to present a new efficient technique to identify the faces of the characters automatically in movies that drawn a significant research that led to many interesting applications. It is a huge problem due to the variations of each character in it. The existing applications will provide a good result for clean environment, but for complex environments the performance is ...
متن کاملRobust Face Recognition through Local Graph Matching
A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometry of a 3-tuple of face feature points, extracted using Local Feature Analysis (LFA) technique. Our method automatically learns a model set and builds a graph space for each individual. A two-stage method for optimal match...
متن کاملFace Identification System Sift-based Graph Matching Topology
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully used for general object detection and recognition, only recently they were applied to face recognition. This paper further investigates the performance of identification techniques based on Graph matching topology drawn...
متن کاملRobust Multimodal Graph Matching: Sparse Coding Meets Graph Matching
Graph matching is a challenging problem with very important applications in a wide range of fields, from image and video analysis to biological and biomedical problems. We propose a robust graph matching algorithm inspired in sparsityrelated techniques. We cast the problem, resembling group or collaborative sparsity formulations, as a non-smooth convex optimization problem that can be efficient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/ijca2015906153