This paper proposes a novel Bayesian integrated tracking and communication (ITAC) framework. By consolidating the time of arrival (ToA) and angle of departure (AoD) measurement models, a robust Bayesian filtering framework is introduced for single-target tracking in dynamic and cluttered wireless environments. By incorporating random finite set(RFS) theory, the method jointly estimates the target’s existence probability and its kinematic state within a unified Bayesian recursion, effectively overcoming the limitations of conventional filters, which assume that the target can always be detected. Furthermore, the paper derives the signal-to-interference-plus noise ratio (SINR) for both communication and sensing links. The proposed RFS-based Bayesian filter is implemented using a sequential Monte Carlo (SMC) approach. Numerical simulations demonstrate the framework’s superior performance in maintaining tracking consistency and accuracy even under challenging propagation conditions. Moreover, the results reveal how different network parameters affect the overall communication and tracking performance.

This study presents a multi-modal multi-granularity tokenizer specifically designed for analyzing ancient Chinese scripts, focusing on the Chu bamboo slip (CBS) script used during the Spring and Autumn and Warring States period (771-256 BCE) in Ancient China. Considering the complex hierarchical structure of ancient Chinese scripts, where a single character may be a combination of multiple sub-characters, our tokenizer first adopts character detection to locate character boundaries. Then it conducts character recognition at both the character and sub-character levels. Moreover, to support the academic community, we assembled the first large-scale dataset of CBSs with over 100K annotated character image scans. On the part-of-speech tagging task built on our dataset, using our tokenizer gives a 5.5% relative improvement in F1-score compared to mainstream sub-word tokenizers. Our work not only aids in further investigations of the specific script but also has the potential to advance research on other forms of ancient Chinese scripts.

Abstract Edge devices are increasingly utilized for defect detection in power line inspection, necessitating algorithms that optimize model size and accuracy. This study introduces a lightweight detection method using the Optimized Feature Network with MobileOne‐FPN‐NASHead (OFN network) OFN network and distillation technique. The OFN incorporates a lightweight backbone, neural network search, re‐parametrization, and a feature pyramid to create a compact yet effective detection network. To enhance feature learning, a heterogeneous distillation approach is applied, leveraging a modified YOLOv8 as a teacher network. This modification includes an explicit visual centre for improved global and local information extraction, crucial for dense target detection in power line inspections. Additionally, the Minimize the points distance IoU (MPDloU) loss function is used to improve localization accuracy over the the Complete‐Intersection Over Union (CIoU) loss. Experimental results show a 1.1% mean Average Precision (mAP) increase for the enhanced YOLOv8 and a 70.2% mAP for the OFN network with 18.95 GFLOPs and 343 FPS, achieving a commendable balance between model efficiency and detection performance. The research underscores the viability of the OFN for edge computing in power line defect detection, highlighting the potential of innovative algorithmic structures in this application.

The presence of radically irregular data points (RIDPs), which are referred to as the subset of measurements that represents no or little information, can significantly degrade the performance of ellipse fitting methods. We develop an ellipse fitting method that is robust to RIDPs based on the maximum correntropy criterion with variable center (MCC-VC), where an adaptable Laplacian kernel is used. For single ellipse fitting, we formulate a non-convex optimization problem and divide it into two subproblems, one to estimate the kernel bandwidth and the other the kernel center. We design sufficiently accurate convex approximation to each subproblem that will lead to computationally efficient closed-form solutions. The two subproblems are solved in an alternate manner until convergence is reached. We also investigate coupled ellipses fitting. While there exist multiple ellipses fitting methods in the literature, we develop a coupled ellipses fitting method by exploiting the underlying special structure, where the associations between the data points and ellipses are absent in the problem. The proposed method first introduces an association vector for each data point and then formulates a non-convex mixed-integer optimization problem to establish the data associations, which is approximately solved by relaxing it into a second-order cone program. Using the estimated data associations, we then extend the proposed single ellipse fitting method to accomplish the final coupled ellipses fitting. The proposed method is shown to perform significantly better than the existing methods using both simulated data and real images.

