Fast iterative computation of Gaussian mixture parameters and optimal image segmentation

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 235
  • Download : 0
We present a fast and accurate parameter estimation method for image segmentation using the maximum-likelihood function. The segmentation is based on a parametric model in which the probability density function of the grey levels in the image is assumed to be a mixture of two Gaussian density functions. For more accurate parameter estimation and segmentation, the algorithm is formulated as a compact iterative scheme. In order to reduce the computation time and to make convergence fast, histogram information is combined into the algorithm. Estimates of the initial values are properly selected for fast convergence. In addition, we rnd the optimal threshold values for several different types of mixture density which have one, two or no intersections between two component densities. The performance of the algorithm is evaluated on a set of artificial and real images and compared with those of other algorithms as well.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
2001-08
Language
English
Article Type
Article
Citation

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, v.32, no.8, pp.1075 - 1087

ISSN
0020-7721
URI
http://hdl.handle.net/10203/83731
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0