arXiv subjects

Wen Ji

Publications and source records attributed to Wen Ji.

27 records · Page 2Linked to original sources

arXiv2023

Trip-based mobile sensor deployment for drive-by sensing with bus fleets

Drive-by sensing (i.e. vehicle-based mobile sensing) is an emerging data collection paradigm that leverages vehicle mobilities to scan a city at low costs. It represents a positive social externality of urban transport activities. Bus transit systems are widely considered in drive-by sensing due to extensive spatial coverage, reliable operations, and low maintenance costs. It is critical for the underlying monitoring scenario (e.g. air quality, traffic state, and road roughness) to assign a limited number of sensors to a bus fleet to ensure their optimal spatial-temporal distribution. In this paper we present a trip-based sensor deployment problem, which explicitly considers timetabled trips that must be executed by the fleet while a portion of them perform sensing tasks. To address the computational challenge in large-scale instances, we design a multi-stage solution framework that decouples the spatial-temporal structures of the sensing task through line pre-selection and bi-level optimization. As a result, the computational complexity is reduced to be sub-linear w.r.t. the number of lines, rather than combinatorial w.r.t. the number of buses in existing vehicle-based approaches. A real-world case study covering 400 km$^2$ in central Chengdu demonstrates the effectiveness of the model in solving large-scale problems. It is found that coordinating bus scheduling and sensing tasks can substantially increase the spatial-temporal sensing coverage. We also provide a few model extensions and recommendation for practice regarding the application of this method.

math.OC↗

arXiv2023

An accuracy-enhanced transonic flow prediction method fusing deep learning and reduced-order model

It's difficult to accurately predict the flow with shock waves over an aircraft due to the flow's strongly nonlinear characteristics. In this study, we propose an accuracy-enhanced flow prediction method that fuses deep learning and reduced-order model to achieve fast flow field prediction for various aerodynamic shapes. First, we establish the convolutional neural network-proper orthogonal decomposition (CNN-POD) model for mapping geometries to the entire flow field. Next, local flow regions containing nonlinear flow structures are identified through POD reconstruction for enhanced modeling. Then, a new CNN model is employed to map geometries to the local flow field. The proposed method is finally applied in predicting transonic flow over airfoils. The results indicate that the proposed enhanced DNN method can reduce the prediction error of flow properties, particularly in the regions with shock waves (up to 13%-46%). Additionally, the better efficiency and robustness of the proposed methods have been validated in comparison to existing methods.

physics.flu-dyn↗

arXiv2023

Mixed-Precision Neural Network Quantization via Learned Layer-wise Importance

The exponentially large discrete search space in mixed-precision quantization (MPQ) makes it hard to determine the optimal bit-width for each layer. Previous works usually resort to iterative search methods on the training set, which consume hundreds or even thousands of GPU-hours. In this study, we reveal that some unique learnable parameters in quantization, namely the scale factors in the quantizer, can serve as importance indicators of a layer, reflecting the contribution of that layer to the final accuracy at certain bit-widths. These importance indicators naturally perceive the numerical transformation during quantization-aware training, which can precisely provide quantization sensitivity metrics of layers. However, a deep network always contains hundreds of such indicators, and training them one by one would lead to an excessive time cost. To overcome this issue, we propose a joint training scheme that can obtain all indicators at once. It considerably speeds up the indicators training process by parallelizing the original sequential training processes. With these learned importance indicators, we formulate the MPQ search problem as a one-time integer linear programming (ILP) problem. That avoids the iterative search and significantly reduces search time without limiting the bit-width search space. For example, MPQ search on ResNet18 with our indicators takes only 0.06 s, which improves time efficiency exponentially compared to iterative search methods. Also, extensive experiments show our approach can achieve SOTA accuracy on ImageNet for far-ranging models with various constraints (e.g., BitOps, compress rate). Code is available on https://github.com/1hunters/LIMPQ.

cs.LG↗

arXiv2022

Transformers in Medical Image Analysis: A Review

Transformers have dominated the field of natural language processing, and recently impacted the computer vision area. In the field of medical image analysis, Transformers have also been successfully applied to full-stack clinical applications, including image synthesis/reconstruction, registration, segmentation, detection, and diagnosis. Our paper aims to promote awareness and application of Transformers in the field of medical image analysis. Specifically, we first overview the core concepts of the attention mechanism built into Transformers and other basic components. Second, we review various Transformer architectures tailored for medical image applications and discuss their limitations. Within this review, we investigate key challenges revolving around the use of Transformers in different learning paradigms, improving the model efficiency, and their coupling with other techniques. We hope this review can give a comprehensive picture of Transformers to the readers in the field of medical image analysis.

cs.CV↗

arXiv2021

Cross-Modality Brain Tumor Segmentation via Bidirectional Global-to-Local Unsupervised Domain Adaptation

