Unsupervised Segmentation Algorithm Research Articles

Unsupervised domain adaptive segmentation algorithm based on two-level category alignment

To enhance the model’s generalization ability in unsupervised domain adaptive segmentation tasks, most approaches have primarily focused on pixel-level local features, but neglected the clue in category information. This limitation results in the segmentation network only learning global inter-domain invariant features but ignoring the category-specific inter-domain invariant features, which degenerates the segmentation performance. To address this issue, we present an Unsupervised Domain Adaptive algorithm based on two-level Category Alignment in two different spaces for semantic segmentation tasks, denoted as UDAca+. The first level is image-level category alignment based on class activation map (CAM), and the second one is pixel-level category alignment based on pseudo label. By utilizing category information, UDAca+ can effectively capture domain-invariant yet category-discriminative feature representations to improve segmentation accuracy. In addition, an adversarial learning-based strategy in mixed domain is designed to train the proposed network. Moreover, a confidence calculation method is introduced to mitigate the misleading issues of negative transfer and over-alignment caused by the noise in image-level pseudo labels. UDAca+ achieves the state-of-the-art (SOTA) performance on two synthetic-to-real adaptative tasks, and verifies its effectiveness for image segmentation.

Joint learning framework of superpixel generation and fuzzy sparse subspace clustering for color image segmentation

Sparse subspace clustering (SSC) is an important image segmentation method that constructs a self-representation coefficient matrix to represent the relationships between pixels, and then uses spectral clustering to achieve clustering. Compared with other unsupervised segmentation algorithms, SSC has good segmentation performance. However, SSC has a high computational complexity when processing large-sized image. To improve computational efficiency, many researchers have proposed superpixel-based SSC algorithms, which process superpixels instead of pixels and improve efficiency through preprocessing. Due to the sensitivity of superpixel generation to noise, superpixel-based SSC algorithms still have poor robustness. Additionally, preprocessing increases the complexity of the algorithm. To address these issues, this paper proposes a robust superpixel-based fuzzy sparse subspace clustering algorithm. This algorithm combines fuzzy sparse subspace clustering with superpixel generation, and it constructs a unified optimization learning framework through fuzzy C-multiple-means clustering to improve segmentation performance and reduce complexity. Additionally, this paper introduces additional features of superpixel in sparse subspace clustering to further enhance the segmentation performance of the algorithm. Experiment results indicate that the proposed algorithm not only outperforms existing state-of-the-art robust segmentation algorithms independent of superpixels, but also is superior to the latest superpixel-based segmentation algorithms.

Few Shot Part Segmentation Reveals Compositional Logic for Industrial Anomaly Detection

Logical anomalies (LA) refer to data violating underlying logical constraints e.g., the quantity, arrangement, or composition of components within an image. Detecting accurately such anomalies requires models to reason about various component types through segmentation. However, curation of pixel-level annotations for semantic segmentation is both time-consuming and expensive. Although there are some prior few-shot or unsupervised co-part segmentation algorithms, they often fail on images with industrial object. These images have components with similar textures and shapes, and a precise differentiation proves challenging. In this study, we introduce a novel component segmentation model for LA detection that leverages a few labeled samples and unlabeled images sharing logical constraints. To ensure consistent segmentation across unlabeled images, we employ a histogram matching loss in conjunction with an entropy loss. As segmentation predictions play a crucial role, we propose to enhance both local and global sample validity detection by capturing key aspects from visual semantics via three memory banks: class histograms, component composition embeddings and patch-level representations. For effective LA detection, we propose an adaptive scaling strategy to standardize anomaly scores from different memory banks in inference. Extensive experiments on the public benchmark MVTec LOCO AD reveal our method achieves 98.1% AUROC in LA detection vs. 89.6% from competing methods.

Ensemble CART surrogate-assisted automatic multi-objective rough fuzzy clustering algorithm for unsupervised image segmentation

