Face And Name Matching In A Movie By Grapical Methods In Dynamic Way
Journal: International Journal of Scientific & Technology Research (Vol.2, No. 7)Publication Date: 2013-07-25
Authors : Ishwarya; Madhu B; Veena Potdar;
Page : 155-159
Keywords : Key Words Graph matching; Graph Partition; Face Tracking; Face clustering; error correction graph matching; indexing; skimming.;
Abstract
Abstract With the flourishing development of the movie industry a huge amount of movie data is being generated every day. It becomes very important for a media creator or distributor to provide better media content description indexing and organization so that users can easily browsing skimming and retrieving the content of interest. Our goal is to automatically determine the cast of a feature-length film and match it with the character name. This is challenging because the cast size is not known with appearance changes of faces caused by extrinsic imaging factors like illumination pose and expression often greater than due to differing identities. Although in the existing system the performances are limited due to the noises generated during the face tracking and face clustering process. The contributions of this work include A noise insensitive character relationship. An error correcting graph matching algorithm is introduced. Complex character changes are handled simultaneously by graph partition and graph matching.
Other Latest Articles
- Investigation Into The Growth Phase Dependent Sensitivity Of Mycobacterium Aurum To Chlorine And Quantification Of Reactive Oxygen Species
- Performance Of Community Schools In Nepal A Macro Level Analysis
- Preparation Of The Statement Of Cash Flows In Accordance With IAS 7
- Developing An Instrumentation System For Measurement Of Rotational Speed And Slide Mesh Of Spur Gears Of A Novel Gearbox For Human Powered Flywheel Motor Hpfm
- Simulating The Influence Of The Casimir Effect On The Current Density In Amorphous Materials
Last modified: 2013-08-10 23:37:35