Search

Image semantic segmentation technology is one of the core research contents in the field of computer vision. With the improvement of computer performance and the continuous development of deep learning technology, researchers have more and more enthusiasm to study the actual effect and performance of image semantic segmentation. The results of deep semantic segmentation allow computers to have a more detailed and accurate understanding of images, and have a wide range of application needs in the fields of autonomous driving, intelligent security, medical imaging, remote sensing images, etc. However, the existing image semantic segmentation algorithms have the disadvantages of easy discontinuous results and insufficient prediction accuracy. In this paper, we take deep learning-based image semantic segmentation technology as the research object to explore the improvement of the image semantic segmentation algorithm and its application in road scenarios. First, this paper proposes MCU-Net method based on residual fusion and multi-scale contextual information. MCU-Net uses residual fusion module to deepen the network structure and improve the ability of U-Net to acquire deeper features. Then a top-down and bottom-up path is constructed for feature information between different levels, and the spatial and semantic information contained in shallow and deep features in the network is fully utilized by fusing features from different levels. In addition, an enhanced void space pyramid pooling module is added for feature information between the same levels, which enables the output features to have a larger range of semantic information. Second, this paper proposes the DAMCU-Net method based on attention mechanism and edge detection based on MCU-Net. DAMCU-Net extracts global contextual information by the attention mechanism optimization module, while fusing features using dense jump connections to facilitate the network to recover more spatial detail information during upsampling, and uses the FReLU activation function to improve the segmentation capability of the network for complex targets. For the edge information lost in the feature extraction process, the edge detection branch is added to supplement the feature information of the main path by feature fusion to achieve the optimization of the edge information. [ABSTRACT FROM AUTHOR]

Deep convolutional neural networks have shown advanced performance in accurately segmenting images. In this paper, an SNP-like convolutional neuron structure is introduced, abstracted from the nonlinear mechanism in nonlinear spiking neural P (NSNP) systems. Then, a U-shaped convolutional neural network named SNP-like parallel-convolutional network, or SPC-Net, is constructed for segmentation tasks. The dual-convolution concatenate (DCC) and dual-convolution addition (DCA) network blocks are designed, respectively, in the encoder and decoder stages. The two blocks employ parallel convolution with different kernel sizes to improve feature representation ability and make full use of spatial detail information. Meanwhile, different feature fusion strategies are used to fuse their features to achieve feature complementarity and augmentation. Furthermore, a dual-scale pooling (DSP) module in the bottleneck is designed to improve the feature extraction capability, which can extract multi-scale contextual information and reduce information loss while extracting salient features. The SPC-Net is applied in medical image segmentation tasks and is compared with several recent segmentation methods on the GlaS and CRAG datasets. The proposed SPC-Net achieves 90.77% DICE coefficient, 83.76% IoU score and 83.93% F1 score, 86.33% ObjDice coefficient, 135.60 Obj-Hausdorff distance, respectively. The experimental results show that the proposed model can achieve good segmentation performance. [ABSTRACT FROM AUTHOR]

In recent years, several studies have undergone automatic blood vessel segmentation based on unsupervised and supervised algorithms to reduce user interruption. Deep learning networks have been used to get highly accurate segmentation results. However, the incorrect segmentation of pathological information and low micro-vascular segmentation is considered the challenges present in the existing methods for segmenting the retinal blood vessel. It also affects different degrees of vessel thickness, contextual feature fusion in technique, and perception of details. A deep learning-aided method has been presented to address these challenges in this paper. In the first phase, the preprocessing is performed using the retinal fundus images employed by the black ring removal, LAB conversion, CLAHE-based contrast enhancement, and grayscale image. Thus, the blood vessel segmentation is performed by a new deep learning model termed optimized ResUNet + +. As an improvement to this deep learning architecture, the activation function is optimized by the J-AGSO algorithm. The objective function for the optimized ResUNet + + -based blood vessel segmentation is to minimize the binary cross-entropy loss function. Further, the post-processing of the images is carried out by median filtering and binary thresholding. By verifying the standard benchmark datasets, the proposed model outperforms and attains enhanced performance. [ABSTRACT FROM AUTHOR]

In this paper, a new detection method of pin defects based on image segmentation and ResNe-50 is proposed, which realizes the defect detection of faulty pins in many aviation connectors. In this paper, a new dataset image segmentation method is used to segment many aviation connectors in a single image to generate a dataset, which reduces the tedious work of manually labeling the dataset. In the defect detection model, based on ResNet-50, a ResNet-B residual structure is introduced to reduce the loss of features during information extraction; a continuously differentiable CELU is used as the activation function to reduce the neuron death problem of ReLU; a new deformable convolution network (DCN v2) is introduced as the convolution kernel structure of the model to improve the recognition of aviation connectors with prominent geometric deformation pin recognition. The improved model achieved 97.2% and 94.4% accuracy for skewed and missing pins, respectively, in the experiments. The detection accuracy improved by 1.91% to 96.62% compared to the conventional ResNet-50. Compared with the traditional model, the improved model has better generalization ability. [ABSTRACT FROM AUTHOR]

In this paper, we focus on two tasks: semantic segmentation and target detection in the visual semantic understanding of tennis sports images and we optimize the network structure to achieve a more complete location contour information mining of the target. In detail, we focus on a weakly supervised image semantic segmentation method based on null convolution pixel relations. To address the problem of incomplete pixel-level pseudo-labeling, we introduce a cavity convolution unit with multiple cavity rates and a self-attentive mechanism in the classification model to adaptively enhance the target regions and suppress other irrelevant regions while expanding the perceptual field to generate high-quality pixel-level pseudo-labeling and then train the semantic segmentation model. The final experimental results show that the hierarchical fusion algorithm proposed in this paper significantly outperforms other algorithms, and the overall classification accuracy of the tandem cavity neural network algorithm reaches 81% with good overall classification results. The recognition accuracy of static movements is higher than that of dynamic movements. [ABSTRACT FROM AUTHOR]

Visual Cryptography (VC) is a process employed for the maintenance of secret information by hiding the secret messages that are embedded within the images. Typically, an image is partitioned into a number of shares that are stacked over one another in order to reconstruct back the original image accurately. The major limitation that existed in the traditional VC techniques is pixel expansion, in which pixel expansion is replaced with a number of sub-pixels in individual share, which causes a considerable impact on the contrast and resolution of the image that further gradually decreases the quality of the image. VC is named for its essential characteristics, such as transmitting the images with two or more shares with an equal number of black pixels and color pixel distribution. The secret message can be decrypted using Human Visual System (HVS). In this paper, 50 research papers are reviewed based on various classification algorithms, which are effectively used for the VC technique. The classification algorithms are categorized into three types, namely, meta-heuristic, heuristic, and evolutionary, and the research issues and challenges confronted by the existing techniques are reported in this survey. Moreover, the analysis is done based on the existing research works by considering the classification algorithms, tools, and evaluation metrics. [ABSTRACT FROM AUTHOR]