Multi-objective clustering algorithms (MOCAs) are popular in unsupervised image segmentation due to their merit of meeting multiple segmentation requirements and the prospect of automatically estimating the number of clusters. However, most of them suffer from high time costs and are easily to be influenced by the uncertainty when handling real complex images. To address these issues, we propose an ensemble classification and regression tree (CART) surrogate-assisted automatic multi-objective rough fuzzy clustering (ECS-AMRFC) algorithm for unsupervised image segmentation. Firstly, a cluster medoid-based encoding scheme is employed to represent solutions with different number of clusters and meanwhile lessen the length of encoding. Then, we design an ensemble CART as the surrogate model to significantly reduce the computational burden. Moreover, a surrogate model management strategy is proposed to accelerate the optimization and enhance the quality of surrogate modeling. To handle the uncertainty in data, we extend the rough fuzzy clustering into MOCAs and construct three complementary objective functions to seek proper cluster medoids from multiple perspectives. In addition, the Gaussian kernel is introduced into the objective functions to handle image pixels that cannot separate linearly in the feature space. Finally, a kernelized rough fuzzy clustering validity index is defined to automatically select the optimal solution with no requirements of any prior knowledge. Experiments show that ECS-AMRFC not only identifies appropriate number of clusters on different kinds of images, but also obtains better segmentation results than state-of-the-art rough fuzzy clustering algorithms and automatic MOCAs.

Changepoint detection-assisted nonparametric clustering for unsupervised temporal sign segmentation

Temporal sign segmentation aims to temporarily divide continuous sign language into category-agnostic sign segments. One of the challenges to temporal sign segmentation is the paucity of frame-level annotations for sign language videos, which restricts the applicability of supervised and semi-supervised approaches. To address this challenge, we consider temporal sign segmentation as a clustering problem defined as the grouping of semantically similar frames of a given video, which allows us to choose unsupervised clustering techniques as promising alternatives. However, most unsupervised clustering techniques are parametric. In the context of temporal sign segmentation, they assume that the number of sign segments of a given continuous sign video is predefined, which is implausible. The primary contributions of this study are as follows: (1) We propose the first nonparametric clustering algorithm for unsupervised temporal sign segmentation. The main concept is to enhance the hierarchical graph-based clustering algorithm to be nonparametric by adopting cost and penalty functions of a changepoint detection algorithm to determine the optimal number of sign segments. Experimental results show that the performance of the proposed unsupervised method is comparable to that of the latest semi-supervised sign segmentation method in terms of several metrics. Moreover, the execution time of the proposed clustering method was less than 1 s, thereby ensuring its applicability. (2) We identify that the conventional metrics for temporal sign segmentation do not sufficiently address over-segmentation. To overcome the difficulty, we propose a new main metric to evaluate the performance of temporal sign segmentation, called the adjusted MF1B.

Unsupervised leaf segmentation in complex backgrounds using mutual information minimization

Leaf segmentation is crucial for plant recognition, especially for tree species identification. In natural environments, leaf segmentation can be very challenging due to the lack of prior information about leaves and the variability of backgrounds. In typical applications, supervised algorithms often require pixel-level annotation of regions, which can be labour-intensive and limited to identifying plant species using pre-labelled samples. On the other hand, traditional unsupervised image segmentation algorithms require specialised parameter tuning for leaf images to achieve optimal results. Therefore, this paper proposes an unsupervised leaf segmentation method that combines mutual information with neural networks to better generalise to unknown samples and adapt to variations in leaf shape and appearance to distinguish and identify different tree species. First, a model combining a Variational Autoencoder (VAE) and a segmentation network is used as a pre-segmenter to obtain dynamic masks. Secondly, the dynamic masks are combined with the segmentation masks generated by the mask generator module to construct the initial mask. Then, the patcher module uses the Mutual Information Minimum (MIM) loss as an optimisation objective to reconstruct independent regions based on this initial mask. The process of obtaining dynamic masks through pre-segmentation is unsupervised, and the entire experimental process does not involve any label information. The experimental method was performed on tree leaf images with a naturally complex background using the publicly available Pl@ntLeaves dataset. The results of the experiment showed that compared to existing excellent methods on this dataset, the IoU (Intersection over Union) index increased by 3.9%.

