Infrared Ship Target Segmentation Based on Spatial Information Improved FCM

A lightweight CNN for multi-source infrared ship detection from unmanned marine vehicles

Infrared ship detection is of great significance due to its broad applicability in maritime surveillance, traffic safety and security. Multiple infrared sensors with different spectral sensitivity provide enhanced sensing capabilities, facilitating ship detection in complex environments. Nevertheless, current researches lack discussion and exploration of infrared imagers in different spectral ranges for marine objects detection. Furthermore, for unmanned marine vehicles (UMVs), e.g., unmanned surface vehicles (USVs) and unmanned ship (USs), detection and perception are usually performed in embedded devices with limited memory and computation resource, which makes traditional convolutional neural network (CNN)-based detection methods struggle to leverage their advantages. Aimed at the task of sea surface object detection on USVs, this paper provides lightweight CNNs with high inference speed that can be deployed on embedded devices. It also discusses the advantages and disadvantages of using different sensors in marine object detection, providing a reference for the perception and decision-making modules of USVs. The proposed method can detect ships in short-wave infrared (SWIR), long-wave infrared (LWIR) and fused images with high-performance and high-inference speed on an embedded device. Specifically, the backbone is built from bottleneck depth-separable convolution with residuals. Generating redundant feature maps by using cheap linear operation in neck and head networks. The learning and representation capacities of the network are promoted by introducing the channel and spatial attention, redesigning the sizes of anchor boxes. Comparative experiments are conducted on the infrared ship dataset that we have released which contains SWIR, LWIR and the fused images. The results indicate that the proposed method can achieve high accuracy but with fewer parameters, and the inference speed is nearly 60 frames per second (FPS) on an embedded device.

Fuzzy Sparse Subspace Clustering for Infrared Image Segmentation

Infrared image segmentation is a challenging task, due to interference of complex background and appearance inhomogeneity of foreground objects. A critical defect of fuzzy clustering for infrared image segmentation is that the method treats image pixels or fragments in isolation. In this paper, we propose to adopt self-representation from sparse subspace clustering in fuzzy clustering, aiming to introduce global correlation information into fuzzy clustering. Meanwhile, to apply sparse subspace clustering for non-linear samples from an infrared image, we leverage membership from fuzzy clustering to improve conventional sparse subspace clustering. The contributions of this paper are fourfold. First, by introducing self-representation coefficients modeled in sparse subspace clustering based on high-dimensional features, fuzzy clustering is capable of utilizing global information to resist complex background as well as intensity inhomogeneity of objects, so as to improve clustering accuracy. Second, fuzzy membership is tactfully exploited in the sparse subspace clustering framework. Thereby, the bottleneck of conventional sparse subspace clustering methods, that they could be barely applied to nonlinear samples, can be surmounted. Third, as we integrate fuzzy clustering and subspace clustering in a unified framework, features from two different aspects are employed, contributing to precise clustering results. Finally, we further incorporate neighbor information into clustering, thus effectively solving the uneven intensity problem in infrared image segmentation. Experiments examine the feasibility of proposed methods on various infrared images. Segmentation results demonstrate the effectiveness and efficiency of the proposed methods, which proves the superiority compared to other fuzzy clustering methods and sparse space clustering methods.

WaSR-A Water Segmentation and Refinement Maritime Obstacle Detection Network

Obstacle detection using semantic segmentation has become an established approach in autonomous vehicles. However, existing segmentation methods, primarily developed for ground vehicles, are inadequate in an aquatic environment as they produce many false positive (FP) detections in the presence of water reflections and wakes. We propose a novel deep encoder-decoder architecture, a water segmentation and refinement (WaSR) network, specifically designed for the marine environment to address these issues. A deep encoder based on ResNet101 with atrous convolutions enables the extraction of rich visual features, while a novel decoder gradually fuses them with inertial information from the inertial measurement unit (IMU). The inertial information greatly improves the segmentation accuracy of the water component in the presence of visual ambiguities, such as fog on the horizon. Furthermore, a novel loss function for semantic separation is proposed to enforce the separation of different semantic components to increase the robustness of the segmentation. We investigate different loss variants and observe a significant reduction in FPs and an increase in true positives (TPs). Experimental results show that WaSR outperforms the current state of the art by approximately 4% in F1 score on a challenging unmanned surface vehicle dataset. WaSR shows remarkable generalization capabilities and outperforms the state of the art by over 24% in F1 score on a strict domain generalization experiment.