Industrial fume emissions are a major contributor to global warming, and accurate monitoring is necessary. However, current segmentation techniques for video monitoring of industrial fumes are limited by ineffective edge segmentation, lack of consideration of dynamic characteristics, and poor segmentation accuracy. To address these issues, a deep learning-based semantic video segmentation network is proposed in this paper. The network combines fume deformation information, employs LR-ASPP design for real-time performance, and spatio-temporal consistency to enhance semantic information in the dynamic region. A residual hybrid attention network is constructed for the motion region to minimize loss of motion information. The proposed network demonstrates strong anti-interference capability in complex environments, achieving over 10% improvement in IoU and F -score under a high-speed segmentation of 53 FPS. This technology can be integrated with automated systems to enable timely responses to hazardous situations, minimizing risks to workers and nearby communities. In summary, the proposed deep learning-based semantic video segmentation network has significant implications for improving environmental monitoring and management practices in industrial settings. [ABSTRACT FROM AUTHOR]

Recently, image segmentation based on graph cut methods has shown remarkable performance on a set of image data. Although the kernel graph cut method provides good performance, its performance is highly dependent on the data mapping to the transformation space and image features. The entropy-based kernel graph cut method is suitable for segmentation of textured images. Nonetheless, its segmentation quality remains significantly contingent on the accuracy and richness of feature space representation and kernel centers. This paper introduces an entropy-based kernel graph cut method, which leverages the discriminative feature space extracted from SqueezeNet, a deep neural network. The fusion of SqueezeNet’s features enriches the segmentation process by capturing high-level semantic information. Moreover, the extraction of kernel centers is refined through a weighted k-means approach, contributing further to the segmentation’s precision and effectiveness. The proposed method, while exploiting the benefits of suitable computational load of graph cut methods, will be a suitable alternative for segmenting textured images. Laboratory results have been taken on a set of well-known datasets that include textured shapes in order to evaluate the efficiency of the algorithm compared to other well-known methods in the field of kernel graph cut. [ABSTRACT FROM AUTHOR]

In recent years, deep learning-based networks have been able to achieve state-of-the-art performance in medical image segmentation. U-Net, one of the currently available networks, has proven to be effective when applied to the segmentation of medical images. A Convolutional Neural Network's (CNN) performance is heavily dependent on the network's architecture and associated parameters. There are many layers and parameters that need to be set up in order to manually create a CNN, making it a complex procedure. Designing a network is made more difficult by using a variety of connections to increase the network's complexity. Evolutionary computation can be used to set the parameters of CNN and/or organize the CNN layers as an optimization strategy. This paper proposes an automatic evolutionary method for detecting an optimal network topology and its parameters for the segmentation of clinical image using Grey Wolf Optimization algorithm. Also, Bi-Directional LSTM integrated in the skip connection to extract dense feature characteristics of image by combining feature maps extracted from encoded and previous decoded path in nonlinear way (MIS-GW-U-Net-BiDCLSTM) is proposed. The experimental results demonstrate that the proposed method attains 98.49% accuracy with minimal parameters, which is much better than that of the other methods. [ABSTRACT FROM AUTHOR]

At present, there are many semantic segmentation algorithms with excellent performance for intelligent driving vehicles, but most of them only work well on scenes with good illumination. In order to solve the problem of scene segmentation under low illumination, this paper proposes a novel semantic segmentation algorithm that combines visible and infrared images. In this algorithm, two parallel encoders are designed as the input of the images, and the decoder divides the fused images output from the encoder. The model is based on ResNet algorithm, and the residual attention module is used in each branch to mine and enhance the spatial features of multilevel channels to extract images information. Experiments are carried out on publicly available thermal infrared and visible datasets. The results show that the algorithm proposed in this paper is superior to the algorithm using only visible images in semantic segmentation of traffic environment. [ABSTRACT FROM AUTHOR]

Because of the limitations of convolution kernel, the traditional image segmentation network is not sufficient to obtain the context information, but the image segmentation task is very dependent on the context information. Transformer's linear input can just get enough context information. In this paper, we propose a transformer segmentation network hyperfusion transformer based on a pyramid structure. First, the model divides the single-scale coding form into several-different-scale coding forms, and then fuses the decoding results. Second, in order to ensure the specificity of the output characteristics of each branch, we orthogonalize the results of a variety of different scales. By orthogonalizing in pairs, we can ensure that the results obtained by different branches are not completely similar to a certain extent, and reduce the redundancy of branch information. On the two datasets, the method in this paper surpasses a variety of classical models under multiple evaluation indexes, confirming that it is an effective segmentation method. [ABSTRACT FROM AUTHOR]

Coastal grounding electrodes are currently an important means to alleviate land grounding electrode land constraints. In order to better invert the terrestrial geodesic resistivity in the coastal region, this paper proposes a complete set of inversion technology schemes. First, this paper proposes a layered land model for the coastal region, and a composite geodetic model is modeled by the fold junction of the land model and the ocean. Based on this, an adaptive subdivision boundary element method is proposed for solving the composite soil grounding calculation problem, and the accuracy and advantages of the method are demonstrated by examples. Finally, the paper uses the differential evolutionary algorithm to invert the exploration data of the four-point method in the coastal area, and obtains the parameters of the terrestrial layered geodetic model that meet the engineering requirements. The comparison with the grounding software CDEGS illustrates the effectiveness of the method. This paper carries out the research on the modeling and inversion methods of composite layered soil model, combining advanced numerical calculation methods and artificial intelligence algorithms to provide the support of computational tools for coastal resistivity inversion. [ABSTRACT FROM AUTHOR]

Deep neural networks (DNNs) have emerged as a prominent model in medical image segmentation, achieving remarkable advancements in clinical practice. Despite the promising results reported in the literature, the effectiveness of DNNs necessitates substantial quantities of high-quality annotated training data. During experiments, we observe a significant decline in the performance of DNNs on the test set when there exists disruption in the labels of the training dataset, revealing inherent limitations in the robustness of DNNs. In this paper, we find that the neural memory ordinary differential equation (nmODE), a recently proposed model based on ordinary differential equations (ODEs), not only addresses the robustness limitation but also enhances performance when trained by the clean training dataset. However, it is acknowledged that the ODE-based model tends to be less computationally efficient compared to the conventional discrete models due to the multiple function evaluations required by the ODE solver. Recognizing the efficiency limitation of the ODE-based model, we propose a novel approach called the nmODE-based knowledge distillation (nmODE-KD). The proposed method aims to transfer knowledge from the continuous nmODE to a discrete layer, simultaneously enhancing the model's robustness and efficiency. The core concept of nmODE-KD revolves around enforcing the discrete layer to mimic the continuous nmODE by minimizing the KL divergence between them. Experimental results on 18 organs-at-risk segmentation tasks demonstrate that nmODE-KD exhibits improved robustness compared to ODE-based models while also mitigating the efficiency limitation. [ABSTRACT FROM AUTHOR]