Cross-Modality LGE-CMR Segmentation Using Image-to-Image Translation Based Data Augmentation.

Accurate segmentation of ventricle and myocardium from the late gadolinium enhancement (LGE) cardiac magnetic resonance (CMR) is an important tool for myocardial infarction (MI) analysis. However, the complex enhancement pattern of LGE-CMR and the lack of labeled samples make its automatic segmentation difficult to be implemented. In this paper, we propose an unsupervised LGE-CMR segmentation algorithm by using multiple style transfer networks for data augmentation. It adopts two different style transfer networks to perform style transfer of the easily available annotated balanced-Steady State Free Precession (bSSFP)-CMR images. Then, multiple sets of synthetic LGE-CMR images are generated by the style transfer networks and used as the training data for the improved U-Net. The entire implementation of the algorithm does not require the labeled LGE-CMR. Validation experiments demonstrate the effectiveness and advantages of the proposed algorithm.

Quantitative 3D Investigation of Nanoparticle Assemblies by Volumetric Segmentation of Electron Tomography Data Sets

Morphological characterization of nanoparticle assemblies and hybrid nanomaterials is critical in determining their structure-property relationships as well as in the development of structures with desired properties. Electron tomography has become a widely utilized technique for the three-dimensional characterization of nanoparticle assemblies. However, the extraction of quantitative morphological parameters from the reconstructed volume can be a complex and labor-intensive task. In this study, we aim to overcome this challenge by automating the volumetric segmentation process applied to three-dimensional reconstructions of nanoparticle assemblies. The key to enabling automated characterization is to assess the performance of different volumetric segmentation methods in accurately extracting predefined quantitative descriptors for morphological characterization. In our methodology, we compare the quantitative descriptors obtained through manual segmentation with those obtained through automated segmentation methods, to evaluate their accuracy and effectiveness. To show generality, our study focuses on the characterization of assemblies of CdSe/CdS quantum dots, gold nanospheres and CdSe/CdS encapsulated in polymeric micelles, and silica-coated gold nanorods decorated with both CdSe/CdS or PbS quantum dots. We use two unsupervised segmentation algorithms: the watershed transform and the spherical Hough transform. Our results demonstrate that the choice of automated segmentation method is crucial for accurately extracting the predefined quantitative descriptors. Specifically, the spherical Hough transform exhibits superior performance in accurately extracting quantitative descriptors, such as particle size and interparticle distance, thereby allowing for an objective, efficient, and reliable volumetric segmentation of complex nanoparticle assemblies.

Latent space unsupervised semantic segmentation.

The development of compact and energy-efficient wearable sensors has led to an increase in the availability of biosignals. To effectively and efficiently analyze continuously recorded and multidimensional time series at scale, the ability to perform meaningful unsupervised data segmentation is an auspicious target. A common way to achieve this is to identify change-points within the time series as the segmentation basis. However, traditional change-point detection algorithms often come with drawbacks, limiting their real-world applicability. Notably, they generally rely on the complete time series to be available and thus cannot be used for real-time applications. Another common limitation is that they poorly (or cannot) handle the segmentation of multidimensional time series. Consequently, the main contribution of this work is to propose a novel unsupervised segmentation algorithm for multidimensional time series named Latent Space Unsupervised Semantic Segmentation (LS-USS), which was designed to easily work with both online and batch data. Latent Space Unsupervised Semantic Segmentation addresses the challenge of multivariate change-point detection by utilizing an autoencoder to learn a 1-dimensional latent space on which change-point detection is then performed. To address the challenge of real-time time series segmentation, this work introduces the Local Threshold Extraction Algorithm (LTEA) and a "batch collapse" algorithm. The "batch collapse" algorithm enables Latent Space Unsupervised Semantic Segmentation to process streaming data by dividing it into manageable batches, while Local Threshold Extraction Algorithm is employed to detect change-points in the time series whenever the computed metric by Latent Space Unsupervised Semantic Segmentation exceeds a predefined threshold. By using these algorithms in combination, our approach is able to accurately segment time series data in real-time, making it well-suited for applications where timely detection of changes is critical. When evaluating Latent Space Unsupervised Semantic Segmentation on a variety of real-world datasets the Latent Space Unsupervised Semantic Segmentation systematically achieves equal or better performance than other state-of-the-art change-point detection algorithms it is compared to in both offline and real-time settings.

