By Topic

Fast masking algorithms for image analysis

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 $33
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)
R. Stasinski ; Tech. Univ. of Poznan, Poland ; A. K. Nandi

The possibility and the construction of a number of fast algorithms for the two-dimensional masking of small mask sizes is clearly demonstrated. These are based on nesting and represent extension of the ideas of Stasinski (1990). Moreover, the authors explain how to make the optimal choice of the algorithm depending on the computational machine available.

Published in:

Electronics Letters  (Volume:28 ,  Issue: 18 )