Search

Accurate segmentation of industrial CT images is of great significance in industrial fields such as quality inspection and defect analysis. However, reconstruction of industrial CT images often suffers from typical metal artifacts caused by factors like beam hardening, scattering, statistical noise, and partial volume effects. Traditional segmentation methods are difficult to achieve precise segmentation of CT images mainly due to the presence of these metal artifacts. Furthermore, acquiring paired CT image data required by fully supervised networks proves to be extremely challenging. To address these issues, this paper introduces an improved CycleGAN approach for achieving semi-supervised segmentation of industrial CT images. This method not only eliminates the need for removing metal artifacts and noise, but also enables the direct conversion of metal artifact-contaminated images into segmented images without the requirement of paired data. The average values of quantitative assessment of image segmentation performance can reach 0.96645 for Dice Similarity Coefficient(Dice) and 0.93718 for Intersection over Union(IoU). In comparison to traditional segmentation methods, it presents significant improvements in both quantitative metrics and visual quality, provides valuable insights for further research. [ABSTRACT FROM AUTHOR]

Segmentation involves separating an object from the background in a given image. Image segmentation has a variety of applications and has received considerable attention in multimedia application and computer vision. Although numerous approaches have been introduced, image segmentation is still far from being solved due to most of image segmentation algorithms are often so complicated and some unsatisfactory results appear frequently. Therefore, developing a suitable technique of image segmentation is still a challenging problem. In this article, a novel color image segmentation will be introduced based on quaternion radial harmonic Fourier moments (QRHFMs) and proximal classifier. Firstly, the image feature of pixel-level is represented by the accurate and invariant QRHFMs holistically as a vector field, which can describe sufficiently the image pixel information due to take into account the relationship among different color channels. Secondly, the image feature from pixel-level is utilized as the input of the proximal classifier with consistency (PCC), which not only has lower computation time but also has better generalization compared to traditional support vector machines classifiers. Then, we choose the training samples by Tsallis entropy thresholding to train PCC classification model. Finally, the color image is classified by the trained PCC classification model. Our algorithm can make full use of the accurate and robust local image feature, as well the quickness and generalization ability of PCC classifier. A series of experimental results shows that this algorithm has better segmentation performance than the state-of-the-art method from the literature. [ABSTRACT FROM AUTHOR]

Image segmentation remains an important, but hard-to-solve, problem since it appears to be application dependent with usually no a priori information available regarding the image structure. In recent years, many image segmentation algorithms have been developed, but they are often very complex and some undesired results occur frequently. In this paper, we propose a pixel classification based color image segmentation using quaternion exponent moments. Firstly, the pixel-level image feature is extracted based on quaternion exponent moments (QEMs), which can capture effectively the image pixel content by considering the correlation between different color channels. Then, the pixel-level image feature is used as input of twin support vector machines (TSVM) classifier, and the TSVM model is trained by selecting the training samples with Arimoto entropy thresholding. Finally, the color image is segmented with the trained TSVM model. The proposed scheme has the following advantages: (1) the effective QEMs is introduced to describe color image pixel content, which considers the correlation between different color channels, (2) the excellent TSVM classifier is utilized, which has lower computation time and higher classification accuracy. Experimental results show that our proposed method has very promising segmentation performance compared with the state-of-the-art segmentation approaches recently proposed in the literature. [ABSTRACT FROM AUTHOR]

The pyramidal dual-tree directional filter bank (PDTDFB) transform is a new image decomposition, which has many advantages, such as multiscale and multidirectional transform, efficient implementation, high angular resolution, low redundant ratio, and shiftable subbands. In this paper, we present a new color image segmentation algorithm based on PDTDFB domain hidden Markov tree (HMT) model. Firstly, the joint statistics and mutual information of the PDTDFB coefficients are studied. Then, the PDTDFB coefficients are modeled using a HMT model with Gaussian mixtures, which can effectively capture the intra-scale, inter-scale, and inter-direction dependencies. Finally, a color image segmentation using PDTDFB domain HMT model is developed, in which expectation–maximization (EM) parameter estimation, Bayesian multiscale raw segmentation, context based multiscale fusion, and majority-vote based color component fusion are used. Experimental evidence shows that the proposed color image segmentation algorithm has very effective segmentation results in comparison with the state-of-the-art segmentation methods recently proposed in the literature. [ABSTRACT FROM AUTHOR]