By Topic

Image compression algorithm for fast parallel thinning of binary images

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 $31
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)
Hayat, L. ; Dept. of Electron. & Electr. Eng., King's Coll. London, London Univ., UK ; Sandler, M.B.

An efficient image compression technique as a preprocessing step for skeletonisation is presented. For this purpose a 5*5 pattern window is used, in which an internal 3*3 nonoverlapping window does the compression whilst the outer ring of pixels helps to preserve the image connectivity during compression. Comparative evaluation based on experimental results, execution timings and quality of the skeleton obtained, show that this algorithm is faster and more efficient than many other existing thinning algorithms. This algorithm is also more efficient for noisy images than other thinning algorithms because it simultaneously performs median filtering operations.

Published in:

Electronics Letters  (Volume:26 ,  Issue: 14 )