JCJinlin Chen

Jinlin Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jinlin Chen has a total of 34 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • DW-GAN: Toward High-Fidelity Color-Tones of GAN-Generated Images With Dynamic Weights

    by Wei Li, Chengchun Gu, Jinlin Chen, Chao Ma, Xiaowu Zhang, Bin Chen, Ping Chen

    Color-tone represents the prominent color of an image, and training generative adversarial nets (GAN) to change color-tones of generated images is desirable in many applications. Advances such as HistoGAN can manipulate color-tones of generated images with a target image. Yet, there are challenges. Kullback–Leibler (KL) divergence adopted by HistoGAN might bring the color-tone mismatching, because it is possible to provide infinite score to a generator. Moreover, only relying on distribution estimation also produces images with lower fidelity in HistoGAN. To address these issues, we propose a new approach, named dynamic weights GAN (DW-GAN). We use two discriminators to estimate the distribution matching degree and details’ similarity, with Laplacian operator and Hinge loss. Laplacian operator can help capture more image details, while Hinge loss is deduced from mean difference (MD) that could avoid the case of infinite score. To synthesize desired images, we combine the loss of the two discriminators with generator loss and set the weights of the two estimated scores to be dynamic through the previous discriminators’ outputs, given that the training signal of a generator is from a discriminator. Besides, we innovatively integrate the dynamic weights into other GAN variants (e.g., HistoGAN and StyleGAN) to show the improved performance. Finally, we conduct extensive experiments on one industrial Fabric and seven public datasets to demonstrate the significant performance of DW-GAN in producing higher fidelity images and achieving the lowest Frechet inception distance (FID) scores over SOTA baselines.


  • Reducing Mode Collapse With Monge–Kantorovich Optimal Transport for Generative Adversarial Networks

    by Wei Liu, Jinlin Chen, Libing Wu, Patrick D. Flynn, Wei Ding, Ping Chen

    Mode collapse has been a persisting challenge in generative adversarial networks (GANs), and it directly affects the applications of GAN in many domains. Existing works that attempt to solve this problem have some serious limitations: models using optimal transport (OT) strategies (e.g., Wasserstein distance) lead to vanishing or exploding gradients; increasing the number of generators can cause several generators focusing on the same mode; and approaches that modify the loss also do not satisfactorily resolve mode collapse. In this article, we reduce mode collapse by formulating it as a Monge problem of OT map. We show that the Monge problem can be transformed to the distribution transformation problem in GAN, and a rectified affine neural network can be considered as a measurable function. In this way, we propose Monge GAN that uses this measurable function to transform the generated data distribution into the original data distribution. We utilize the Kantorovich formulation to obtain the OT cost, which is regarded as the OT distance between the two distributions. Finally, we conduct extensive experiments on both image and numerical datasets to validate our Monge GAN in reducing model collapse.


  • ManiWare: An Easy-to-Use Middleware for Cooperative Manipulator Teams

    by Jinlin Chen, Jiannong Cao, Zhiqin Cheng, Yuvraj Sahni

    Manipulator teams are frequently employed in various industrial applications to handle challenging cooperative tasks. The complicated interaction between manipulators makes it difficult to design applications from scratch. Although robotics middleware has emerged as the key to lowering the development complexity of manipulator applications, existing works still have limitations in controlling multiple manipulators to carry out tasks cooperatively. To overcome the limitations, middleware should provide programming abstraction support, coordination mechanism, and dynamic reconfiguration of motion controllers so that a team of manipulators can work together efficiently. This work proposes ManiWare, an easy-to-use middleware that provides the team-level programming abstraction and the manipulator-level plugin mechanism for programming and configuring manipulator applications. The team-level programming abstraction can facilitate the development process by invoking the functions from the fundamental cooperation components, which drives the developers to focus on designing application logic. Besides, the plugin mechanism dynamically configures and manages the motion controller of different parts of manipulators, making the reconfiguration feasible. This work implements ManiWare and evaluates the task execution performance with three case studies in the high-fidelity simulation platform. The experimental results demonstrate that ManiWare facilitates cooperative tasks with a high success rate, efficient completion time, and marginal runtime overhead. The source code is at https://github.com/sundycoder/maniware .


  • Towards Efficient Distributed Collision Avoidance for Heterogeneous Mobile Robots

    by Jinlin Chen, Jiannong Cao, Zhiqin Cheng, Shan Jiang

    We study the problem of distributed collision avoidance for mobile robotic systems, where a group of heterogeneous robots with different sizes and motion constraints avoid collisions with each other and static obstacles during the movements from their starting to goal locations. Existing methods mainly consider homogeneous robots and incur a high collision rate in environments with moving robots and static objects. Hence, we propose a distributed c ollision a voidance for heter ogeneous mobile robots ( Heter-CA ), which allows each robot to independently avoid collisions considering the heterogeneity of robots and varying static obstacles. In Heter-CA , each robot predicts the trajectories of neighboring robots and estimates the varying size of static obstacles with the robots' range-finder sensors before motion planning, which enables each robot to avoid obstacles safely. Besides, we prove that Heter-CA can guarantee collision-free movement between heterogeneous robots by satisfying sufficient conditions. We evaluate Heter-CA in numerous simulated and real-world scenarios in which groups of heterogeneous robots perform navigation tasks. The experimental results demonstrate that Heter-CA takes $10\times$ less computation time and achieves $5\%$ less collision rate than baseline algorithms.


  • Open Access

    From Multi-agent to Multi-robot: A Scalable Training and Evaluation Platform for Multi-robot Reinforcement Learning

    by Zhiuxan Liang, Jiannong Cao, Shan Jiang, Divya Saxena, Jinlin Chen, Huafeng Xu

    Multi-agent reinforcement learning (MARL) has been gaining extensive attention from academia and industries in the past few decades. One of the fundamental problems in MARL is how to evaluate different approaches comprehensively. Most existing MARL methods are evaluated in either video games or simplistic simulated scenarios. It remains unknown how these methods perform in real-world scenarios, especially multi-robot systems. This paper introduces a scalable emulation platform for multi-robot reinforcement learning (MRRL) called SMART to meet this need. Precisely, SMART consists of two components: 1) a simulation environment that provides a variety of complex interaction scenarios for training and 2) a real-world multi-robot system for realistic performance evaluation. Besides, SMART offers agent-environment APIs that are plug-and-play for algorithm implementation. To illustrate the practicality of our platform, we conduct a case study on the cooperative driving lane change scenario. Building off the case study, we summarize several unique challenges of MRRL, which are rarely considered previously. Finally, we open-source the simulation environments, associated benchmark tasks, and state-of-the-art baselines to encourage and empower MRRL research.


  • EID-GAN: Generative Adversarial Nets for Extremely Imbalanced Data Augmentation

    by Wei Li, Jinlin Chen, Jiannong Cao, Chao Ma, Jia Wang, Xiaohui Cui, Ping Chen

    Imbalanced data causes deep neural networks to output biased results, and it becomes more serious when facing extremely imbalanced data regarding the outliers with tiny size (the ratio of the outlier size to the image size is around 0.05%). Many data argumentation models are proposed to supplement imbalanced data to alleviate biased results. However, the existing augmentation models cannot synthesize tiny outliers, which makes the generated data unavailable. In this paper, we propose a new augmentation model named Extremely Imbalanced Data Augmentation Generative Adversarial Nets ($EID$-GAN) to address the extremely imbalanced data augmentation problem. First, we design a new penalty function by subtracting the outliers from the cropped region of generated instance to guide the generator to learn the features of outliers. After that, we combine the output value of the penalty function with the generator loss to jointly update the generator’s parameters with back-propagation. Second, we propose a new evaluation approach that adopts two outlier detectors with k-fold cross-validation to assess the availability of generated instances. We conduct extensive experiments to demonstrate the significant performance improvement of $EID$-GAN on two extremely imbalanced datasets: industrial Piston and Fabric datasets; and one general imbalanced dataset: the public DAGM dataset. The experimental results show that our $EID$-GAN outperforms the SOTA augmentation models on different imbalanced datasets.


  • IFL-GAN: Improved Federated Learning Generative Adversarial Network With Maximum Mean Discrepancy Model Aggregation

    by Wei Li, Jinlin Chen, Zhenyu Wang, Zhidong Shen, Chao Ma, Xiaohui Cui

    The generative adversarial network (GAN) is usually built from the centralized, independent identically distributed (i.i.d.) training data to generate realistic-like instances. In real-world applications, however, the data may be distributed over multiple clients and hard to be gathered due to bandwidth, departmental coordination, or storage concerns. Although existing works, such as federated learning GAN (FL-GAN), adopt different distributed strategies to train GAN models, there are still limitations when data are distributed in a non-i.i.d. manner. These studies suffer from convergence difficulty, producing generated data with low quality. Fortunately, we found that these challenges are often due to the use of a federated averaging strategy to aggregate local GAN models' updates. In this article, we propose an alternative approach to tackling this problem, which learns a globally shared GAN model by aggregating locally trained generators' updates with maximum mean discrepancy (MMD). In this way, we term our approach improved FL-GAN (IFL-GAN). The MMD score helps each local GAN hold different weights, making the global GAN in IFL-GAN getting converged more rapidly than federated averaging. Extensive experiments on MNIST, CIFAR10, and SVHN datasets demonstrate the significant improvement of our IFL-GAN in both achieving the highest inception score and producing high-quality instances.


  • GraphWare: A graph‐based middleware enabling multi‐robot cooperation

    by Jinlin Chen, Jiannong Cao, Zhixuan Liang, Zhiqin Cheng, Jia Wang

    Summary: Multi‐robot systems are widely used to handle complex and cooperative missions in various industrial applications. Although robotic middleware has become the key to reducing the complexity of multi‐robot application development, existing works still have limitations in controlling multiple robots to perform missions cooperatively. To enable multi‐robot cooperation, middleware should provide high‐level abstraction support, dynamic configuration, communication, and synchronization. In this article, we proposeGraphWare, a novel middleware that provides a graph‐based programming abstraction and its underlying runtime kernel for programming and building multi‐robot cooperation applications. The graph‐based programming abstraction can express cooperative missions without exposing the complexity of managing multiple robots. The runtime kernel configures and manages multiple heterogeneous robots to intelligently perform cooperative missions. We implementGraphWareand evaluate its performance with ball collection missions which are cooperatively accomplished by a group of mobile robots, and study the fault‐tolerance, flexibility, and scalability of the middleware in the realistic simulation. The experimental results demonstrate thatGraphWarefacilitates the multi‐robot cooperative mission with efficient mission completion time, high success rate, and marginal runtime overhead.


  • HearLiquid: Nonintrusive Liquid Fraud Detection Using Commodity Acoustic Devices

    by Yanni Yang, Yanwen Wang, Jiannong Cao, Jinlin Chen

    Liquid fraud has plagued people with huge health risks. Liquid fraud detection can help to reduce the risk of liquid hazards. However, existing systems that use biochemical tools or radio frequency signals for liquid sensing are either expensive, intrusive, or inconvenient for public use. In this article, we propose HearLiquid, a low-cost and nonintrusive liquid fraud detection system using commodity acoustic devices. Our insight comes from the fact that acoustic impedance of different liquids results in distinct absorption of the acoustic signal across different frequencies when it travels through the liquid. In specific, we extract the liquid’s acoustic absorption and transmission curve (AATC) over multiple frequencies of the acoustic signal for liquid fraud detection. However, accurately measuring the AATC faces multiple challenges. First, due to the hardware diversity and imperfection, different acoustic devices introduce diverse frequency responses, which brings significant deviations to AATCs of the same liquid. Second, different relative positions between acoustic devices and the liquid container result in variations in the AATC, making the detection result inaccurate. To overcome these challenges, we first calibrate the AATC using a dedicated reference AATC to remove the effect of hardware diversity. To bear the variations in AATCs measured from different relative positions, we apply a well-orchestrated data augmentation technique to automatically generate sufficient AATCs for different positions using a small number of collected data. Finally, AATCs are used to train the liquid detection model. We conduct extensive experiments on many important liquid fraud cases and achieve liquid detection accuracy of 92%–97%.