By Topic

Singularities and regularities on line pictures via symmetrical trapezoids

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)
J. Rocha ; Univ. of the Balearic Islands, Palma de Mallorca, Spain ; R. Bernardino

An algorithm that decomposes a line image into singular and regular regions is presented. We define a contour trapezoid as the building block of regular regions, and postulate a maximal trapezoid set as the core of regular regions. Then, we describe an algorithm that calculates a maximal trapezoid set of a polygon and show how to use it to find a skeleton of a polygonal approximation of a contour. Experiments are explained to show the behavior of the new concept on real images as compared to previous algorithms

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:20 ,  Issue: 4 )