Unsupervised Segmentation of Muscle Precursor Cell Images In Situ

In vitro culture of muscle stem cells on a large scale could bring light to the treatment of muscle-related diseases. However, the current work related to muscle stem cell culture is still only performed in specialized biological laboratories that are very much limited by manual experience. There are still some difficulties to achieve an automated culture of complex morphological cells in terms of live cell observation and morphological analysis. In this paper, a set of bright-field cell in situ imaging devices is designed to perform non-contact and invasive imaging of muscle precursor cells in vitro, and a neural network structured lightweight unsupervised semantic segmentation algorithm is proposed for the acquired images to achieve online extraction of cell regions of interest without manual annotation and pre-training. The algorithm first uses a graph-based super-pixel segmentation to obtain a coarse segmentation, then aggregates the coarse segmentation results with the help of Laplace operators as a reference to a four-layer convolutional neural network (CNN). The CNN parameters learn to refine the boundaries of the cells which helps the final segmentation accuracy and mean intersection–merge ratio reach 88% and 77%, respectively.

Cardiac LGE MRI Segmentation With Cross-Modality Image Augmentation and Improved U-Net.

Image segmentation is a challenging problem in imaging informatics, which stems from the intersection of imaging techniques, computer science and biomedicine. In particular, accurate segmentation of cardiac structures in late gadolinium enhancement (LGE) cardiac magnetic resonance (CMR) is of great clinical importance for cardiac function assessment and myocardial disease diagnosis. However, it is a well-known challenge due to its special imaging modality and the lack of labeled LGE samples. In this paper, we propose an unsupervised ventricular segmentation algorithm that can perform biventricular segmentation of LGE images in the absence of labeled LGE data. There are two primary modules, the data augmentation procedure and the segmentation network. The easily available annotated balanced-Steady State Free Precession (bSSFP) images are employed for cross-modal data augmentation by image translation, where a single bSSFP image is converted into multiple synthetic LGE images while preserving the original morphological structure. Then, the proposed segmentation network is trained with the synthetic LGE images and used for segmenting real LGE images. Validation experiments demonstrated the effectiveness and advantages of the proposed algorithm.

Magnetic Particle Imaging of Transplanted Human Islets Using a Machine Learning Algorithm.

Human islet transplantation is a promising therapy to restore normoglycemia for type 1 diabetes (T1D). Despite recent advances, human islet transplantation remains suboptimal due to significant islet graft loss after transplantation. Various immunological and nonimmunological factors contribute to this loss therefore signifying a need for strategies and approaches for visualizing and monitoring transplanted human islet grafts. One such imaging approach is magnetic particle imaging (MPI), an emerging imaging modality that detects the magnetization of iron oxide nanoparticles. MPI is known for its specificity due to its high image contrast and sensitivity. MPI through its noninvasive nature provides the means for monitoring transplanted human islets in real time. Here we summarize an approach to track transplanted human islets using MPI. We label human islet from donors with dextran-coated ferucarbotran iron oxide nanoparticles, transplant the labeled human islet into under the left kidney capsule, and image graft cells using an MPI scanner. We engineer a K-means++, clustering-based unsupervised machine learning algorithm for standardized image segmentation and iron quantification of the MPI, which solves problems with selection bias and indiscriminate signal boundary that accompanies this newer imaging modality. In this chapter, we summarize the methods of this emerging imaging modality of MPI in conjunction with unsupervised machine learning to monitor and visualize islets after transplantation.

