A Fast Algorithm of Convex Hull Vertices Selection for Online Classification

Online Active Continual Learning for Robotic Lifelong Object Recognition

In real-world applications, robotic systems collect vast amounts of new data from ever-changing environments over time. They need to continually interact and learn new knowledge from the external world to adapt to the environment. Particularly, lifelong object recognition in an online and interactive manner is a crucial and fundamental capability for robotic systems. To meet this realistic demand, in this article, we propose an online active continual learning (OACL) framework for robotic lifelong object recognition, in the scenario of both classes and domains changing with dynamic environments. First, to reduce the labeling cost as much as possible while maximizing the performance, a new online active learning (OAL) strategy is designed by taking both the uncertainty and diversity of samples into account to protect the information volume and distribution of data. In addition, to prevent catastrophic forgetting and reduce memory costs, a novel online continual learning (OCL) algorithm is proposed based on the deep feature semantic augmentation and a new loss-based deep model and replay buffer update, which can mitigate the class imbalance between the old and new classes and alleviate confusion between two similar classes. Moreover, the mistake bound of the proposed method is analyzed in theory. OACL allows robots to select the most representative new samples to query labels and continually learn new objects and new variants of previously learned objects from a nonindependent and identically distributed (i.i.d.) data stream without catastrophic forgetting. Extensive experiments conducted on real lifelong robotic vision datasets demonstrate that our algorithm, even trained with fewer labeled samples and replay exemplars, can achieve state-of-the-art performance on OCL tasks.

Online Semisupervised Active Classification for Multiview PolSAR Data

Polarimetric synthetic aperture radar (PolSAR) data are sequentially acquired and have multiple views obtained from different feature extractors or multiple frequency bands. The fast and accurate classification of PolSAR data in dynamically changing environments is a critical and challenging task. Online learning can handle this task by learning a classifier incrementally from a stream of samples. In this article, we propose an online semisupervised active learning framework for multiview PolSAR data classification, called OSAM. First, a novel online active learning strategy is designed based on the relationships among multiple views and a randomized rule, which allows to only query the labels of some informative incoming samples. Then, in order to utilize both the incoming labeled and unlabeled samples to update the classifiers, a novel online semisupervised learning model is proposed based on co-regularized multiview learning and graph regularization. In addition, the proposed method can deal with the dynamic large-scale multifeature or multifrequency PolSAR data where not only the amount of data but also the number of classes gradually increases in the learning process. Moreover, the mistake bound of the proposed method is derived rigorously. Extensive experiments are conducted on real PolSAR data to evaluate the performance of our algorithm, and the results demonstrate the effectiveness of the proposed method.

Supporting data for the integrated Agent-Based Modelling and Robust Optimization on food supply network design in COVID-19 pandemic

This article presents the data as a support for "Designing a Food Supply Chain Strategy during COVID-19 Pandemic using an Integrated Agent-Based Modelling and Robust Optimization" [1]. An integration framework of Agent-Based Modelling (ABM) and Robust Optimization (RO) is proposed to address the food supply network development involving normal and pandemic condition issue regarding the actual food production data availability. In this article, the data associated with the integrated ABM simulation and RO are discussed. Particularly, this article provides the output rice production capacity data from the ABM simulation. This article also discusses how the output data from ABM simulation are processed to construct the polyhedral uncertainty set, which will later used by RO. By showing the output data from the ABM simulation and explaining how it is processed to be used in RO, other researchers and investigators could integrate their own ABM simulation model with RO to address their respective problems considering any uncertainty. Furthermore, the additional data needed for the optimization model are also included, which are mainly retrieved from the reports of government agencies.

A Comprehensive Data Gathering Network Architecture in Large-Scale Visual Sensor Networks

The fundamental utility of the Large-Scale Visual Sensor Networks (LVSNs) is to monitor specified events and to transmit the detected information back to the sink for achieving the data aggregation purpose. However, the events of interest are usually not uniformly distributed but frequently detected in certain regions in real-world applications. It implies that when the events frequently picked up by the sensors in the same region, the transmission load of LVSNs is unbalanced and potentially cause the energy hole problem. To overcome this kind of problem for network lifetime, a Comprehensive Visual Data Gathering Network Architecture (CDNA), which is the first comparatively integrated architecture for LVSNs is designed in this paper. In CDNA, a novel α-hull based event location algorithm, which is oriented from the geometric model of α-hull, is designed for accurately and efficiently detect the location of the event. In addition, the Chi-Square distribution event-driven gradient deployment method is proposed to reduce the unbalanced energy consumption for alleviating energy hole problem. Moreover, an energy hole repairing method containing an efficient data gathering tree and a movement algorithm is proposed to ensure the efficiency of transmitting and solving the energy hole problem. Simulations are made for examining the performance of the proposed architecture. The simulation results indicate that the performance of CDNA is better than the previous algorithms in the realistic LVSN environment, such as the significant improvement of the network lifetime.