Aquila optimizer (AO) is an efficient meta-heuristic optimization method, which mimics the hunting style of Aquila in nature. However, the AO algorithm may suffer from immature convergence during the exploitation stage. In this paper, two strategies are elegantly employed into conventional AO, such as random opposition-based learning and nonlinear flexible jumping factor, which can efficiently enhance the performance of conventional AO. Experiments on 1 7 benchmark functions and image segmentation demonstrate the effectiveness of the proposed algorithm. Comparison with several state-of-the-art meta-heuristic optimization techniques indicates the efficacy of the developed method. [ABSTRACT FROM AUTHOR]

In the current medical image segmentation network, the combination of CNN and Transformer has become a mainstream trend. However, the inherent limitations of convolution operation in CNN and insufficient information interaction in Transformer affect the segmentation performance of the network. To solve these problems, an integrated self-attention and convolution medical image segmentation network (ISC-TransUNet) is proposed in this paper. The network consists of encoder, decoder and jump connection. First, the encoder uses a hybrid structure of BoTNet and Transformer to capture more comprehensive image information and reduce additional computing overhead. Then, the decoder uses an upper sampler cascaded by multiple DUpsampling upper blocks to accurately recover the pixel-level prediction. Finally, the feature fusion of encoder and decoder at different resolutions is realized by ResPath jump connection, which reduces the semantic difference between encoder and decoder. Through experiments on the Synapse multi-organ segmentation dataset, compared with the baseline model TransUNet, Dice similarity coefficient of ISC-TransUNet was improved by 1.13%, Hausdorff distance was reduced by 2.38%, and weight was maintained. The experimental results show that the network can effectively segment tissues and organs in medical images, which has important theoretical significance and application value for intelligent clinical diagnosis and treatment. [ABSTRACT FROM AUTHOR]

Over the years, the humanities community has increasingly requested the creation of artificial intelligence frameworks to help the study of cultural heritage. Document Layout segmentation, which aims at identifying the different structural components of a document page, is a particularly interesting task connected to this trend, specifically when it comes to handwritten texts. While there are many effective approaches to this problem, they all rely on large amounts of data for the training of the underlying models, which is rarely possible in a real-world scenario, as the process of producing the ground truth segmentation task with the required precision to the pixel level is a very time-consuming task and often requires a certain degree of domain knowledge regarding the documents at hand. For this reason, in this paper, we propose an effective few-shot learning framework for document layout segmentation relying on two novel components, namely a dynamic instance generation and a segmentation refinement module. This approach is able of achieving performances comparable to the current state of the art on the popular Diva-HisDB dataset, while relying on just a fraction of the available data. [ABSTRACT FROM AUTHOR]

With the advent of deep neural networks, medical image analysis is able to predict results in advance in early detection and diagnosis of diseases found in the human body. Several deep neural network methodologies have been implemented for a quick and efficient analysis of medical images that detect and diagnose cancerous cell growth in any part of the human body. For improving the segmentation and classification accuracy, the paper has proposed a framework comprising modified DoubleU-Net for image segmentation and PolyNet architecture for image classification. The modified DoubleU-Net is composed of two U-Net architectures, in which U-Net1 makes use of ResNet-50 as an encoder in the place of VGG-16 (existing) and Atrous Spatial Pyramid Pooling (ASPP) is replaced by Waterfall Atrous Spatial Pooling (WASP) architecture in both U-Nets to improve the semantic image segmentation. For classifying the segmented medical images as benign or malignant, PolyNet architecture is implemented in the research. The research involves experiments on the brain tumor dataset and lung cancer dataset to analyze the performance of the proposed approach. The processing of the DoubleU-Net and modified DoubleU-Net is evaluated based on precision, Recall, Intersection over Union (IoU), and Dice Score as the performance metrics. Experimental findings indicate that the modified DoubleU-Net design outperformed the existing DoubleU-Net architecture in terms of performance parameters for segmentation. The efficiency of the PolyNet classifier has been evaluated against VGG-16 and Inception-V3 classifiers, in terms of accuracy, specificity, sensitivity, error rate, and computation time as the performance metrics. From the experimental results, it has been proved that the PolyNet classifier performs better than VGG-16 and Inception-V3 with improved accuracy, specificity, sensitivity, and computation time. [ABSTRACT FROM AUTHOR]

Image segmentation is an essential part of medical image processing, which plays a significant role in adjunctive therapy, disease diagnosis, and medical assessment. To solve the problem of insufficient extracting context information, especially for medical image segmentation, this paper proposes a novel network architecture of multi-scale object context dilated transformer network (Multi-OCDTNet) to improve the utilization and segmentation accuracy for context information. The multi-scale object context transformer module can extract the multi-scale context information of the image through a three-layer transformer structure in a parallel way. The dilated convolution self-aware module can enhance the awareness of multi-scale context information in the feature map through layering transformer block groups and a set of transformer layers. In addition, we propose a composite weight-assigned-based loss function based on DDCLoss and Focal Tversky Loss to improve the stability of the segmentation performance of Multi-OCDTNet by adjusting the weight. The performance of Multi-OCDTNet is validated on the DRIVE and STARE datasets with segmentation accuracy of 97.17% and 97.84%, respectively, indicating the Multi-OCDTNet network possesses a significant competitive advantage in improving the segmentation performance of retinal vessel images. [ABSTRACT FROM AUTHOR]

Land cover segmentation has been a significant research area because of its multiple applications including the infrastructure development, forestry, agriculture, urban planning, and climate change research. In this paper, we propose a novel segmentation method, called Frequency-guided Position-based Attention Network (FPA-Net), for land cover image segmentation. Our method is based on encoder–decoder improved U-Net architecture with position-based attention mechanism and frequency-guided component. The position-based attention block is used to capture the spatial dependency among different feature maps and obtain the relationship among relevant patterns across the image. The frequency-guided component provides additional support with high-frequency features. Our model is simple and efficient in terms of time and space complexities. Experimental results on the Deep Globe, GID-15, and Land Cover AI datasets show that the proposed FPA-Net can achieve the best performance in both quantitative and qualitative measures as compared against other existing approaches. [ABSTRACT FROM AUTHOR]