An unsupervised image segmentation algorithm for coronary angiography

Computer visual systems can rapidly obtain a large amount of data and automatically process them with ease. These characteristics constitute advantages for the application of such systems in the automatic analysis of medical images, as well as in processing technology. The precision of image segmentation, which plays a critical role in computer visual systems, directly affects the quality of processing results. Coronary angiographs feature various background colors, complex patterns, and blurry edges. The image areas containing blood vessels cannot be precisely segmented through regular methods. Therefore, this study proposed an unsupervised learning algorithm that uses regional parameter expansion (RPE). This method was derived from the flood fill algorithm, which can effectively segment image areas containing blood vessels despite a complex background or uneven light and shadow. An optimal cover tree (OCT) algorithm was proposed for the establishment of coronary arteries and the estimation of vessel diameter. Through the region growing method, spanning trees were used to record the cover length of adjacent connections, thereby establishing vessel paths, and the length can be used to track changes in vessel diameter.

Training Deep Learning Models to Work on Multiple Devices by Cross-Domain Learning with No Additional Annotations

To create an unsupervised cross-domain segmentation algorithm for segmenting intraretinal fluid and retinal layers on normal and pathologic macular OCT images from different manufacturers and camera devices. We sought to use generative adversarial networks (GANs) to generalize a segmentation model trained on one OCT device to segment B-scans obtained from a different OCT device manufacturer in a fully unsupervised approach without labeled data from the latter manufacturer. A total of 732 OCT B-scans from 4 different OCT devices (Heidelberg Spectralis, Topcon 1000, Maestro2, and Zeiss Plex Elite 9000). We developed an unsupervised GAN model, GANSeg, to segment 7 retinal layers and intraretinal fluid in Topcon 1000 OCT images (domain B) that had access only to labeled data on Heidelberg Spectralis images (domain A). GANSeg was unsupervised because it had access only to 110 Heidelberg labeled OCTs and 556 raw and unlabeled Topcon 1000 OCTs. To validate GANSeg segmentations, 3 masked graders manually segmented 60 OCTs from an external Topcon 1000 test dataset independently. To test the limits of GANSeg, graders also manually segmented 3 OCTs from Zeiss Plex Elite 9000 and Topcon Maestro2. A U-Net was trained on the same labeled Heidelberg images as baseline. The GANSeg repository with labeled annotations is at https://github.com/uw-biomedical-ml/ganseg. Dice scores comparing segmentation results from GANSeg and the U-Net model with the manual segmented images. Although GANSeg and U-Net achieved comparable Dice scores performance as human experts on the labeled Heidelberg test dataset, only GANSeg achieved comparable Dice scores with the best performance for the ganglion cell layer plus inner plexiform layer (90%; 95% confidence interval [CI], 68%-96%) and the worst performance for intraretinal fluid (58%; 95% CI, 18%-89%), which was statistically similar to human graders (79%; 95% CI, 43%-94%). GANSeg significantly outperformed the U-Net model. Moreover, GANSeg generalized to both Zeiss and Topcon Maestro2 swept-source OCT domains, which it had never encountered before. GANSeg enables the transfer of supervised deep learning algorithms across OCT devices without labeled data, thereby greatly expanding the applicability of deep learning algorithms.

Observation of Clinical Efficacy of Anisodamine and Chlorpromazine in the Treatment of Intractable Hiccup after Stroke.

