By Topic

Optimally small operator supports for fully parallel thinning algorithms

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

1 Author(s)
R. W. Hall ; Dept. of Electr. Eng., Pittsburgh Univ., PA, USA

Requirements for the support size and shape are investigated for the class of all adequate fully parallel thinning operators. Eleven pixel supports are shown to be the smallest possible supports, and the possible positions of the support pixels are shown to be well constrained. Constraints on support positions are demonstrated for operators with supports that are larger than optimal, and a sufficient test for connectivity preservation is reviewed. These results allow algorithm designers looking for small support operators to focus on a relatively small set of acceptable supports

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:15 ,  Issue: 8 )