In modern society, digital images can be far-reaching, and the images are manipulated by various software and hardware technologies. The image forgery activities are undertaken by the attackers mainly for damaging the reputation of people or receiving fiscal gain, etc. Taking this into consideration, many techniques are developed to detect the forged images. In this paper, a new deep learning-based approach is introduced for copy-move forgery detection. The input images are segmented into non-overlapping patches using superpixel-based modified dense peak clustering and the features are extracted from the segmented patches by applying deep learning structure of attention-based DenseNet 121 model. Besides, to compare every block, the depth of each pixel is reconstructed, and eventually matching process is carried out using the adaptive chimp patch matching approach, which detects the suspicious forged regions in an image. Finally, the matched keypoints are merged with the segmented patches using the merged keypoint matching algorithm. As a result, the new deep learning approach has detected the forged regions efficiently from the tampered image with less time even the image is compressed, rotated, or scaled. The performance is evaluated in terms of recall, precision, accuracy, F1-score, computational time, and False Positive Rate (FPR). Moreover, the performance is compared with the other existing approaches, and the outcomes showed that the proposed method has achieved higher accuracy of 97%, recall of 99%, precision of 97.84%, F1-score of 98.81%, FPR of 0.022 and less computational time of 2.5 s. [ABSTRACT FROM AUTHOR]

The technical document is an entity that consists of several essential and interconnected parts, often referred to as modalities. Despite the extensive attention that certain modalities have already received, say per the textual information, there are several aspects that get disproportional attention throughout the bibliography. An instance of such a modality is the block diagrams found in the technical document, as they can provide crucial information about the functionality and the technical details of both their related parts and the technical document as a whole. This paper deals with the automatic understanding of block diagrams and the extraction of pseudocode associated with the functionality of a given diagram. In particular we present a complete methodology for the formal modelling of digital block diagrams and their elements, then we develop a generative framework and three novel annotated datasets on diagrams classification and captioning. After mapping the initial problem to a block diagram description task, we present several original predictive setups derived from image segmentation, analyze the inference capabilities, and we offer illustrative examples justifying our approach. [ABSTRACT FROM AUTHOR]

In recent years, with the development of remote sensing technology and the enhancement of the value of remote sensing images in military and civil fields, remote sensing image object segmentation has also received more and more attention. This paper mainly studies the application of instance segmentation based on deep convolutional neural network in the remote sensing image. This paper proposes an attention balanced feature pyramid module, which strengthens multi-level features and uses the attention module to suppress the interference features of noise in the complex background. In addiction, Soft-NMS is introduced to improve the performance of the network, and GIoU loss is introduced to improve the effect of object detection. The proposed network improves the average detection and segmentation accuracy (mAP) values from 4 1. 7 5 % and 3 5. 3 4 % to 4 3. 0 5 % and 3 6. 0 2 % , respectively. [ABSTRACT FROM AUTHOR]

Medical image segmentation plays a crucial role in clinical diagnosis and therapy systems, yet still faces many challenges. Building on convolutional neural networks (CNNs), medical image segmentation has achieved tremendous progress. However, owing to the locality of convolution operations, CNNs have the inherent limitation in learning global context. To address the limitation in building global context relationship from CNNs, we propose LGNet, a semantic segmentation network aiming to learn local and global features for fast and accurate medical image segmentation in this paper. Specifically, we employ a two-branch architecture consisting of convolution layers in one branch to learn local features and transformer layers in the other branch to learn global features. LGNet has two key insights: (1) We bridge two-branch to learn local and global features in an interactive way; (2) we present a novel multi-feature fusion model (MSFFM) to leverage the global contexture information from transformer and the local representational features from convolutions. Our method achieves state-of-the-art trade-off in terms of accuracy and efficiency on several medical image segmentation benchmarks including Synapse, ACDC and MOST. Specifically, LGNet achieves the state-of-the-art performance with Dice's indexes of 80.15% on Synapse, of 91.70% on ACDC, and of 95.56% on MOST. Meanwhile, the inference speed attains at 172 frames per second with 2 2 4 × 2 2 4 input resolution. The extensive experiments demonstrate the effectiveness of the proposed LGNet for fast and accurate for medical image segmentation. [ABSTRACT FROM AUTHOR]

We consider a minimization problem whose objective function is the sum of a fidelity term, not necessarily convex, and a regularization term defined by a positive regularization parameter λ multiple of the ℓ 0 norm composed with a linear transform. This problem has wide applications in compressed sensing, sparse machine learning and image reconstruction. The goal of this paper is to understand what choices of the regularization parameter can dictate the level of sparsity under the transform for a global minimizer of the resulting regularized objective function. This is a critical issue but it has been left unaddressed. We address it from a geometric viewpoint with which the sparsity partition of the image space of the transform is introduced. Choices of the regularization parameter are specified to ensure that a global minimizer of the corresponding regularized objective function achieves a prescribed level of sparsity under the transform. Results are obtained for the spacial sparsity case in which the transform is the identity map, a case that covers several applications of practical importance, including machine learning, image/signal processing and medical image reconstruction. [ABSTRACT FROM AUTHOR]

Accurate tumor segmentation in medical images plays an important role in clinical diagnosis and disease analysis. However, medical images usually have great complexity, such as low contrast of computed tomography (CT) or low spatial resolution of positron emission tomography (PET). In the actual radiotherapy plan, multimodal imaging technology, such as PET/CT, is often used. PET images provide basic metabolic information and CT images provide anatomical details. In this paper, we propose a 3D PET/CT tumor co-segmentation framework based on active contour model. First, a new edge stop function (ESF) based on PET image and CT image is defined, which combines the grayscale standard deviation information of the image and is more effective for blurry medical image edges. Second, we propose a background subtraction model to solve the problem of uneven grayscale level in medical images. Apart from that, the calculation format adopts the level set algorithm based on the additive operator splitting (AOS) format. The solution is unconditionally stable and eliminates the dependence on time step size. Experimental results on a dataset of 50 pairs of PET/CT images of non-small cell lung cancer patients show that the proposed method has a good performance for tumor segmentation. [ABSTRACT FROM AUTHOR]

Over the last decades, facing the blooming growth of technological progress, interest in digital devices such as computed tomography (CT) as well as magnetic resource imaging which emerged in the 1970s has continued to grow. Such medical data can be invested in numerous visual recognition applications. In this context, these data may be segmented to generate a precise 3D representation of an organ that may be visualized and manipulated to aid surgeons during surgical interventions. Notably, the segmentation process is performed manually through the use of image processing software. Within this framework, multiple outstanding approaches were elaborated. However, the latter proved to be inefficient and required human intervention to opt for the segmentation area appropriately. Over the last few years, automatic methods which are based on deep learning approaches have outperformed the state-of-the-art segmentation approaches due to the use of the relying on Convolutional Neural Networks. In this paper, a segmentation of preoperative patients CT scans based on deep learning architecture was carried out to determine the target organ's shape. As a result, the segmented 2D CT images are used to generate the patient-specific biomechanical 3D model. To assess the efficiency and reliability of the proposed approach, the 3DIRCADb dataset was invested. The segmentation results were obtained through the implementation of a U-net architecture with good accuracy. [ABSTRACT FROM AUTHOR]

