• Title/Summary/Keyword: Annealing EM algorithm

Search Result 8, Processing Time 0.019 seconds

Segmentation of Color Image Using the Deterministic Anneanling EM Algorithm (결정적 어닐링 EM 알고리즘을 이용한 칼라 영상의 분할)

  • 박종현;박순영;조완현
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.569-572
    • /
    • 1999
  • In this paper we present a color image segmentation algorithm based on statistical models. A novel deterministic annealing Expectation Maximization(EM) formula is derived to estimate the parameters of the Gaussian Mixture Model(GMM) which represents the multi-colored objects statistically. The experimental results show that the proposed deterministic annealing EM is a global optimal solution for the ML parameter estimation and the image field is segmented efficiently by using the parameter estimates.

  • PDF

Convergence of MAP-EM Algorithms with Nonquadratic Smoothing Priors

  • Lee, Soo-Jin
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1997 no.11
    • /
    • pp.361-364
    • /
    • 1997
  • Bayesian MAP-EM approaches have been quite useful or tomographic reconstruction in that they can stabilize the instability of well-known ML-EM approaches, and can incorporate a priori information on the underlying emission object. However, MAP reconstruction algorithms with expressive priors often suffer from the optimization problem when their objective unctions are nonquadratic. In our previous work [1], we showed that the use of deterministic annealing method greatly reduces computational burden or optimization and provides a good solution or nonquadratic objective unctions. Here, we further investigate the convergence of the deterministic annealing algorithm; our experimental results show that, while the solutions obtained by a simple quenching algorithm depend on the initial conditions, the estimates converged via deterministic annealing algorithm are consistent under various initial conditions.

  • PDF

Segmentation of Color Image using the Deterministic Annealing EM Algorithm (결정적 어닐링 EM 알고리즘을 이요한 칼라 영상의 분할)

  • Cho, Wan-Hyun;Park, Jong-Hyun;Park, Soon-Young
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.324-333
    • /
    • 2001
  • In this paper we present a novel color image segmentation algorithm based on a Gaussian Mixture Model(GMM). It is introduced a Deterministic Annealing Expectation Maximization(DAEM) algorithm which is developed using the principle of maximum entropy to overcome the local maxima problem associated with the standard EM algorithm. In our approach, the GMM is used to represent the multi-colored objects statistically and its parameters are estimated by DAEM algorithm. We also develop the automatic determination method of the number of components in Gaussian mixtures models. The segmentation of image is based on the maximum posterior probability distribution which is calculated by using the GMM. The experimental results show that the proposed DAEM can estimate the parameters more accurately than the standard EM and the determination method of the number of mixture models is very efficient. When tested on two natural images, the proposed algorithm performs much better than the traditional algorithm in segmenting the image fields.

  • PDF

Prediction of Time Series Using Hierarchical Mixtures of Experts Through an Annealing (어닐링에 의한 Hierarchical Mixtures of Experts를 이용한 시계열 예측)

  • 유정수;이원돈
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10c
    • /
    • pp.360-362
    • /
    • 1998
  • In the original mixtures of experts framework, the parameters of the network are determined by gradient descent, which is naturally slow. In [2], the Expectation-Maximization(EM) algorithm is used instead, to obtain the network parameters, resulting in substantially reduced training times. This paper presents the new EM algorithm for prediction. We show that an Efficient training algorithm may be derived for the HME network. To verify the utility of the algorithm we look at specific examples in time series prediction. The application of the new EM algorithm to time series prediction has been quiet successful.

  • PDF

