Professional Documents
Culture Documents
MK Quweider
CIS Department, University of Texas, Brownsville
Brownsville, Texas 78520, USA
Mahmoud.quweider@utb.edu
levels
Each
Authorized licensed use limited to: Sethu Institute of Technology. Downloaded on July 06,2010 at 07:14:33 UTC from IEEE Xplore. Restrictions apply.
use a newly introduced optimal partitioning algorithm, the threshold that will divide the image into object and
described in [7] that intelligently searches the space of the background as dictated by the cost function, which is
histogram to find the threshold in an optimal way as we discussed next.
describe in the next section.
2.3 Cost function
2.2 Optimal partitioning on an interval
In this paper, we redefine the histogram-based entropy to
We can pose the problem of finding the optimal threshold incorporate spatial information about the image in the form
within the histogram as a problem of optimal partitioning of of a measure that reflects the activity of each gray level. To
the histogram, denoted here as R, into a set of two uniform do this, we use the following measure for entropy
regions R0 and R1 such that:
∪R
i = 0 ,1
i = R and R0 ∩ R1 = φ , using an appropriate cost
SpatialEnt ropy = SE ( H ) =
l = L −1
∑− p l log( p l / m l ) (2)
l =0
function. The optimal partitioning algorithm should find In the above equation, ml is a busyness or activity
this threshold based on the cost function. A partition here is weighting factor. The inclusion of this factor allows for
defined as a set of one or more contiguous gray levels inclusion of spatial information and makes thresholding less
(block) from the histogram that are similar with respect to dependent on the size of objects or background present in
the cost function. A cost function, C(Ri), is associated with the image. Several approaches can be used to define this
each region or partition with the overall cost over the factor; in this paper, we define ml as a measure that uses a
histogram R denoted as C(R) being the sum of the costs of local neighborhood around a central pixel as shown in
the partitions. This can be expressed as follows: figure 2.
M −1
C ( R) = ∑ C ( Ri ) (1)
i =0
Authorized licensed use limited to: Sethu Institute of Technology. Downloaded on July 06,2010 at 07:14:33 UTC from IEEE Xplore. Restrictions apply.
⎧ q0 0 ≤ I(i,j) < T0 [10-11]. Deciding the prior is usually done in ad hoc
Q 2 (i , j ) = ⎨ (3)
⎩ 1 0 I(i,j) < 4 L − 1
q T ≤ fashion depending on the application at hand.
Note that the output (two-level) image uses the expanded
gray levels to create the binary image. Some of these gray 4. Simulation results
levels will split as object and background even though they
have come from the same original gray level l. In this section, and due to space limitation, we present the
thresholding results only for the case of two quantization
levels (i.e. binarization). In testing the effectiveness of our
algorithm, we have obtained excellent results for images of
low and high details. The results of testing our algorithm on
the Lena image and the F-16 images are shown in figure 4.
We have also compared our algorithm with five popular
and current techniques [1-3] as shown in figure 6. Close
inspection of the resulting images show that our algorithm
does a good job in reproducing most of the details around
700
600
500
400
300
100
Authorized licensed use limited to: Sethu Institute of Technology. Downloaded on July 06,2010 at 07:14:33 UTC from IEEE Xplore. Restrictions apply.
[1]. P. K. Sahoo, S. Soltani, and A. K. C. Wong, “A survey of Bayesian blocks: a new method to analyze structure in
thresholding techniques,” Comput. Vis. Graph. Image photon counting data,” The Astrophysical Journal, vol. 504,
Process., vol. 41, pp. 233–260, 1988. pp. 405-418, 1998.
[2]. N. R. Pal and S. K. Pal, “A review on image segmentation [9]. R. Vidal, “Optimal partition of an interval,” Applied
techniques,” Pattern Recognit., vol. 26, pp. 1277–1294, Sep. Simulated Annealing, Springer-Verlag, New York, pp. 291-
1993. 314, 1993.
[3]. M. Sezgin and B. Sankur, “Survey over image thresholding [10]. J. Scargle and M.K. Quweider, “Edge Detection Using
techniques and quantitative performance evaluation,” J. Dynamic Optimal Partitioning,” IEEE ICASSP-2006, vol. 2,
Electron. Imaging, vol. 13, pp. 146–168, 2004. pp. 705-708, 2006.
[4]. C. Chang, Y. Du, J. Wang, S. Guo, and P. Thouin, “Survey [11]. M.K. Quweider, J.D. Scargle and B. Jackson, “Grey level
and comparative analysis of entropy and relative entropy reduction for segmentation, thresholding and binarisation of
thresholding techniques,” IEE Proc. Vision, Image and images based on optimal partitioning on an interval,” IET
Signal, vol. 153, pp. 837-850, 2006. Image Process, vol. 1, pp. 103–111, 2007.
[5]. C. E. Shannon, “A mathematical theory of communication,” [12]. R. Bellman, Dynamic Programming, Princeton, University
Bell Syst. Tech. J., vol. 27, pp. 379–423, 1948 Press, Princeton, 1957.
[6]. A. Brink, “Using spatial information as an aid to maximum
entropy image threshold selection,” Pattern Recognition
Letters, vol. 17(1), pp. 29-36, 1996.
[7]. B. Jackson, J. Scargle, et. al. “An algorithm for optimal
partitioning of data on an interval,” IEEE Signal Processing
Letters, vol. 12, pp. 105-108, 2005.
[8]. J. Scargle, “Studies in astronomical time series analysis. V.
a b c
Authorized licensed use limited to: Sethu Institute of Technology. Downloaded on July 06,2010 at 07:14:33 UTC from IEEE Xplore. Restrictions apply.
d e f
Figure 5. (a)-(c) Original Lena image corrupted by noise of 10, 20, and 40 standard deviation respectively. (d)- (f)
Thresholded Lena Image with a 3x3 Gaussian smoothing preprocessing step.
Original Image
Figure 6. (a) Original Lena Image. (b)-(f) Results of thresholding the image using the indicated method.
Authorized licensed use limited to: Sethu Institute of Technology. Downloaded on July 06,2010 at 07:14:33 UTC from IEEE Xplore. Restrictions apply.