Among all segmentation techniques, Otsu thresholding method is widely used. Line intercept histogram based Otsu thresholding method(LIH Otsu method) can be more resistant to Gaussian noise, highly efficient in computi...Among all segmentation techniques, Otsu thresholding method is widely used. Line intercept histogram based Otsu thresholding method(LIH Otsu method) can be more resistant to Gaussian noise, highly efficient in computing time, and can be easily extended to multilevel thresholding. But when images contain salt-and-pepper noise, LIH Otsu method performs poorly. An improved LIH Otsu method(ILIH Otsu method) is presented, which can be more resistant to Gaussian noise and salt-and-pepper noise. Moreover, it can be easily extended to multilevel thresholding. In order to improve the efficiency, the optimization algorithm based on the kinetic-molecular theory(KMTOA) is used to determine the optimal thresholds. The experimental results show that ILIH Otsu method has stronger anti-noise ability than two-dimensional Otsu thresholding method(2-D Otsu method), LIH Otsu method, K-means clustering algorithm and fuzzy clustering algorithm.展开更多
A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal m...A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the hypergraph.Meanwhile,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition algorithm.The effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also given.The experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.展开更多
In this paper, we report in-depth analysis and research on the optimizing computer network structure based on genetic algorithm and modified convex optimization theory. Machine learning method has been widely used in ...In this paper, we report in-depth analysis and research on the optimizing computer network structure based on genetic algorithm and modified convex optimization theory. Machine learning method has been widely used in the background and one of its core problems is to solve the optimization problem. Unlike traditional batch algorithm, stochastic gradient descent algorithm in each iteration calculation, the optimization of a single sample point only losses could greatly reduce the memory overhead. The experiment illustrates the feasibility of our proposed approach.展开更多
In this paper we propose an algorithm based on the BFGS Quasi-Newton method to solve a linear program. The choice of this method is justified by its theoretical efficiency, the ease to determine a descent direction an...In this paper we propose an algorithm based on the BFGS Quasi-Newton method to solve a linear program. The choice of this method is justified by its theoretical efficiency, the ease to determine a descent direction and its fast convergence towards an optimal solution. Our proposed method is compared with Newton＇s method for linear program named lpnew, widely used as an optimization algorithm for classification problems.展开更多
基金Project(61440026)supported by the National Natural Science Foundation of ChinaProject(11KZ|KZ08062)supported by Doctoral Research Project of Xiangtan University,China
文摘Among all segmentation techniques, Otsu thresholding method is widely used. Line intercept histogram based Otsu thresholding method(LIH Otsu method) can be more resistant to Gaussian noise, highly efficient in computing time, and can be easily extended to multilevel thresholding. But when images contain salt-and-pepper noise, LIH Otsu method performs poorly. An improved LIH Otsu method(ILIH Otsu method) is presented, which can be more resistant to Gaussian noise and salt-and-pepper noise. Moreover, it can be easily extended to multilevel thresholding. In order to improve the efficiency, the optimization algorithm based on the kinetic-molecular theory(KMTOA) is used to determine the optimal thresholds. The experimental results show that ILIH Otsu method has stronger anti-noise ability than two-dimensional Otsu thresholding method(2-D Otsu method), LIH Otsu method, K-means clustering algorithm and fuzzy clustering algorithm.
基金Project(2010CB328101) supported by the National Basic Research Program of ChinaProject(2009AA01Z401) supported by the National High Technology Research and Development Program of China+4 种基金Projects(60803032,90818023) supported by the National Natural Science Foundation of ChinaProjects(09510701300,09JC1414200,09DZ1120403) supported by the Shanghai Science and Technology Commission,China"Shu Guang" Project(10SG23) supported by Shanghai Municipal Education Commission and Shanghai Education Development Foundation,ChinaProject(09QA1405800) supported by Shanghai Science and Technology Commission Rising-Star Program,ChinaProject(NCET-10-0598) supported by Program for New Century Excellent Talents in Chinese University
文摘A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the hypergraph.Meanwhile,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition algorithm.The effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also given.The experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.
文摘In this paper, we report in-depth analysis and research on the optimizing computer network structure based on genetic algorithm and modified convex optimization theory. Machine learning method has been widely used in the background and one of its core problems is to solve the optimization problem. Unlike traditional batch algorithm, stochastic gradient descent algorithm in each iteration calculation, the optimization of a single sample point only losses could greatly reduce the memory overhead. The experiment illustrates the feasibility of our proposed approach.
文摘In this paper we propose an algorithm based on the BFGS Quasi-Newton method to solve a linear program. The choice of this method is justified by its theoretical efficiency, the ease to determine a descent direction and its fast convergence towards an optimal solution. Our proposed method is compared with Newton＇s method for linear program named lpnew, widely used as an optimization algorithm for classification problems.