Classification of tumors from MRI plays very important role for diagnosing various diseases. But, it consumes an enormous amount of time for classification. Due to the similar structure of anomalous and typical tissues in the brain, it is difficult to complete the detection process successfully. Many researchers have developed new methods for detection and classification of tumors. But most of them failed at some point due to these limitations. Therefore in our work, we introduced a new machine learning algorithm for detection and classification of tumors. In addition to this, an intellectual segmentation technique known as Improved Binomial Thresholding technique is also introduced in this paper. This newly developed approach is used to differentiate the normal and abnormal slices from brain MRI. We can extract different features from the segmented image. The extracted features may be Wavelet Transform based (WT) or Scattering Wavelet Transform based (SWT). Feature selection process is achieved using a hybrid algorithm known as CS-FS (Hybrid Cuckoo Search with Fish Swarm) to minimize the dimension of extracted features. Finally, feature classification process is performed using Sparse Bayesian Extreme Learning Machine (SBELM) classifier. The proposed method is executed with the help of BRATS (Brain Tumor Image Segmentation) 2015 dataset. The result of the proposed method is evaluated on different parameters like accuracy, specificity, and sensitivity. The values of these parameters are obtained by computing four factors such as TP, TN, FN and FP. The final evaluation results showed that, our proposed SBELM classifier has attained 97.2% accuracy, which is better than the other existing method like state-of-the-art method. [ABSTRACT FROM AUTHOR]

In recent years, solar photovoltaic-based power generation technology has become the key planning direction of many countries around the world. In the process of making solar cells, the quality inspection requirements are very particular, such as physical damages, surface scratches, broken grids and microcracks. In traditional factory production, the detection of the above defects requires professional inspectors to carry out visual inspection, which often leads to low detection efficiency, subjective assumption and fatigue, as well as some detection errors. In recent years, the rapid development of computer vision makes it possible to be used to detect the defects in solar cells. To overcome existing barriers, this paper proposes a method for detecting surface defects in solar cells based on deep neural network. Specifically, a specified image segmentation model named U-Net is developed for this purpose. By automatically segmenting little objects using the proposed recognition approach, surface defects detection can be realized. At last, we use a set of experiments on images from real scenes to verify the proposed method. [ABSTRACT FROM AUTHOR]

Earlier identification of brain tumor (BT) is essential to increase the survival rate of the patients. The commonly used imaging technique for BT diagnosis is magnetic resonance imaging (MRI). Automated BT classification model is required for assisting the radiologists to save time and enhance efficiency. The classification of BT is difficult owing to the non-uniform shapes of tumors and location of tumors in the brain. Therefore, deep learning (DL) models can be employed for the effective identification, prediction, and diagnosis of diseases. In this view, this paper presents an automated BT diagnosis using rat swarm optimization (RSO) with deep learning based capsule network (DLCN) model, named RSO-DLCN model. The presented RSO-DLCN model involves bilateral filtering (BF) based preprocessing to enhance the quality of the MRI. Besides, non-iterative grabcut based segmentation (NIGCS) technique is applied to detect the affected tumor regions. In addition, DLCN model based feature extractor with RSO algorithm based parameter optimization processes takes place. Finally, extreme learning machine with stacked autoencoder (ELM-SA) based classifier is employed for the effective classification of BT. For validating the BT diagnostic performance of the presented RSO-DLCN model, an extensive set of simulations were carried out and the results are inspected under diverse dimensions. The simulation outcome demonstrated the promising results of the RSO-DLCN model on BT diagnosis with the sensitivity of 98.4%, specificity of 99%, and accuracy of 98.7%. [ABSTRACT FROM AUTHOR]

COVID-19 is known in recent times as a severe syndrome of respiratory organ (Lungs) and has gradually produced pneumonia, a lung disorder all around the world. As coronavirus is continually spreading rapidly globally, the computed tomography (CT) technique has been made important and essential for quick diagnosis of this dangerous syndrome. Hence, it is necessitated to develop a precise computer-based technique for assisting medical clinicians in identifying the COVID-19 influenced patients with the help of CT scan images. Therefore, the multilayer perceptron neural networks optimized with Garra Rufa Fish optimization using images of CT scan is proposed in this paper for the classification of COVID-19 patients (COV-19-MPNN-GRF-CTI). The input images are taken from SARS-COV-2 CT-scan dataset. Initially, the input images are pre-processed utilizing convolutional auto-encoder (CAE) to enhance the quality of the input images by eliminating noises. The pre-processed images are fed to Residual Network (ResNet-50) for extracting the global and statistical features. The extraction over the features of CT scan images is made through ResNet-50 and subsequently input to multilayer perceptron neural networks (MPNN) for CT images classification as COVID-19 and Non-COVID-19 patients. Here, the layer of Batch Normalization of the MPNN is separated and added with ResNet-50 layer. Generally, MPNN classifier does not divulge any adoption of optimization approach for calculating the optimal parameters and accurately classifying the extracted features of CT images. The Garra Rufa Fish (GRF) optimization algorithm performs to optimize the weight parameters of MPNN classifiers. The proposed approach is executed in MATLAB. The performance metrics, such as sensitivity, precision, specificity, F -measure, accuracy and error rate, are examined. Then the performance of the proposed COV-19-MPNN-GRF-CTI method provides 22.08%, 24.03%, 34.76% higher accuracy, 23.34%, 26.45%, 34.44% higher precision, 33.98%, 21.95%, 34.78% lower error rate compared with the existing methods, like multi-task deep learning using CT image analysis for COVID-19 pneumonia classification and segmentation (COV-19-MDP-CTI), COVID-19 classification utilizing CT scan depending on meta-classifier approach (COV-19-SEMC-CTI) and deep learning-based COVID-19 prediction utilizing CT scan images (COV-19-CNN-CTI), respectively. [ABSTRACT FROM AUTHOR]

Image segmentation in brain magnetic resonance imaging (MRI) largely relates to dividing brain tissue into components like white matter (WM), gray matter (GM), and cerebrospinal fluid (CSF). Using the segmentation outputs, medical images can be 3D reconstructed and visualized efficiently. It is common for MRI pictures to have issues such as partial volume effects, asymmetrical grayscale, and noise. As a result, high accuracy in brain MRI picture segmentation is challenging to achieve in practical applications. In this paper, we developed an effective algorithm for brain MRI image segmentation utilizing a combination of statistical and partial differential equation-based approaches, based on a neuro-mechanical model. The findings of this work demonstrate that by combining various segmentation approaches, it is possible to quickly segment brain MRI data at a degree of precision necessary for different applications. Here, we show that when we use nonlinear filtering, k -means clustering, and active contour modeling, we can get very good results when we segment brain MRI images. It is clear that the proposed approach has higher segmentation performance and can properly separate brain tissue from a large number of MRI images. [ABSTRACT FROM AUTHOR]