Learning with Weak Annotations for Robust Maritime Obstacle Detection

Robust maritime obstacle detection is critical for safe navigation of autonomous boats and timely collision avoidance. The current state-of-the-art is based on deep segmentation networks trained on large datasets. However, per-pixel ground truth labeling of such datasets is labor-intensive and expensive. We propose a new scaffolding learning regime (SLR) that leverages weak annotations consisting of water edges, the horizon location, and obstacle bounding boxes to train segmentation-based obstacle detection networks, thereby reducing the required ground truth labeling effort by a factor of twenty. SLR trains an initial model from weak annotations and then alternates between re-estimating the segmentation pseudo-labels and improving the network parameters. Experiments show that maritime obstacle segmentation networks trained using SLR on weak annotations not only match but outperform the same networks trained with dense ground truth labels, which is a remarkable result. In addition to the increased accuracy, SLR also increases domain generalization and can be used for domain adaptation with a low manual annotation load. The SLR code and pre-trained models are freely available online.

A Novel Interval Type-2 Fuzzy System Identification Method Based on the Modified Fuzzy C-Regression Model

In this article, a novel interval type-2 Takagi-Sugeno fuzzy c -regression modeling method with a modified distance definition is proposed. The modified distance definition is developed to describe the distance between each data point and the local type-2 fuzzy model. To improve the robustness of the proposed identification method, a modified objective function is presented. In addition, different from most previous studies that require numerous free parameters to be determined, an interval type-2 fuzzy c -regression model is developed to reduce the number of such free parameters. Furthermore, an improved ratio between the upper and lower weights is proposed based on the upper and lower membership function with each input data, and the ordinary least-squares method is adopted to establish the type-2 fuzzy model. The Box-Jenkins model and two numerical models are given to illustrate the effectiveness and robustness of the proposed results.

Improved FCM algorithm for fisheye image cluster analysis for tree height calculation

The height of standing trees is an important index in forestry research. This index is not only hard to measure directly but also the environmental factors increase the measurement difficulty. Therefore, the measurement of the height of standing trees is always a problem that experts and scholars are trying to improve. In this study, improve fuzzy c-means algorithm to reduce the calculation time and improve the clustering effect, used on this image segmentation technology, a highly robust non-contact measuring method for the height of standing trees was proposed which is based on a smartphone with a fisheye lens. While ensuring the measurement accuracy, the measurement stability is improved. This method is simple to operate, just need to take a picture of the standing tree and determine the shooting distance to complete the measurement. The purpose of the fisheye lens is to ensure that the tree remains intact in the photograph and to reduce the shooting distance. The results of different stability experiments show that the measurement error ranged from -0.196m to 0.195m, and the highest relative error of tree measurement was 3.05%, and the average relative error was 1.45%. Analysis shows that compared with previous research, this method performs better at all stages. The proposed approach can provide a new way to obtain tree height, which can be used to analyze growing status and change in contrast height because of high accuracy and permanent preservation of images.

Intuitionistic Fuzzy C-Means Algorithm Based on Membership Information Transfer-Ring and Similarity Measurement

The fuzzy C-means clustering (FCM) algorithm is used widely in medical image segmentation and suitable for segmenting brain tumors. Therefore, an intuitionistic fuzzy C-means algorithm based on membership information transferring and similarity measurements (IFCM-MS) is proposed to segment brain tumor magnetic resonance images (MRI) in this paper. The original FCM lacks spatial information, which leads to a high noise sensitivity. To address this issue, the membership information transfer model is adopted to the IFCM-MS. Specifically, neighborhood information and the similarity of adjacent iterations are incorporated into the clustering process. Besides, FCM uses simple distance measurements to calculate the membership degree, which causes an unsatisfactory result. So, a similarity measurement method is designed in the IFCM-MS to improve the membership calculation, in which gray information and distance information are fused adaptively. In addition, the complex structure of the brain results in MRIs with uncertainty boundary tissues. To overcome this problem, an intuitive fuzzy attribute is embedded into the IFCM-MS. Experiments performed on real brain tumor images demonstrate that our IFCM-MS has low noise sensitivity and high segmentation accuracy.

Wavelet Frame-Based Fuzzy C-Means Clustering for Segmenting Images on Graphs