Objective This study is aimed at investigating the clinical efficacy of anisodamine combined with chlorpromazine on intractable hiccups after stroke. Methods 150 patients admitted to Affiliated Hospital of the Hebei University of Engineering from 2017 to 2021 were selected as the research objects, all of which received the computed tomography (CT) examination. During CT examination, intelligent algorithms were used to segment the images. An unsupervised multilayer image threshold segmentation algorithm was proposed by using Kullback-Leibler (K-L) divergence and the modified particle swarm optimization (MPSO) algorithm. All patients were divided into three groups, with each group of 50 patients. Patients in the control group (group A) took the calcium tablets, vitamin C tablets, and vitamin B1 tablets orally. Patients in the control group (group B) received the acupoint injection of anisodamine, and those in the observation group (group C) received the acupoint injection of anisodamine combined with chlorpromazine. The therapeutic effect and patient satisfaction of the three groups were compared. Results The two-dimensional (2D) K-L divergence was applied for the multilayer segmentation of images, which was helpful to obtain accurate images. The MPSO algorithm was adopted to reduce the computational complexity. The total efficiency of group C was 98%, that of group B was 56%, and that of group A was 22%. The total efficiency and satisfaction rate of group C were signally better than those of group A and group B (P < 0.05). Conclusion The combination of 2D K-L divergence and MPSO algorithm could improve the accuracy of multilayer image segmentation and CT imaging. Acupoint injection of anisodamine combined with chlorpromazine had better efficacy than the injection of anisodamine alone for the treatment of intractable hiccups after stroke, with high safety and clinical promotion value.

Sea Ice–Water Classification of RADARSAT-2 Imagery Based on Residual Neural Networks (ResNet) with Regional Pooling

Sea ice mapping plays an integral role in ship navigation and meteorological modeling in the polar regions. Numerous published studies in sea ice classification using synthetic aperture radar (SAR) have reported high classification rates. However, many of these focus on numerical results based on sample points and ignore the quality of the inferred sea ice maps. We have designed and implemented a novel SAR sea ice classification algorithm where the spatial context, obtained by the unsupervised IRGS segmentation algorithm, is integrated with texture features extracted by a residual neural network (ResNet) and, using regional pooling, classifies ice and water. This algorithm is trained and tested on a published dataset and cross-validated using leave-one-out (LOO) strategy, obtaining an overall accuracy of 99.67% and outperforming several existing algorithms. In addition, visual results show that this new method produces sea ice maps with natural ice–water boundaries and fewer ice and water errors.

Application of Artificial Intelligence in an Unsupervised Algorithm for Trajectory Segmentation Based on Multiple Motion Features

With the development of the wireless network, location-based services (e.g., the place of interest recommendation) play a crucial role in daily life. However, the data acquired is noisy, massive, it is difficult to mine it by artificial intelligence algorithm. One of the fundamental problems of trajectory knowledge discovery is trajectory segmentation. Reasonable segmentation can reduce computing resources and improvement of storage effectiveness. In this work, we propose an unsupervised algorithm for trajectory segmentation based on multiple motion features (TS-MF). The proposed algorithm consists of two steps: segmentation and mergence. The segmentation part uses the Pearson coefficient to measure the similarity of adjacent trajectory points and extract the segmentation points from a global perspective. The merging part optimizes the minimum description length (MDL) value by merging local sub-trajectories, which can avoid excessive segmentation and improve the accuracy of trajectory segmentation. To demonstrate the effectiveness of the proposed algorithm, experiments are conducted on two real datasets. Evaluations of the algorithm’s performance in comparison with the state-of-the-art indicate the proposed method achieves the highest harmonic average of purity and coverage.

Iterative, Deep Synthetic Aperture Sonar Image Segmentation

Synthetic aperture sonar (SAS) systems produce high-resolution images of the seabed environment. Moreover, deep learning has demonstrated superior ability in finding robust features for automating imagery analysis. However, the success of deep learning is conditioned on having lots of labeled training data, but obtaining generous pixel-level annotations of SAS imagery is often practically infeasible. This challenge has thus far limited the adoption of deep learning methods for SAS segmentation. Algorithms exist to segment SAS imagery in an unsupervised manner, but they lack the benefit of state-of-the-art learning methods and the results present significant room for improvement. In view of the above, we propose a new iterative algorithm for unsupervised SAS image segmentation combining superpixel formation, deep learning, and traditional clustering methods. We call our method Iterative Deep Unsupervised Segmentation (IDUS). IDUS is an unsupervised learning framework that can be divided into four main steps: 1) A deep network estimates class assignments. 2) Low-level image features from the deep network are clustered into superpixels. 3) Superpixels are clustered into class assignments (which we call pseudo-labels) using $k$-means. 4) Resulting pseudo-labels are used for loss backpropagation of the deep network prediction. These four steps are performed iteratively until convergence. A comparison of IDUS to current state-of-the-art methods on a realistic benchmark dataset for SAS image segmentation demonstrates the benefits of our proposal even as the IDUS incurs a much lower computational burden during inference (actual labeling of a test image). Finally, we also develop a semi-supervised (SS) extension of IDUS called IDSS and demonstrate experimentally that it can further enhance performance while outperforming supervised alternatives that exploit the same labeled training imagery.