In medical image examination, image segmentation is the broadly used method. Currently, the efficient segmentation of mammogram images is the main challenge. Many methods were presented for segmenting the mammogram images, but the results are not satisfactory. In this paper, an efficient segmentation of mammogram images-based Multilevel Thresholding (MLT) method is proposed. Initially, the preprocessing step is executed for eliminating the unnecessary noises. For gaining the useful features from the mammogram images, mammogram image segmentation is carried out using multilevel thresholding method. In this paper, a novel Multi-Objective Emperor Penguin Optimization (MOEPO) algorithm is proposed for searching the multilevel greatest thresholds that segment the images into background and objects. The objective functions of the MLT are Otsu's method, Kapur and Tsallis entropy. The effectiveness of the proposed method is analyzed using several performances evaluating metrics, like PSNR, FSIM and SSIM. The experimental outcomes show that the performance of the proposed technique is superior to other state-of-the-art methods. The proposed technique is likened to three existing models, viz. ScPSO-MT, Double Threshold and IWO-SUSAN. The SSIM of the proposed technique is 24.99%, 27.83% and 26.95% better than ScPSO-MT, Double Threshold and IWO-SUSAN existing approaches. The PSNR of the proposed technique is 25.27%, 40% and 50.74% better than ScPSO-MT, Double Threshold and IWO-SUSAN approaches. The FSIM of the proposed technique is 28.57%, 34.12% and 34.12% better than ScPSO-MT, Double Threshold and IWO-SUSAN methods. [ABSTRACT FROM AUTHOR]

Karyotype is a genetic test that is used for detection of chromosomal defects. In a karyotype test, an image is captured from chromosomes during the cell division. The captured images are then analyzed by cytogeneticists in order to detect possible chromosomal defects. In this paper, we have proposed an automated pipeline for analysis of karyotype images. There are three main steps for karyotype image analysis: image enhancement, image segmentation and chromosome classification. In this paper, we have proposed a novel chromosome segmentation algorithm to decompose overlapped chromosomes. We have also proposed a CNN-based classifier which outperforms all the existing classifiers. Our classifier is trained by a dataset of about 1,62,000 human chromosome images. We also introduced a novel post-processing algorithm which improves the classification results. The success rate of our segmentation algorithm is 95%. In addition, our experimental results show that the accuracy of our classifier for human chromosomes is 92.63% and our novel post-processing algorithm increases the classification results to 94%. [ABSTRACT FROM AUTHOR]

Automatic and accurate segmentation of tumor area from rectal CT image plays an extremely key role in the treatment and diagnosis of rectal cancer. This paper proposes the MR-U-Net network model. The improvement is that a pair of encoder and decoder is added longitudinally to the U-shaped structure, which is the network structure of the fifth layer, and a residual module is added horizontally to the encoder and decoder of each layer. This model is used to conduct targeted research on the automatic segmentation method of rectal cancer. [H. Gao et al., Rectal tumor segmentation method based on U-Net improved model, J. Comput. Appl.40(8) (2020) 2392–2397] also improved U-Net and used the same dataset as this paper, but the Dice coefficient of all targets was only 83.15%, and the Dice coefficient of small targets was only 87.17%. This paper evaluates the improved MR-U-Net network model with the three indicators of precision, recall and Dice coefficient, and finds that in comparison to Ref. 4 the precision is 95.13%, 2.29% higher than the former work, recall is 94.28%, higher than the former work by 0.34%, Dice coefficient of all targets is 88.45%, increased by 5.3% compared with the former work, and the small targets Dice coefficient is increased by 1.28%, which is the best optimization state of this paper. Experiments show that for datasets with extremely skewed positive and negative samples, the MR-U-Net network structure after improving the hyperparameters in the optimizer can more accurately segment the rectal CT tumor lesion area. [ABSTRACT FROM AUTHOR]

Lazy random walks have been used in many scientific fields such as image segmentation and optimal transport; however, related theoretical results are much less for this dynamical process. In this paper, we study lazy random walks in a pseudofractal scale-free web, where the self-loop jumps on graph vertexes are considered. For a special random walks with one trap fixed at a hub node, also known as the trapping problem, we derive the exact analytic formulas of the average trapping time (ATT), an indicator measuring the efficiency of the trapping process, by using two different methods. The results obtained by the two methods are consistent. Analyzing and comparing the obtained solutions, we find that the ATT is related to the walking rule with the self-loop jumps. Specifically, adding the self-loop to change the walking rule can affect the coefficient of the ATT formula, but it cannot change the leading scaling of the trapping efficiency. We hope that these results in this paper can help us better understand the biased random walk process in complex systems. [ABSTRACT FROM AUTHOR]

Hardware/software partitioning is a typical multi-stage decision optimization problem; most existing hardware/software partitioning methods ignore a fact that real-life decisions are usually made in an uncertain state. We should model the hardware/software partitioning problem in uncertain environments and deal with uncertainty. The state-of-the-art work proposed an uncertainty conversion method for hardware/software partitioning, but this method does not include the equivalent deterministic model and is not suitable for dealing with different types of uncertainties. In order to cope with different situations with various uncertainties, we should apply uncertain programming to build a model in uncertain environments and give different equivalent deterministic models to convert different uncertainties theoretically. In this paper, we present the process of applying uncertain programming to solve the hardware/software partitioning problem, including the model and algorithm. We convert the uncertain programming model into its equivalent deterministic models, including the expected value model and the chance-constrained programming model; we give details for the conversion methods of these two models. We present the custom genetic algorithm to solve the converted model, by incorporating a greedy idea in two steps of the genetic algorithm. Experimental results show that the custom genetic algorithm can find a high-quality approximate solution while running much faster for large input scales, compared with the exact algorithm. [ABSTRACT FROM AUTHOR]

In this paper, an efficient interactive image segmentation method based on maximization of submodular function under user's scribble constraint is presented. The problem of interactive image segmentation is formulated as the maximum entropy rate under user's constraints. The objective function is submodular, and we solve the constrained submodular function maximization by incorporating a new data structure and some aggregating rules into the greedy algorithm. The main steps of our algorithm are as follows. First, the pixels scribbled by the user are clustered separately as target foreground and background clusters. Second, in the process of greedy algorithm, unscribbled pixels are aggregated to the corresponding target cluster according to the proposed aggregating rules. Finally, the segmentation result is presented by the two target clusters. The experiments and comparisons on three standard benchmarks show that our method has good performance. Our method is straightforward and efficient, and the time complexity of our method is between linear and polynomial. Furthermore, we analyze the influence of different scribbles, and propose some optimal scribble strategies. [ABSTRACT FROM AUTHOR]