Accurate segmentation of brain tumors from multi-modal Magnetic Resonance (MR) images is essential in brain tumor diagnosis and treatment. However, due to the existence of domain shifts among different modalities, the performance of networks decreases dramatically when training on one modality and performing on another, e.g., train on T1 image while performing on T2 image, which is often required in clinical applications. This also prohibits a network from being trained on labeled data and then transferred to unlabeled data from a different domain. To overcome this, unsupervised domain adaptation (UDA) methods provide effective solutions to alleviate the domain shift between labeled source data and unlabeled target data. In this paper, we propose a novel Bidirectional Global-to-Local (BiGL) adaptation framework under a UDA scheme. Specifically, a bidirectional image synthesis and segmentation module is proposed to segment the brain tumor using the intermediate data distributions generated for the two domains, which includes an image-to-image translator and a shared-weighted segmentation network. Further, a global-to-local consistency learning module is proposed to build robust representation alignments in an integrated way. Extensive experiments on a multi-modal brain MR benchmark dataset demonstrate that the proposed method outperforms several state-of-the-art unsupervised domain adaptation methods by a large margin, while a comprehensive ablation study validates the effectiveness of each key component. The implementation code of our method will be released at \url{https://github.com/KeleiHe/BiGL}.

cs.CV↗

arXiv2020

Unsupervised Domain Attention Adaptation Network for Caricature Attribute Recognition

Caricature attributes provide distinctive facial features to help research in Psychology and Neuroscience. However, unlike the facial photo attribute datasets that have a quantity of annotated images, the annotations of caricature attributes are rare. To facility the research in attribute learning of caricatures, we propose a caricature attribute dataset, namely WebCariA. Moreover, to utilize models that trained by face attributes, we propose a novel unsupervised domain adaptation framework for cross-modality (i.e., photos to caricatures) attribute recognition, with an integrated inter- and intra-domain consistency learning scheme. Specifically, the inter-domain consistency learning scheme consisting an image-to-image translator to first fill the domain gap between photos and caricatures by generating intermediate image samples, and a label consistency learning module to align their semantic information. The intra-domain consistency learning scheme integrates the common feature consistency learning module with a novel attribute-aware attention-consistency learning module for a more efficient alignment. We did an extensive ablation study to show the effectiveness of the proposed method. And the proposed method also outperforms the state-of-the-art methods by a margin. The implementation of the proposed method is available at https://github.com/KeleiHe/DAAN.

cs.CV↗

arXiv2020

Synergistic Learning of Lung Lobe Segmentation and Hierarchical Multi-Instance Classification for Automated Severity Assessment of COVID-19 in CT Images

Understanding chest CT imaging of the coronavirus disease 2019 (COVID-19) will help detect infections early and assess the disease progression. Especially, automated severity assessment of COVID-19 in CT images plays an essential role in identifying cases that are in great need of intensive clinical care. However, it is often challenging to accurately assess the severity of this disease in CT images, due to variable infection regions in the lungs, similar imaging biomarkers, and large inter-case variations. To this end, we propose a synergistic learning framework for automated severity assessment of COVID-19 in 3D CT images, by jointly performing lung lobe segmentation and multi-instance classification. Considering that only a few infection regions in a CT image are related to the severity assessment, we first represent each input image by a bag that contains a set of 2D image patches (with each cropped from a specific slice). A multi-task multi-instance deep network (called M$^2$UNet) is then developed to assess the severity of COVID-19 patients and also segment the lung lobe simultaneously. Our M$^2$UNet consists of a patch-level encoder, a segmentation sub-network for lung lobe segmentation, and a classification sub-network for severity assessment (with a unique hierarchical multi-instance learning strategy). Here, the context information provided by segmentation can be implicitly employed to improve the performance of severity assessment. Extensive experiments were performed on a real COVID-19 CT image dataset consisting of 666 chest CT images, with results suggesting the effectiveness of our proposed method compared to several state-of-the-art methods.

eess.IV↗

arXiv2016

Geo-Conquesting Based on Graph Analysis for Crowdsourced Metatrails from Mobile Sensing

This article investigates graph analysis for intelligent marketing in smart cities, where metatrails are crowdsourced by mobile sensing for marketing strategies. Unlike most works that focused on client sides, this study is intended for market planning, from the perspective of enterprises. Several novel crowdsourced features based on metatrails, including hotspot networks, crowd transitions, affinity subnetworks, and sequential visiting patterns, are discussed in the article. These smart footprints can reflect crowd preferences and the topology of a site of interest. Marketers can utilize such information for commercial resource planning and deployment. Simulations were conducted to demonstrate the performance. At the end, this study also discusses different scenarios for practical geo-conquesting applications.

cs.HC↗

arXiv2015

Fountain Uncorrectable Sets and Finite-Length Analysis

Decoding performance of Fountain codes for the binary erasure channel (BEC) depends on two aspects. One is the essential code structure, on which stopping set analysis operates. The other is the effect from the channel characteristic, which is difficult to give a precise estimation. To tackle these problems, in this paper, we propose a solution to analyzing the performance of Fountain codes based on the uncorrectable set. We give the condition for Fountain decoding failure over the BEC. Then, we conduct the analysis of uncorrectable set on Fountain codes. Finally, we combine the stopping set and the uncorrectable set to provide the integrated analysis on the performance of Fountain codes for BEC.

cs.IT↗