Cart (Loading....) | Create Account
Close category search window
 

A Novel Technique for Resolving Mutually Occluding Text Patterns

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Vaidyanathan, S.G. ; Dept. of ECE, Sri Venkateswara Coll. of Eng., Sriperumbudur, India ; Kumaravel, N. ; Kar, B.

This paper proposes a novel method to identify data patterns that mutually occlude each other. In pattern recognition problems, occlusion is a challenge which severely limits the accuracy of recognition. The technique makes use of an evolutionary algorithm at a micro level by extracting a population from the occluded text pattern and by doing the operations such as selection, crossover, mutation and reinsertion on the members in the population. The hidden text is found out after certain number of generations.The technique works well even if the occlusion is mutual, that is, when both text patterns occlude each other and even if up to 90% of the pattern is hidden.

Published in:

2009 International Conference on Signal Processing Systems

Date of Conference:

15-17 May 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.