An irregular growth in brain cells causes brain tumors. In recent years, a considerable rate of increment in medical cases regarding brain tumors has been observed, affecting adults and children. However, it is highly curable in recent times only if detected in the early time of tumor growth. Moreover, there are many sophisticated approaches devised by researchers for predicting the tumor regions and their stages. In addition, Magnetic Resonance Imaging (MRI) is utilized commonly by radiologists to evaluate tumors. In this paper, the input image is from a database, and brain tumor segmentation is performed using various segmentation techniques. Here, the comparative analysis is performed by comparing the performance of segmentation approaches, like Hybrid Active Contour (HAC) model, Bayesian Fuzzy Clustering (BFC), Active Contour (AC), Fuzzy C-Means (FCM) clustering technique, Sparse (Sparse FCM), and Black Hole Entropy Fuzzy Clustering (BHEFC) model. Moreover, segmentation technique performance is evaluated with the Dice coefficient, Jaccard coefficient, and segmentation accuracy. The proposed method shows high Dice and Jaccard coefficients of 0.7809 and 0.6456 by varying iteration with the REMBRANDT dataset and a better segmentation accuracy of 0.9789 by changing image size in the Brats-2015 database. [ABSTRACT FROM AUTHOR]

Generation of random fields (GRF) for image segmentation represents partitioning an image into different regions that are homogeneous or have similar facets of the image. It is one of the most challenging tasks in image processing and a very important pre-processing step in the fields of computer vision, image analysis, medical image processing, pattern recognition, remote sensing, and geographical information system. Many researchers have presented numerous image segmentation approaches, but still, there are challenges like segmentation of low contrast images, removal of shadow in the images, reduction of high dimensional images, and computational complexity of segmentation techniques. In this review paper, the authors address these issues. The experiments are conducted and tested on the Berkely dataset (BSD500), Semantic dataset, and our own dataset, and the results are shown in the form of tables and graphs. [ABSTRACT FROM AUTHOR]

Lung cancer is a severe disease, which causes high deaths in the world. Earlier discovery of lung cancer is useful to enhance the rate of survival in patients. Computed Tomography (CT) is utilized for determining the tumor and identifying the cancer level in the body. However, the issues of CT images cause less tumor visibility areas and unconstructive rates in tumor regions. This paper devises an optimization-driven technique for classifying lung cancer. The CT image is utilized for determining the position of the tumor. Here, the CT image undergoes segmentation, which is performed using the DeepJoint model. Furthermore, the feature extraction is carried out, wherein features such as local ternary pattern-based features, Histogram of Gradients (HoG) features, and statistical features, like variance, mean, kurtosis, energy, entropy, and skewness. The categorization of lung cancer is performed using Hierarchical Attention Network (HAN). The training of HAN is carried out using proposed Firefly Competitive Swarm Optimization (FCSO), which is devised by combining firefly algorithm (FA), and Competitive Swarm Optimization (CSO). The proposed FCSO-based HAN provided effective performance with high accuracy of 91.3%, sensitivity of 88%, and specificity of 89.1%. [ABSTRACT FROM AUTHOR]

In the medical image-processing field brain tumor segmentation is aquintessential task. Thereby early diagnosis gives us a chance of increasing survival rate. It will be way much complex and time consuming when comes to processing large amount of MRI images manually, so for that we need an automatic way of brain tumor image segmentation process. This paper aims to gives a comparative study of brain tumor segmentation, which are MRI-based. So recent methods of automatic segmentation along with advanced techniques gives us an improved result and can solve issue better than any other methods. Therefore, this paper brings comparative analysis of three models such as Deformable model of Fuzzy C-Mean clustering (DMFCM), Adaptive Cluster with Super Pixel Segmentation (ACSP) and Grey Wolf Optimization based ACSP (GWO_ACSP) and these are tested on CANCER IMAGE ACHRCHIEVE which is a preparation information base containing High Grade and Low-Grade astrocytoma tumors. Here boundaries including Accuracy, Dice coefficient, Jaccard score and MCC are assessed and along these lines produce the outcomes. From this examination the test consequences of Grey Wolf Optimization based ACSP (GWO_ACSP) gives better answer for mind tumor division issue. [ABSTRACT FROM AUTHOR]

This paper constructs a low-resolution model for face recognition and sports training actions based on wireless sensors. The model obtains the distribution of the information size in the face image by calculating the image entropy value, and assigns different weights according to the size of the information to perform face recognition calculation, so that the original module-based algorithm is simply based on image segmentation into one based on entropy. The size of the value is divided into blocks, which solves the problem of computational quantification of category information. In the test stage, the traditional orthogonal matching pursuit algorithm is used to solve the coding coefficients, and the excellent classification and recognition results are obtained by calculating the intra-class matrix of the face image and the inter-class matrix of the sports training action image. Methods that perform well on classification problems further improve face recognition rates. The specific processing process is to add Gaussian noise, salt and pepper noise to the input face image and reduce the size of the face image in the input image, so that the improved algorithms are improved. The experimental results show that the high-efficiency resolution sensing technology is used to learn the sports training actions corresponding to the two modalities, and the matrix coefficient between the obtained high-resolution modal and low-resolution modal images reaches 0.971, and the iteration rate is improved by 71.5%, effectively promoting the high recognition rate of faces and actions. [ABSTRACT FROM AUTHOR]

Lung tumor detection using computer-aided modeling improves the accuracy of detection and clinical recommendation precision. An optimal tumor detection requires noise reduced computed tomography (CT) images for pixel classification. In this paper, the butterfly optimization algorithm-based K -means clustering (BOAKMC) method is introduced for reducing CT image segmentation uncertainty. The introduced method detects the overlapping features for optimal edge classification. The best-fit features are first trained and verified for their similarity. The clustering process recurrently groups the feature matched pixels into clusters and updates the centroid based on further classifications. In this classification process, the uncertain pixels are identified and mitigated in the tumor detection analysis. The best-fit features are used to train local search instances in the BOA process, which influences the similar pixel grouping in the uncertainty detection process. The proposed BOAKMC improves accuracy and precision by 10.2% and 13.39% and reduces classification failure and time by 11.29% and 11.52%, respectively. [ABSTRACT FROM AUTHOR]

Due to the haze weather, the outdoor image quality is degraded, which reduces the image contrast, thereby reducing the efficiency of computer vision systems such as target recognition. There are two aspects of the traditional algorithm based on the principle of dark channel to be improved. First, the restored images obviously contain color distortion in the sky region. Second, the white regions in the scene easily affect the atmospheric light estimated. To solve the above problems, this paper proposes a single-image dehazing and image segmentation method via dark channel prior (DCP) and adaptive threshold. The sky region of hazing image is relatively bright, so sky region does not meet the DCP. The sky part is separated by the adaptive threshold, then the scenery and the sky area are dehazed, respectively. In order to avoid the interference caused by white objects to the estimation of atmospheric light, we estimate the value of atmospheric light using the separated area of the sky. The algorithm in this paper makes up for the shortcoming that the algorithm based on the DCP cannot effectively process the hazing image with sky region, avoiding the effect of white objects on estimating atmospheric light. Experimental results show the feasibility and effectiveness of the improved algorithm. [ABSTRACT FROM AUTHOR]

