This paper presents a method for unsupervised segmentation of images consisting of multiple textures. The images under study are modeled by a proposed hierarchical random field model, which has two layers. The first l...This paper presents a method for unsupervised segmentation of images consisting of multiple textures. The images under study are modeled by a proposed hierarchical random field model, which has two layers. The first layer is modeled as a Markov Random Field (MRF) representing an unobservable region image and the second layer uses 'Filters, Random and Maximum Entropy (Abb. FRAME)' model to represent multiple textures which cover each region. Compared with the traditional Hierarchical Markov Random Field (HMRF), the FRAME can use a bigger neighborhood system and model more complex patterns. The segmentation problem is formulated as Maximum a Posteriori (MAP) estimation according to the Bayesian rule. The iterated conditional modes (ICM) algorithm is carried out to find the solution of the MAP estimation. An algorithm based on the local entropy rate is proposed to simplify the estimation of the parameters of MRF. The parameters of FRAME are estimated by the ExpectationMaximum (EM) algorithm. Finally, an experiment with synthesized and real images is given, which shows that the method can segment images with complex textures efficiently and is robust to noise.展开更多
The problems of robust stability and robust stability with a guaranteeing cost for discrete time-delay systems with nonlinear perturbation are discussed. A sufficient criterion for robust stability is established in a...The problems of robust stability and robust stability with a guaranteeing cost for discrete time-delay systems with nonlinear perturbation are discussed. A sufficient criterion for robust stability is established in an LMI framework and a linear convex optimization problem with LMI constraints for computing maximal perturbation bound is proposed. Meanwhile, a sufficient criterion for robust stability with a guaranteeing cost for such systems is obtained, and an optimal procedure for decreasing the value of guaranteeing cost is put forward. Two examples are used to illustrate the efficiency of the results.展开更多
文摘This paper presents a method for unsupervised segmentation of images consisting of multiple textures. The images under study are modeled by a proposed hierarchical random field model, which has two layers. The first layer is modeled as a Markov Random Field (MRF) representing an unobservable region image and the second layer uses 'Filters, Random and Maximum Entropy (Abb. FRAME)' model to represent multiple textures which cover each region. Compared with the traditional Hierarchical Markov Random Field (HMRF), the FRAME can use a bigger neighborhood system and model more complex patterns. The segmentation problem is formulated as Maximum a Posteriori (MAP) estimation according to the Bayesian rule. The iterated conditional modes (ICM) algorithm is carried out to find the solution of the MAP estimation. An algorithm based on the local entropy rate is proposed to simplify the estimation of the parameters of MRF. The parameters of FRAME are estimated by the ExpectationMaximum (EM) algorithm. Finally, an experiment with synthesized and real images is given, which shows that the method can segment images with complex textures efficiently and is robust to noise.
基金This research is supported by the National Natural Science Foundation of China(Grant No. 60024301) Natural Science Fund of Shanxi Province, China(Grant No. 20051032).
文摘The problems of robust stability and robust stability with a guaranteeing cost for discrete time-delay systems with nonlinear perturbation are discussed. A sufficient criterion for robust stability is established in an LMI framework and a linear convex optimization problem with LMI constraints for computing maximal perturbation bound is proposed. Meanwhile, a sufficient criterion for robust stability with a guaranteeing cost for such systems is obtained, and an optimal procedure for decreasing the value of guaranteeing cost is put forward. Two examples are used to illustrate the efficiency of the results.