By Topic

Grey level reduction for segmentation, threshholding and binarisation of images based on optimal partitioning on an interval

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

3 Author(s)
M. K. Quweider ; Dept. of Comput. Sci. & Comput. Inf. Sci., Univ. of Texas, Brownsville, TX ; J. D. Scargle ; B. Jackson

Optimal reduction of the number of grey levels present in an image is a fundamental problem in segmentation, classification, lossy compression, quantisation, inspection and computer vision. We present a new algorithm based on dynamic programming and optimal partitioning of the image data space, or its histogram representation. The algorithm allows the reduction of the number of grey levels for an image in a fine to coarse fashion, starting with the original grey levels present in the image and all the way down to two grey levels that simply create a binarised version of the original image. The algorithm can also be used to find a reduced number of grey levels in a natural way without forcing a specific number ahead of time. Application of the algorithm is demonstrated in image segmentation, multi-level thresholding and binarisation, and is shown to give very good results compared to many of the existing methods.

Published in:

IET Image Processing  (Volume:1 ,  Issue: 2 )