20 November 2019 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
In this article, we take as inspiration the labor division into scouts and workers in an ant colony and propose a novel approach for automated cell tracking in the framework of multi-Bernoulli random finite sets. To approximate the Bernoulli parameter sets, we first define an existence probability of an ant colony as well as its discrete density distribution. During foraging, the behavior of scouts is modeled as a chaotic movement to produce a set of potential candidates. Afterwards, a group of workers, i.e., a worker ant colony, is recruited for each candidate, which then embark on gathering heuristic information in a self-organized way. Finally, the pheromone field is formed by the corresponding worker ant colony, from which the Bernoulli parameter is derived and the state of the cell is estimated accordingly to be associated with the existing tracks. Performance comparisons with other previous approaches are conducted on both simulated and real cell image sequences and show the superiority of this algorithm.
19 December 2023 in IEEE Transactions on Emerging Topics in Computational Intelligence
Takagi–Sugeno–Kang (TSK) fuzzy inference has been widely used in approximating uncertain nonlinear systems because of its high interpretability and precision. However, TSK fuzzy inference models are usually constructed on data in a supervised manner for classification and regression problems. As the first attempt, a novel Takagi–Sugeno–Kang fuzzy clustering (TSK-FC) method from the perspective of unsupervised learning is presented in this paper. The distinctive characteristic of TSK-FC lies in that it groups data points into different clusters directly by fuzzy inference on the TSK fuzzy rules. Therefore, the comprehensibility of the clustering procedure and clustering results of TSK-FC can be obtained. Specifically, all input features in TSK-FC on the IF-parts of all fuzzy rules are randomly assigned with interpretable linguistic terms, which ensures the interpreta-bility of TSK-FC. In addition, TSK-FC explores the potential clusters in data patterns by iteratively updating K consequent parameter vectors of all fuzzy rules in an unsupervised manner, which can represent the K obtained clusters. Particularly, all data points from the same cluster will be as close as possible to the cluster center, and as far as possible from the other cluster centers in the iterative update procedure. Moreover, the optimization problem of TSK-FC can be transformed into a standard difference of convex functions using the concave–convex procedure (CCCP), which can be easily solved by introducing an iterative algorithm. Experimental results on synthetic and benchmark datasets as well as four case studies validate the effectiveness of the proposed fuzzy rule-based TSK-FC. The statistical results on all experiments indicate the feasibility of TSK-FC as a clustering tool. The code of TSK-FC is available at https://github.com/gusuhang10/TSK-FC .
20 October 2020 in IEEE Journal of Biomedical and Health Informatics
In this paper, we use an ant colony heuristic method to tackle the integration of data association and state estimation in the presence of cell mitosis, morphological change and uncertainty of measurement. Our approach first models the scouting behavior of an unlabeled ant colony as a chaotic process to generate a set of cell candidates in the current frame, then a labeled ant colony foraging process is modeled to construct an interframe matching between previously estimated cell states and current cell candidates through minimizing the optimal sub-pattern assignment metric for track (OSPA-T). The states of cells in the current frame are finally estimated using labeled ant colonies via a multi-Bernoulli parameter set approximated by individual food pheromone fields and heuristic information within the same region of support, the resulting trail pheromone fields over frames constitutes the cell lineage trees of the tracks. A four-stage track recovery strategy is proposed to monitor the history of all established tracks to reconstruct broken tracks in a computationally economic way. The labeling method used in this work is an improvement on previous techniques. The method has been evaluated on publicly available, challenging cell image sequences, and a satisfied performance improvement is achieved in contrast to the state-of-the-art methods.
28 October 2019 in IEEE Journal of Biomedical and Health Informatics
The analysis of the dynamic behavior of cells in time-lapse microscopy sequences requires the development of reliable and automatic tracking methods capable of estimating individual cell states and delineating the lineage trees corresponding to the tracks. In this paper, we propose a novel approach, i.e., an ant colony inspired multi-Bernoulli filter, to handle the tracking of a collection of cells within which mitosis, morphological change and erratic dynamics occur. The proposed technique treats each ant colony as an independent one in an ant society, and the existence probability of an ant colony and its density distribution approximation are derived from the individual pheromone field and the corresponding heuristic information for the approximation to the multi-Bernoulli parameters. To effectively guide ant foraging between consecutive frames, a dual prediction mechanism is proposed for the ant colony and its pheromone field. The algorithm performance is tested on challenging datasets with varying population density, frequent cell mitosis and uneven motion over time, demonstrating that the algorithm outperforms recently reported approaches.
17 February 2025 in Journal of Intelligent & Robotic Systems
Simultaneous Localization and Mapping (SLAM) is a cornerstone capability for intelligent mobile robots, enabling them to accurately estimate their positions in unknown environments. However, most of the state-of-the-art visual SLAM systems rely on the assumption of static scenes, leading to significantly reduced accuracy and robustness in dynamic environments. In this paper, a novel RGB-D SLAM system termed Inpainting SLAM is proposed in the ORB-SLAM2 framework. Our Inpainting SLAM defines two new modules: one is the dynamic objects detection module, which combines segmentation and depth information to segment dynamic objects. Additionally, a new method is also proposed to determine whether movable objects are classified as dynamic. The other is an image inpainting module to restore static regions that are occluded by dynamic objects, with a new rectified approach introduced to determine the inpainting regions that can enhance the performance of the SLAM system. With these two modules, the accuracy and robustness of the SLAM system in dynamic scenes are expected to be improved. Our method is tested on the public TUM dataset, demonstrating its effectiveness and reliability. The improvements on ORB-SLAM2 in RTE, RRE, and ATE are 97.45%, 99.88%, and 97.90%, respectively. In comparison with other advanced dynamic SLAM methods, our approach also demonstrates superiority.