Automatic quantification of white matter hyperintensities on T2-weighted fluid attenuated inversion recovery magnetic resonance imaging

White matter hyperintensities (WMH) are areas of increased signal visualized on T2-weighted fluid attenuated inversion recovery (FLAIR) brain magnetic resonance imaging (MRI) sequences. They are typically attributed to small vessel cerebrovascular disease in the context of aging. Among older adults, WMH are associated with risk of cognitive decline and dementia, stroke, and various other health outcomes. There has been increasing interest in incorporating quantitative WMH measurement as outcomes in clinical trials, observational research, and clinical settings. Here, we present a novel, fully automated, unsupervised detection algorithm for WMH segmentation and quantification. The algorithm uses a robust preprocessing pipeline, including brain extraction and a sample-specific mask that incorporates spatial information for automatic false positive reduction, and a half Gaussian mixture model (HGMM). The method was evaluated in 24 participants with varying degrees of WMH (4.9–78.6 cm3) from a community-based study of aging and dementia with dice coefficient, sensitivity, specificity, correlation, and bias relative to the ground truth manual segmentation approach performed by two expert raters. Results were compared with those derived from commonly used available WMH segmentation packages, including SPM lesion probability algorithm (LPA), SPM lesion growing algorithm (LGA), and Brain Intensity AbNormality Classification Algorithm (BIANCA). The HGMM algorithm derived WMH values that had a dice score of 0.87, sensitivity of 0.89, and specificity of 0.99 compared to ground truth. White matter hyperintensity volumes derived with HGMM were strongly correlated with ground truth values (r = 0.97, p = 3.9e-16), with no observable bias (−1.1 [−2.6, 0.44], p-value = 0.16). Our novel algorithm uniquely uses a robust preprocessing pipeline and a half-Gaussian mixture model to segment WMH with high agreement with ground truth for large scale studies of brain aging.

ARMA-Based Segmentation of Human Limb Motion Sequences.

With the development of human motion capture (MoCap) equipment and motion analysis technologies, MoCap systems have been widely applied in many fields, including biomedicine, computer vision, virtual reality, etc. With the rapid increase in MoCap data collection in different scenarios and applications, effective segmentation of MoCap data is becoming a crucial issue for further human motion posture and behavior analysis, which requires both robustness and computation efficiency in the algorithm design. In this paper, we propose an unsupervised segmentation algorithm based on limb-bone partition angle body structural representation and autoregressive moving average (ARMA) model fitting. The collected MoCap data were converted into the angle sequence formed by the human limb-bone partition segment and the central spine segment. The limb angle sequences are matched by the ARMA model, and the segmentation points of the limb angle sequences are distinguished by analyzing the good of fitness of the ARMA model. A medial filtering algorithm is proposed to ensemble the segmentation results from individual limb motion sequences. A set of MoCap measurements were also conducted to evaluate the algorithm including typical body motions collected from subjects of different heights, and were labeled by manual segmentation. The proposed algorithm is compared with the principle component analysis (PCA), K-means clustering algorithm (K-means), and back propagation (BP) neural-network-based segmentation algorithms, which shows higher segmentation accuracy due to a more semantic description of human motions by limb-bone partition angles. The results highlight the efficiency and performance of the proposed algorithm, and reveals the potentials of this segmentation model on analyzing inter- and intra-motion sequence distinguishing.