Medoid Determination in Deterministic Annealing-based Pairwise Clustering

  • Lee, Kyung-Mi;Lee, Keon-Myung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.11 no.3
    • /
    • pp.178-183
    • /
    • 2011
  • The deterministic annealing-based clustering algorithm is an EM-based algorithm which behaves like simulated annealing method, yet less sensitive to the initialization of parameters. Pairwise clustering is a kind of clustering technique to perform clustering with inter-entity distance information but not enforcing to have detailed attribute information. The pairwise deterministic annealing-based clustering algorithm repeatedly alternates the steps of estimation of mean-fields and the update of membership degrees of data objects to clusters until termination condition holds. Lacking of attribute value information, pairwise clustering algorithms do not explicitly determine the centroids or medoids of clusters in the course of clustering process or at the end of the process. This paper proposes a method to identify the medoids as the centers of formed clusters for the pairwise deterministic annealing-based clustering algorithm. Experimental results show that the proposed method locate meaningful medoids.

Color Image Segmentation Based on Morphological Operation and a Gaussian Mixture Model (모폴로지 연산과 가우시안 혼합 모형에 기반한 컬러 영상 분할)

  • Lee Myung-Eun;Park Soon-Young;Cho Wan-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.3 s.309
    • /
    • pp.84-91
    • /
    • 2006
  • In this paper, we present a new segmentation algorithm for color images based on mathematical morphology and a Gaussian mixture model(GMM). We use the morphological operations to determine the number of components in a mixture model and to detect their modes of each mixture component. Next, we have adopted the GMM to represent the probability distribution of color feature vectors and used the deterministic annealing expectation maximization (DAEM) algorithm to estimate the parameters of the GMM that represents the multi-colored objects statistically. Finally, we segment the color image by using posterior probability of each pixel computed from the GMM. The experimental results show that the morphological operation is efficient to determine a number of components and initial modes of each component in the mixture model. And also it shows that the proposed DAEM provides a global optimal solution for the parameter estimation in the mixture model and the natural color images are segmented efficiently by using the GMM with parameters estimated by morphological operations and the DAEM algorithm.

Content-based Image Retrieval using an Improved Chain Code and Hidden Markov Model (개선된 chain code와 HMM을 이용한 내용기반 영상검색)

  • 조완현;이승희;박순영;박종현
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.375-378
    • /
    • 2000
  • In this paper, we propose a novo] content-based image retrieval system using both Hidden Markov Model(HMM) and an improved chain code. The Gaussian Mixture Model(GMM) is applied to statistically model a color information of the image, and Deterministic Annealing EM(DAEM) algorithm is employed to estimate the parameters of GMM. This result is used to segment the given image. We use an improved chain code, which is invariant to rotation, translation and scale, to extract the feature vectors of the shape for each image in the database. These are stored together in the database with each HMM whose parameters (A, B, $\pi$) are estimated by Baum-Welch algorithm. With respect to feature vector obtained in the same way from the query image, a occurring probability of each image is computed by using the forward algorithm of HMM. We use these probabilities for the image retrieval and present the highest similarity images based on these probabilities.

  • PDF

A Design and Implementation of Learning System to Support Indoor and Outdoor Field Trips Using RFID Mobile Device (RFID 모바일 기기용 실내.외 체험학습 시스템 설계 및 구현)

  • Yu, Jeong-Su;Baek, Hyeon-Gi
    • Journal of The Korean Association of Information Education
    • /
    • v.14 no.4
    • /
    • pp.527-536
    • /
    • 2010
  • Ubiquitous computing and mobile technologies provide much scope for designing innovative learning experiences that can take place in a variety of indoor and outdoor settings, such as botanical gardens, parks, museums and classrooms. In this paper, we present our own innovative work for bridging indoor and outdoor field-trip learning activities with the support of RFID with reader device on ubiquitous environments. The function of our system is based on strategically located RFID tags placed on objects around settings which are identified using the mobile device installed to an RFID reader. The mobile device reads the RFID tag and sends the learner's request to the field-trip learning system. And learners can be learning activities according to theirs learning levels. We also focus on the use of intelligent agents to customize learning contents for individual learners. The result of our experiment indicates that learner enjoyed learning where mobile devices are used in the system, supporting the learning activities in the context of which they are taking place.

  • PDF