Lung cancer is an aggressive disease among all cancer-based diseases, because of causing huge mortality in humans. Thus, earlier discovery is a basic task for diagnosing lung cancer and it helps increase the survival rate. Computed tomography (CT) is a powerful imaging technique used to discover lung cancer. However, it is time-consuming for examining each CT image. This paper develops an optimized deep model for classifying the lung nodules. Here, the pre-processing is done using Region of Interest (ROI) extraction and adaptive Wiener filter. The segmentation is done using the DeepJoint model wherein distance is computed with a congruence coefficient for extracting the segments. The nodule identification is done by a grid-based scheme. The features such as Global Binary Pattern (GBP), Texton features, statistical features, perimeter and area, barycenter difference, number of slices, short axis and long axis and volume are considered. The lung nodule classification is done to classify part solid, solid nodules and ground-glass opacity (GGO) using Deep Residual Network (DRN), which is trained by the proposed Shuffled Shepard Sine–Cosine Algorithm (SSSCA). The developed SSSCA is generated by the integration of the Sine–Cosine Algorithm (SCA) and Shuffled Shepard Optimization Algorithm (SSOA). The proposed SSSCA-based DRN outperformed with the highest testing accuracy of 92.5%, sensitivity of 93.2%, specificity of 83.7% and F 1 -score of 81.5%. [ABSTRACT FROM AUTHOR]

The traditional embroidery identification technology cannot present the target image of the art network in a more comprehensive and three-dimensional manner. A research on the segmentation and synthesis of embroidery art images based on deep learning convolutional neural network is proposed. Based on the semantic image segmentation technology of deep learning, this paper analyzes the embroidery semantic image segmentation technology, obtains the information of image technology, analyzes the embroidery rendering technology of convolutional neural networks, and puts forward the embroidery rendering algorithm. In order to verify the effectiveness of the algorithm, a simulation test experiment was carried out on the target content image and the embroidery art network image. The test results show that compared with the traditional method, this method has more specific and flexible image generation, stronger three-dimensional sense, closer to the real art embroidery network, and the direction of its needlework is also more hierarchical. [ABSTRACT FROM AUTHOR]

Subspace clustering aims to seek a multi-subspace representation that is best suitable for data points taken from a high-dimensional space. Sparse representation and low-rank approximation-based methods have become one of the main melodies for subspace clustering. In the existing methods, nuclear norm is used to approximate rank minimization. However, the common deficiency still exists for nuclear norm, which always over-penalizes large singular values and results in a biased solution. In this paper, we propose a nonlinear subspace clustering model that exploits sparsity and low-rank of data in high dimensional feature space by using Schatten-p norm surrogate (p ∈ (0 , 1)) with learned low-rank kernel. By this manner, the model guarantees that the data mapped in the high-dimensional feature spaces is lower rank and self-expressive. And we show the alternating direction method of multipliers (abbreviated as ADMM) for the corresponding problem in a reproducing kernel Hilbert space. Various experiments on motion segmentation and image clustering display that the proposed model has potentiality in outperforming most of state-of-the-art models in current literature. [ABSTRACT FROM AUTHOR]

Clustering consists of various applications on machine learning, image segmentation, data mining and pattern recognition. The proper selection of clustering is significant in feature selection. Therefore, in this paper, a Text Feature Selection (FS) and Clustering using Grasshopper–Chameleon Swarm Optimization with Density Peaks Clustering algorithm (TFSC-G-CSOA-DPCA) is proposed. Initially, the input features are pre-processed for converting text into numerical form. These preprocessed text features are given to Grasshopper–Chameleon Swarm Optimization Algorithm, which selects important text features. In Grasshopper–Chameleon Swarm Optimization Algorithm, the Grasshopper Optimization Algorithm selects local feature from text document and Chameleon Swarm Optimization Algorithm selects the best global feature from local feature. These important features are tested using density peaks clustering algorithm to maximize the reliability and minimize the computational time cost. The performance of Grasshopper–Chameleon Swarm Optimization Algorithm is analyzed with 20 News groups dataset. Moreover, the performance metrics, like accuracy, precision, sensitivity, specificity, execution time and memory usage are analyzed. The simulation process shows that the proposed TFSC-G-CSOA-DPCA method provides better accuracy of 97.36%, 95.14%, 94.67% and 91.91% and maximum sensitivity of 96.25%, 87.25%, 93.96% and 92.59% compared to the existing methods such as TFSC-BBA-MCL, TFSC-MVO-K-Means C, TFSC-GWO-GOA-FCM and TFSC-WM-K-Means C, respectively. [ABSTRACT FROM AUTHOR]

A practical problem in supervised deep learning for medical image segmentation is the lack of labeled data which is expensive and time-consuming to acquire. In contrast, there is a considerable amount of unlabeled data available in the clinic. To make better use of the unlabeled data and improve the generalization on limited labeled data, in this paper, a novel semi-supervised segmentation method via multi-task curriculum learning is presented. Here, curriculum learning means that when training the network, simpler knowledge is preferentially learned to assist the learning of more difficult knowledge. Concretely, our framework consists of a main segmentation task and two auxiliary tasks, i.e. the feature regression task and target detection task. The two auxiliary tasks predict some relatively simpler image-level attributes and bounding boxes as the pseudo labels for the main segmentation task, enforcing the pixel-level segmentation result to match the distribution of these pseudo labels. In addition, to solve the problem of class imbalance in the images, a bounding-box-based attention (BBA) module is embedded, enabling the segmentation network to concern more about the target region rather than the background. Furthermore, to alleviate the adverse effects caused by the possible deviation of pseudo labels, error tolerance mechanisms are also adopted in the auxiliary tasks, including inequality constraint and bounding-box amplification. Our method is validated on ACDC2017 and PROMISE12 datasets. Experimental results demonstrate that compared with the full supervision method and state-of-the-art semi-supervised methods, our method yields a much better segmentation performance on a small labeled dataset. Code is available at https://github.com/DeepMedLab/MTCL. [ABSTRACT FROM AUTHOR]

Breast tumor is one of the causes of women's death in the world after cardiovascular diseases. Recently, the diagnosis and treatment planning of this kind of tumors are based on magnetic resonance imaging techniques, which are the reference imaging modality in breast tumors analysis since it can better differentiate soft tissues (compared to mammography and ultrasound). Segmentation of the breast cancer is a very important task for cancer response prediction in neoadjuvant chemotherapy treatment based either on texture analysis or parametric response maps. In most of the previous works in the literature, the segmentation is generally done with manual annotation of tumor regions, which is time-consuming and error-prone. In this paper, we propose a new strategy for an automatic segmentation of breast tumors in MRI images. We propose first to separate the two breasts, and then, we use the Expectation–Maximization Algorithm to segment and detect the tumor lesion. [ABSTRACT FROM AUTHOR]