In recent years, image processing in a Euclidean domain has been well studied. Practical problems in computer vision and geometric modeling involve image data defined in irregular domains, which can be modeled by huge graphs. In this paper, a wavelet frame-based fuzzy C -means (FCM) algorithm for segmenting images on graphs is presented. To enhance its robustness, images on graphs are first filtered by using spatial information. Since a real image usually exhibits sparse approximation under a tight wavelet frame system, feature spaces of images on graphs can be obtained. Combining the original and filtered feature sets, this paper uses the FCM algorithm for segmentation of images on graphs contaminated by noise of different intensities. Finally, some supporting numerical experiments and comparison with other FCM-related algorithms are provided. Experimental results reported for synthetic and real images on graphs demonstrate that the proposed algorithm is effective and efficient, and has a better ability for segmentation of images on graphs than other improved FCM algorithms existing in the literature. The approach can effectively remove noise and retain feature details of images on graphs. It offers a new avenue for segmenting images in irregular domains.

BRAIN TUMOR SEGMENTATION BASED ON SUPERPIXELS AND HYBRID CLUSTERING WITH FAST GUIDED FILTER

Brain tumor segmentation from magnetic resonance (MR) image is vital for both the diagnosis and treatment of brain cancers. To alleviate noise sensitivity and improve stability of segmentation, an effective hybrid clustering algorithm combined with fast guided filter is proposed for brain tumor segmentation in this paper. Preprocessing is performed using adaptive Wiener filtering combined with a fast guided filter. Then simple linear iterative clustering (SLIC) is utilized for pre-segmentation to effectively remove scatter. During the clustering, K-means[Formula: see text] and Gaussian kernel-based fuzzy C-means (K[Formula: see text]GKFCM) clustering algorithm are combined to segment, and the fast-guided filter is introduced into the clustering. The proposed algorithm not only improves the robustness of the algorithm to noise, but also improves the stability of the segmentation. In addition, the proposed algorithm is compared with other current segmentation algorithms. The results show that the proposed algorithm performs better in terms of accuracy, sensitivity, specificity and recall.

Thermal Infrared Pedestrian Segmentation Based on Conditional GAN

A novel thermal infrared pedestrian segmentation algorithm based on conditional generative adversarial network (IPS-cGAN) is proposed for intelligent vehicular applications. The convolution backbone architecture of the generator is based on the improved U-Net with residual blocks for well utilizing regional semantic information. Moreover, cross entropy loss for segmentation is introduced as the condition for the generator. SandwichNet, a novel convolutional network with symmetrical input, is proposed as the discriminator for real-fake segmented images. Based on the c-GAN framework, good segmentation performance could be achieved for thermal infrared pedestrians. Compared to some supervised and unsupervised segmentation algorithms, the proposed algorithm achieves higher accuracy with better robustness, especially for complex scenes.

Infrared Small-Faint Target Detection Using Non-i.i.d. Mixture of Gaussians and Flux Density

The robustness of infrared small-faint target detection methods to noisy situations has been a challenging and meaningful research spot. The targets are usually spatially small due to the far observation distance. Considering the underlying assumption of noise distribution in the existing methods is impractical; a state-of-the-art method has been developed to dig out valuable information in the temporal domain and separate small-faint targets from background noise. However, there are still two drawbacks: (1) The mixture of Gaussians (MoG) model assumes that noise of different frames satisfies independent and identical distribution (i.i.d.); (2) the assumption of Markov random field (MRF) would fail in more complex noise scenarios. In real scenarios, the noise is actually more complicated than the MoG model. To address this problem, a method using the non-i.i.d. mixture of Gaussians (NMoG) with modified flux density (MFD) is proposed in this paper. We firstly construct a novel data structure containing spatial and temporal information with an infrared image sequence. Then, we use an NMoG model to describe the noise, which can be separated with the background via the variational Bayes algorithm. Finally, we can select the component containing true targets through the obvious difference of target and noise in an MFD maple. Extensive experiments demonstrate that the proposed method performs better in complicated noisy scenarios than the competitive approaches.

Thermal Infrared Small Ship Detection in Sea Clutter Based on Morphological Reconstruction and Multi-Feature Analysis

