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.展开更多
Based on the fact that 3-D model discretization by artificial could not always be successfully implemented especially for large-scaled problems when high accuracy and efficiency were required, a new adaptive multigrid...Based on the fact that 3-D model discretization by artificial could not always be successfully implemented especially for large-scaled problems when high accuracy and efficiency were required, a new adaptive multigrid finite element method was proposed. In this algorithm, a-posteriori error estimator was employed to generate adaptively refined mesh on a given initial mesh. On these iterative meshes, V-cycle based multigrid method was adopted to fast solve each linear equation with each initial iterative term interpolated from last mesh. With this error estimator, the unknowns were nearly optimally distributed on the final mesh which guaranteed the accuracy. The numerical results show that the multigrid solver is faster and more stable compared with ICCG solver. Meanwhile, the numerical results obtained from the final model discretization approximate the analytical solutions with maximal relative errors less than 1%, which remarkably validates this algorithm.展开更多
基金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.
基金Projects(2006AA06Z105, 2007AA06Z134) supported by the National High-Tech Research and Development Program of ChinaProjects(2007, 2008) supported by China Scholarship Council (CSC)
文摘Based on the fact that 3-D model discretization by artificial could not always be successfully implemented especially for large-scaled problems when high accuracy and efficiency were required, a new adaptive multigrid finite element method was proposed. In this algorithm, a-posteriori error estimator was employed to generate adaptively refined mesh on a given initial mesh. On these iterative meshes, V-cycle based multigrid method was adopted to fast solve each linear equation with each initial iterative term interpolated from last mesh. With this error estimator, the unknowns were nearly optimally distributed on the final mesh which guaranteed the accuracy. The numerical results show that the multigrid solver is faster and more stable compared with ICCG solver. Meanwhile, the numerical results obtained from the final model discretization approximate the analytical solutions with maximal relative errors less than 1%, which remarkably validates this algorithm.
