By Topic

Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition

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
$33 $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

2 Author(s)
H. -Y. F. Feng ; Pattern Analysis and Recognition Corporation ; T. Pavlidis

A technique for decomposition of polygons into simpler components is described and illustrated with applications in the analysis of handwritten Chinese characters and chromosomes. Polygonal approximations of such objects are obtained by methods described in the literature and then parts of their concave angles are examined recursively for separating convex or other simple shape components. Further decomposition of the latter is possible. The final result can be expressed as a labeled graph and processed further through the introduction of either fuzzy predicates or syntactic pattern recognition techniques.

Published in:

IEEE Transactions on Computers  (Volume:C-24 ,  Issue: 6 )