Dynamic community detection (or graph clustering) in temporal networks has attracted much attention because it is promising for revealing the underlying mechanism of complex real-world systems. Current methods are criticized for the independence of graph representation learning and graph clustering, considerable noise during temporal information smoothing, and high time complexity. We propose a R obust T emporal S moothing C lustering method (RTSC), which involves joint graph representation learning and graph clustering, to solve these problems. RTSC can be formulated as a constrained multi-objective optimization problem. Specifically, three-order successive snapshots are first projected into the same subspace via graph embedding. We then use the embedding matrices to learn a common low-rank block-diagonal matrix that contains current clustering information and specific noise matrices with a sparse constraint to remove noise at each time step. To efficiently solve the challenging optimization problem, we also propose an optimization procedure based on the augmented Lagrangian multiplier (ALM) scheme. Experimental results on six artificial datasets and four real-world dynamic network datasets indicate that RTSC performs better than six state-of-the-art algorithms for dynamic clustering in temporal networks.

Chenlong Hu, Yukun Feng, Hidetaka Kamigaito, Hiroya Takamura, Manabu Okumura. Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume. 2021.

The performance of ellipse fitting may significantly degrade in the presence of outliers, which can be caused by occlusion of the object, mirror reflection or other objects in the process of edge detection. In this paper, we propose an ellipse fitting method that is robust against the outliers, and thus maintaining stable performance when outliers can be present. We formulate an optimization problem for ellipse fitting based on the maximum entropy criterion (MCC), having the Laplacian as the kernel function from the well-known fact that the ℓ1-norm error measure is robust to outliers. The optimization problem is highly nonlinear and non-convex, and thus is very difficult to solve. To handle this difficulty, we divide it into two subproblems and solve the two subproblems in an alternate manner through iterations. The first subproblem has a closed-form solution and the second one is cast as a convex second-order cone program (SOCP) that can reach the global solution. By so doing, the alternate iterations always converge to an optimal solution, although it can be local instead of global. Furthermore, we propose a procedure to identify failed fitting of the algorithm caused by local convergence to a wrong solution, and thus, it reduces the probability of fitting failure by restarting the algorithm at a different initialization. The proposed robust ellipse fitting method is next extended to the coupled ellipses fitting problem. Both simulated and real data verify the superior performance of the proposed ellipse fitting method over the existing methods.

Support Vector Data Description (SVDD) inherits properties of Support Vector Machines (SVM) and has become a prominent One Class Classifier (OCC). Same to standard SVM, its O (n3) time and O (n2) space complexities, where n is the number of training samples, have become major limitations in cases of large training datasets. As a simple and effective method, reducing the size of training dataset through reserving only samples mostly relevant to learned classifier, can be adopted to overcome the limitations. A trained SVDD enclosed decision boundary always locates on edge area of data distribution and is decided by a small subset of Support Vectors(SVs). Therefore, in this paper, we present a method based on edge detection such that edge samples mostly relevant to decision boundary can be preserved. And clustering techniques are also be applied to keep centroids representing the global distribution properties so as to avoid over-outside of decision boundary. To restrict the influences of noises, each training pattern is assigned with a weight. Experiments on real and artificial data sets prove that the classifier trained on reconstruction training set consisting of edge points and centroids can preserve performance with much faster training speed.

This paper focuses on semi-supervised classification problem by using Transductive Support Vector Machine. Traditional TSVM for semi-supervised classification firstly train an SVM model with labeled data. Then use the model to predict unlabeled data and optimize unlabeled data prediction to retrain the SVM. TSVM always uses a predefined kernel and fixed parameters during the optimization procedure and they also suffers potential over-fitting problem. In this paper we introduce proposed quasi-linear kernel to the TSVM. An SVM with quasi-linear kernel realizes an approximate nonlinear separation boundary by multi-local linear boundaries with interpolation. By applying quasi-linear kernel to semi-supervised classification it can avoid potential over-fitting and provide more accurate unlabeled data prediction. After unlabeled data prediction optimization, the quasi-linear kernel can be further adjusted considering the potential boundary data distribution as prior knowledge. We also introduce a minimal set method for optimizing unlabeled data prediction. The minimal set method follows the clustering assumption of semi-supervised learning. The pairwise label switching is allowed between minimal sets. It can speed up optimization procedure and reduce influence from label constrain in TSVM. Experiment results on benchmark gene datasets show that the proposed method is effective and improves classification performances.