The existing thermal infrared (TIR) ship detection methods may suffer serious performance degradation in the situation of heavy sea clutter. To cope with this problem, a novel ship detection method based on morphological reconstruction and multi-feature analysis is proposed in this paper. Firstly, the TIR image is processed by opening- or closing-based gray-level morphological reconstruction (GMR) to smooth intricate background clutter while maintaining the intensity, shape, and contour features of ship target. Then, considering the intensity and contrast features, the fused saliency detection strategy including intensity foreground saliency map (IFSM) and brightness contrast saliency map (BCSM) is presented to highlight potential ship targets and suppress sea clutter. After that, an effective contour descriptor namely average eigenvalue measure of structure tensor (STAEM) is designed to characterize candidate ship targets, and the statistical shape knowledge is introduced to identify true ship targets from residual non-ship targets. Finally, the dual method is adopted to simultaneously detect both bright and dark ship targets in TIR image. Extensive experiments show that the proposed method outperforms the compared state-of-the-art methods, especially for infrared images with intricate sea clutter. Moreover, the proposed method can work stably for ship target with unknown brightness, variable quantities, sizes, and shapes.

Detection of Small Target Using Schatten 1/2 Quasi-Norm Regularization with Reweighted Sparse Enhancement in Complex Infrared Scenes

In uniform infrared scenes with single sparse high-contrast small targets, most existing small target detection algorithms perform well. However, when encountering multiple and/or structurally sparse targets in complex backgrounds, these methods potentially lead to high missing and false alarm rate. In this paper, a novel and robust infrared single-frame small target detection is proposed via an effective integration of Schatten 1/2 quasi-norm regularization and reweighted sparse enhancement (RS1/2NIPI). Initially, to achieve a tighter approximation to the original low-rank regularized assumption, a nonconvex low-rank regularizer termed as Schatten 1/2 quasi-norm (S1/2N) is utilized to replace the traditional convex-relaxed nuclear norm. Then, a reweighted l1 norm with adaptive penalty serving as sparse enhancement strategy is employed in our model for suppressing non-target residuals. Finally, the small target detection task is reformulated as a problem of nonconvex low-rank matrix recovery with sparse reweighting. The resulted model falls into the workable scope of inexact augment Lagrangian algorithm, in which the S1/2N minimization subproblem can be efficiently solved by the designed softening half-thresholding operator. Extensive experimental results on several real infrared scene datasets validate the superiority of the proposed method over the state-of-the-arts with respect to background interference suppression and target extraction.

Similarity Measure-Based Possibilistic FCM With Label Information for Brain MRI Segmentation

Magnetic resonance imaging (MRI) is extensively applied in clinical practice. Segmentation of the MRI brain image is significant to the detection of brain abnormalities. However, owing to the coexistence of intensity inhomogeneity and noise, dividing the MRI brain image into different clusters precisely has become an arduous task. In this paper, an improved possibilistic fuzzy c -means (FCM) method based on a similarity measure is proposed to improve the segmentation performance for MRI brain images. By introducing the new similarity measure, the proposed method is more effective for clustering the data with nonspherical distribution. Besides that, the new similarity measure could alleviate the "cluster-size sensitivity" problem that most FCM-based methods suffer from. Simultaneously, the proposed method could preserve image details as well as suppress image noises via the use of local label information. Experiments conducted on both synthetic and clinical images show that the proposed method is very effective, providing mitigation to the cluster-size sensitivity problem, resistance to noisy images, and applicability to data with more complex distribution.

Brain Tumor Segmentation Based on Hybrid Clustering and Morphological Operations

Inference of tumor and edema areas from brain magnetic resonance imaging (MRI) data remains challenging owing to the complex structure of brain tumors, blurred boundaries, and external factors such as noise. To alleviate noise sensitivity and improve the stability of segmentation, an effective hybrid clustering algorithm combined with morphological operations is proposed for segmenting brain tumors in this paper. The main contributions of the paper are as follows: firstly, adaptive Wiener filtering is utilized for denoising, and morphological operations are used for removing nonbrain tissue, effectively reducing the method's sensitivity to noise. Secondly, K-means++ clustering is combined with the Gaussian kernel-based fuzzy C-means algorithm to segment images. This clustering not only improves the algorithm's stability, but also reduces the sensitivity of clustering parameters. Finally, the extracted tumor images are postprocessed using morphological operations and median filtering to obtain accurate representations of brain tumors. In addition, the proposed algorithm was compared with other current segmentation algorithms. The results show that the proposed algorithm performs better in terms of accuracy, sensitivity, specificity, and recall.