You are on page 1of 6

Robust Face-Name Graph Matching for Movie Character Identification

Abstract
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 paper 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.

(ii) Sampling the new colors to this cluster remaining consistency with Markov Chain Monte Carlo (MCMC) mechanism. identify representative sentences in this manuscript. We devised a method called “affinity propagation. where each vertex (candidate) is a possible match for a pair of source and target primitives (local structure or small curves). Such “exemplars” can be found by randomly choosing an initial subset of data points and then iteratively refining it. Each two vertices can be linked by either a competitive edge or a collaborative edge. and the layered matching is then formulated as a multiple coloring problem. The algorithm is applied to many applications on many public datasets and outperform the state of the art approaches. but this works well only if that initial choice is close to a good solution.” which takes as input measures of similarity between pairs of data points. many inference algorithms often get stuck in local minimums and converge slowly. and identify cities that are efficiently accessed by airline travel. Clustering by Passing Messages Between Data Points Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. We used affinity propagation to cluster images of faces. motivated by detecting objects in cluttered background and learning parts from articulated motion. Realvalued messages are exchanged between data points until a high-quality set of exemplars and corresponding clusters gradually emerges. the stochastic sampling contains two steps: (i) Sampling the competitive and collaborative edges to form a composite cluster. Due to the large distortion between shapes and ambiguity caused by symmetric or cluttered structures. Affinity propagation found clusters . With this representation. These edges indicate the connected vertices should/shouldn’t be assigned the same color.Literature Survey: Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes). detect genes in microarray data. in which a few mutual-conflicting connected components are in different colors. We propose a composite cluster sampling algorithm with a “candidacy graph” representation.

lines. We consider it a general framework because it does not depend on any particular form of spatial mapping. there could be many features in either set that have no counterparts in the other. In each of these experiments. they clearly demonstrate the applicability of our approach to real world tasks involving feature-based non-rigid registration. curves or surface parameterizations are used. In addition. This outlier rejection problem further complicates an already difficult correspondence problem. After a careful review of the problem and an in-depth examination of two types of methods previously designed for rigid robust point matching (RPM). feature-based non-rigid matching requires us to automatically solve for correspondences between two sets of features.with much lower error than other methods. and it did so in less than one-hundredth the amount of time. While these results are somewhat preliminary. . Regardless of whether points. we propose a new general framework for non-rigid point matching. Finally. The performance of the TPS-RPM algorithm is demonstrated and validated in a series of carefully designed synthetic experiments. an empirical comparison with the popular iterated closest point (ICP) algorithm is also provided.ping and the soft assign for the correspondence. we apply the algorithm to the problem of non-rigid registration of cortical anatomical structures which is required in brain mapping. We have also developed an algorithm |the TPS-RPM algorithm| with the thin-plate spine (TPS) as the parameterization of the non-rigid spatial map. We formulate feature-based non-rigid registration as a non-rigid point matching problem. A new point matching algorithm for non-rigid registration Feature-based methods for non-rigid registration frequently encounter the correspondence problem.

Proposed System 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. . But this one we can do it in a minute process.Existing System In this project is used to detect the face of movie characters and recognize the characters and the existing system are taking the too much time to detect the face. Disadvantages: • In the previous process the time taken for detecting face is too long in windows processed. Advantages: • In the proposed process the time taken for detecting face in minimum (min) time only in windows processed. In this one we can do it in a minute process.

44 Mb. .util. : 40 GB.ui. Recognition In this module we are going to recognize the face of the movie characters which is we previously stored on the face database.cv. .4 GHz. In this module we are using the emgu cv library we must install the emgu cv library. Here we are using the With the help of these eigenObjectRecognizer we are going to recognize the face. After that admin going to login with the details which needed for the login page. emgu. Detection 3. Detection In this module we are going to detect the face of the movie characters. After installing the emgu cv lib in our project we need to add reference with the name emgu. When you will complete the references you will get the emgu controls in the toolbox. : 1. emgu.cv. The images will explain about the facial fetching details. We just found that the give the real name of it. Design & Explain with Login 2. HARDWARE & SOFTWARE REQUIREMENTS: HARDWARE REQUIREMENTS: • System • Hard Disk • Floppy Drive : Pentium IV 2. This is going to be done here.cv. Recognition 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.Modules 1.

: Logitech. : C#.NET Coding Language . : 512 MB.• Monitor • Mouse • Ram : 15 VGA Color. SOFTWARE REQUIREMENTS: • Operating system : Windows XP Professional.