arXiv subjects

Li Fan

Publications and source records attributed to Li Fan.

At least 37 records · Page 2Linked to original sources

arXiv2024

Decision Feedback In-Context Symbol Detection over Block-Fading Channels

Pre-trained Transformers, through in-context learning (ICL), have demonstrated exceptional capabilities to adapt to new tasks using example prompts \textit{without model update}. Transformer-based wireless receivers, where prompts consist of the pilot data in the form of transmitted and received signal pairs, have shown high estimation accuracy when pilot data are abundant. However, pilot information is often costly and limited in practice. In this work, we propose the \underline{DE}cision \underline{F}eedback \underline{IN}-Cont\underline{E}xt \underline{D}etection (DEFINED) solution as a new wireless receiver design, which bypasses channel estimation and directly performs symbol detection using the (sometimes extremely) limited pilot data. The key innovation in DEFINED is the proposed decision feedback mechanism in ICL, where we sequentially incorporate the detected symbols into the prompts to improve the detections for subsequent symbols. Extensive experiments across a broad range of wireless communication settings demonstrate that DEFINED achieves significant performance improvements, in some cases only needing a single pilot pair.

cs.IT↗

arXiv2024

A New Era in Human Factors Engineering: A Survey of the Applications and Prospects of Large Multimodal Models

In recent years, the potential applications of Large Multimodal Models (LMMs) in fields such as healthcare, social psychology, and industrial design have attracted wide research attention, providing new directions for human factors research. For instance, LMM-based smart systems have become novel research subjects of human factors studies, and LMM introduces new research paradigms and methodologies to this field. Therefore, this paper aims to explore the applications, challenges, and future prospects of LMM in the domain of human factors and ergonomics through an expert-LMM collaborated literature review. Specifically, a novel literature review method is proposed, and research studies of LMM-based accident analysis, human modelling and intervention design are introduced. Subsequently, the paper discusses future trends of the research paradigm and challenges of human factors and ergonomics studies in the era of LMMs. It is expected that this study can provide a valuable perspective and serve as a reference for integrating human factors with artificial intelligence.

cs.HC↗

arXiv2024

Skeleton Supervised Airway Segmentation

Fully-supervised airway segmentation has accomplished significant triumphs over the years in aiding pre-operative diagnosis and intra-operative navigation. However, full voxel-level annotation constitutes a labor-intensive and time-consuming task, often plagued by issues such as missing branches, branch annotation discontinuity, or erroneous edge delineation. label-efficient solutions for airway extraction are rarely explored yet primarily demanding in medical practice. To this end, we introduce a novel skeleton-level annotation (SkA) tailored to the airway, which simplifies the annotation workflow while enhancing annotation consistency and accuracy, preserving the complete topology. Furthermore, we propose a skeleton-supervised learning framework to achieve accurate airway segmentation. Firstly, a dual-stream buffer inference is introduced to realize initial label propagation from SkA, avoiding the collapse of direct learning from SkA. Then, we construct a geometry-aware dual-path propagation framework (GDP) to further promote complementary propagation learning, composed of hard geometry-aware propagation learning and soft geometry-aware propagation guidance. Experiments reveal that our proposed framework outperforms the competing methods with SKA, which amounts to only 1.96% airways, and achieves comparable performance with the baseline model that is fully supervised with 100% airways, demonstrating its significant potential in achieving label-efficient segmentation for other tubular structures, such as vessels.

cs.CV↗

arXiv2023

Federated Linear Bandits with Finite Adversarial Actions

We study a federated linear bandits model, where $M$ clients communicate with a central server to solve a linear contextual bandits problem with finite adversarial action sets that may be different across clients. To address the unique challenges of adversarial finite action sets, we propose the FedSupLinUCB algorithm, which extends the principles of SupLinUCB and OFUL algorithms in linear contextual bandits. We prove that FedSupLinUCB achieves a total regret of $\tilde{O}(\sqrt{d T})$, where $T$ is the total number of arm pulls from all clients, and $d$ is the ambient dimension of the linear model. This matches the minimax lower bound and thus is order-optimal (up to polylog terms). We study both asynchronous and synchronous cases and show that the communication cost can be controlled as $O(d M^2 \log(d)\log(T))$ and $O(\sqrt{d^3 M^3} \log(d))$, respectively. The FedSupLinUCB design is further extended to two scenarios: (1) variance-adaptive, where a total regret of $\tilde{O} (\sqrt{d \sum \nolimits_{t=1}^{T} σ_t^2})$ can be achieved with $σ_t^2$ being the noise variance of round $t$; and (2) adversarial corruption, where a total regret of $\tilde{O}(\sqrt{dT} + d C_p)$ can be achieved with $C_p$ being the total corruption budget. Experiment results corroborate the theoretical analysis and demonstrate the effectiveness of FedSupLinUCB on both synthetic and real-world datasets.

cs.LG↗

arXiv2023

Using Neural Networks for Fast SAR Roughness Estimation of High Resolution Images

The analysis of Synthetic Aperture Radar (SAR) imagery is an important step in remote sensing applications, and it is a challenging problem due to its inherent speckle noise. One typical solution is to model the data using the $G_I^0$ distribution and extract its roughness information, which in turn can be used in posterior imaging tasks, such as segmentation, classification and interpretation. This leads to the need of quick and reliable estimation of the roughness parameter from SAR data, especially with high resolution images. Unfortunately, traditional parameter estimation procedures are slow and prone to estimation failures. In this work, we proposed a neural network-based estimation framework that first learns how to predict underlying parameters of $G_I^0$ samples and then can be used to estimate the roughness of unseen data. We show that this approach leads to an estimator that is quicker, yields less estimation error and is less prone to failures than the traditional estimation procedures for this problem, even when we use a simple network. More importantly, we show that this same methodology can be generalized to handle image inputs and, even if trained on purely synthetic data for a few seconds, is able to perform real time pixel-wise roughness estimation for high resolution real SAR imagery.

cs.CV↗

arXiv2023

Topological model for q-deformed rational number and categorification

Let $\mathbf{D}_{3}$ be a bigraded 3-decorated disk with an arc system $\mathbf{A}$. We associate a bigraded simple closed arc $\widehatη_{\frac{r}{s}}$ on $\mathbf{D}_{3}$ to any rational number $\frac{r}{s}\in\overline{\mathbb{Q}}=\mathbb{Q}\cup\{\infty\}$. We show that the right (resp. left) $q$-deformed rational numbers associated to $\frac{r}{s}$, in the sense of Morier-Genoud-Ovsienko (resp. Bapat-Becker-Licata) can be naturally calculated by the $\mathfrak{q}$-intersection between $\widehatη_{\frac{r}{s}}$ and $\mathbf{A}$ (resp. dual arc system $\mathbf{A}^*$). The Jones polynomials of rational knots can be also given by such intersections. Moreover, the categorification of $\widehatη_{\frac{r}{s}}$ is given by the spherical object $X_{\frac{r}{s}}$ in the Calabi-Yau-$\mathbb{X}$ category of Ginzburg dga of type $A_2$. Reduce to CY-2 case, we recover result of Bapat-Becker-Licata with a slight improvement.

math.RT↗

arXiv2023

GDDS: Pulmonary Bronchioles Segmentation with Group Deep Dense Supervision

Airway segmentation, especially bronchioles segmentation, is an important but challenging task because distal bronchus are sparsely distributed and of a fine scale. Existing neural networks usually exploit sparse topology to learn the connectivity of bronchioles and inefficient shallow features to capture such high-frequency information, leading to the breakage or missed detection of individual thin branches. To address these problems, we contribute a new bronchial segmentation method based on Group Deep Dense Supervision (GDDS) that emphasizes fine-scale bronchioles segmentation in a simple-but-effective manner. First, Deep Dense Supervision (DDS) is proposed by constructing local dense topology skillfully and implementing dense topological learning on a specific shallow feature layer. GDDS further empowers the shallow features with better perception ability to detect bronchioles, even the ones that are not easily discernible to the naked eye. Extensive experiments on the BAS benchmark dataset have shown that our method promotes the network to have a high sensitivity in capturing fine-scale branches and outperforms state-of-the-art methods by a large margin (+12.8 % in BD and +8.8 % in TD) while only introducing a small number of extra parameters.

cs.CV↗

arXiv2022

Conformal Navigation Transformations with Application to Robot Navigation in Complex Workspaces

Navigation functions provide both path and motion planning, which can be used to ensure obstacle avoidance and convergence in the sphere world. When dealing with complex and realistic scenarios, constructing a transformation to the sphere world is essential and, at the same time, challenging. This work proposes a novel transformation termed the conformal navigation transformation to achieve collision-free navigation of a robot in a workspace populated with obstacles of arbitrary shapes. The properties of the conformal navigation transformation, including uniqueness, invariance of navigation properties, and no angular deformation, are investigated, which contribute to the solution of the robot navigation problem in complex environments. Based on navigation functions and the proposed transformation, feedback controllers are derived for the automatic guidance and motion control of kinematic and dynamic mobile robots. Moreover, an iterative method is proposed to construct the conformal navigation transformation in a multiply-connected workspace, which transforms the multiply-connected problem into multiple simply-connected problems to achieve fast convergence. In addition to the analytic guarantees, simulation studies verify the effectiveness of the proposed methodology in workspaces with non-trivial obstacles.

cs.RO↗

arXiv2022

Mobile Robot Navigation in Complex Polygonal Workspaces Using Conformal Navigation Transformations

This work proposes a novel transformation termed the conformal navigation transformation to achieve collision-free navigation of a robot in a workspace populated with arbitrary polygonal obstacles. The properties of the conformal navigation transformation in the polygonal workspace are investigated in this work as well as its capability to provide a solution to the navigation problem. %The properties of the conformal navigation transformation are investigated, which contribute to the solution of the robot navigation problem in complex polygonal environments. %which facilitates the navigation of robots in complex environments. The definition of the navigation function is generalized to accommodate non-smooth obstacle boundaries. Based on the proposed transformation and the generalized navigation function, a provably correct feedback controller is derived for the automatic guidance and motion control of the kinematic mobile robot. Moreover, an iterative method is proposed to construct the conformal navigation transformation in a multi-connected polygonal workspace, which transforms the multi-connected problem into multiple single-connected problems to achieve fast convergence.In addition to the analytic guarantees, the simulation study verifies the effectiveness of the proposed methodology in a workspace with non-trivial polygonal obstacles.

cs.RO↗

arXiv2021

PENet: Towards Precise and Efficient Image Guided Depth Completion

Image guided depth completion is the task of generating a dense depth map from a sparse depth map and a high quality image. In this task, how to fuse the color and depth modalities plays an important role in achieving good performance. This paper proposes a two-branch backbone that consists of a color-dominant branch and a depth-dominant branch to exploit and fuse two modalities thoroughly. More specifically, one branch inputs a color image and a sparse depth map to predict a dense depth map. The other branch takes as inputs the sparse depth map and the previously predicted depth map, and outputs a dense depth map as well. The depth maps predicted from two branches are complimentary to each other and therefore they are adaptively fused. In addition, we also propose a simple geometric convolutional layer to encode 3D geometric cues. The geometric encoded backbone conducts the fusion of different modalities at multiple stages, leading to good depth completion results. We further implement a dilated and accelerated CSPN++ to refine the fused depth map efficiently. The proposed full model ranks 1st in the KITTI depth completion online leaderboard at the time of submission. It also infers much faster than most of the top ranked methods. The code of this work is available at https://github.com/JUGGHM/PENet_ICRA2021.

cs.CV↗

arXiv2019

FDD Massive MIMO Uplink and Downlink Channel Reciprocity Properties: Full or Partial Reciprocity?

One challenge for FDD massive MIMO communication system is how to obtain the downlink channel state information (CSI) at the base station. Except for traditional codebook feedback through uplink pilot transmission, some channel reciprocity properties can be utilized through uplink channel estimation and channel parameter estimation algorithms. In this paper, the uplink and downlink channel reciprocity properties are analyzed. It is theoretically proved that not all multipath parameters for FDD downlink and uplink channels are equivalent. Therefore, the so called full reciprocity property does not hold while the partial reciprocity property holds. Moreover, the channel measurement campaign is conducted to verify our theoretical analysis. Finally, in order to support the partial reciprocity property, the revision for the standardization 5G channel model is proposed as well. With the contribution of this paper, the FDD massive MIMO system transmission scheme design could be led to the right direction.

cs.IT↗

arXiv2018

Spectrum-Adapted Polynomial Approximation for Matrix Functions

We propose and investigate two new methods to approximate $f({\bf A}){\bf b}$ for large, sparse, Hermitian matrices ${\bf A}$. The main idea behind both methods is to first estimate the spectral density of ${\bf A}$, and then find polynomials of a fixed order that better approximate the function $f$ on areas of the spectrum with a higher density of eigenvalues. Compared to state-of-the-art methods such as the Lanczos method and truncated Chebyshev expansion, the proposed methods tend to provide more accurate approximations of $f({\bf A}){\bf b}$ at lower polynomial orders, and for matrices ${\bf A}$ with a large number of distinct interior eigenvalues and a small spectral width.

math.NA↗

arXiv2015

Uplink Achievable Rate for Massive MIMO with Low-Resolution ADC

In this letter, we derive an approximate analytical expression for the uplink achievable rate of a massive multi-input multi-output (MIMO) antenna system when finite precision analog-digital converters (ADCs) and the common maximal ratio combining technique are used at the receivers. To obtain this expression, we treat quantization noise as an additive quantization noise model. Considering the obtained expression, we show that low-resolution ADCs lead to a decrease in the achievable rate but the performance loss can be compensated by increasing the number of receiving antennas. In addition, we investigate the relation between the number of antennas and the ADC resolution, as well as the power-scaling law. These discussions support the feasibility of equipping highly economical ADCs with low resolution in practical massive MIMO systems.

cs.IT↗

arXiv2015

Time Dependent Scattering from a Grating

Computing the electromagnetic field due to a periodic grating is critical for assessing the performance of thin film solar voltaic devices. In this paper we investigate the computation of these fields in the time domain (similar problems also arise in simulating antennas). Assuming a translation invariant periodic grating this reduces to solving the wave equation in a periodic domain. Materials used in practical devices have frequency dependent coefficients, and we provide a first proof of existence and uniqueness for a general class of such materials. Using Convolution Quadrature we can then prove time stepping error estimates. We end with some preliminary numerical results that demonstrate the convergence and stability of the scheme.

math.NA↗

arXiv2014

Rapidly reconfigurable radio-frequency arbitrary waveforms synthesized on a CMOS photonic chip

Photonic methods of radio-frequency waveform generation and processing provide performance and flexibility over electronic methods due to the ultrawide bandwidth offered by the optical carriers. However, they suffer from lack of integration and slow reconfiguration speed. Here we propose an architecture of integrated photonic RF waveform generation and processing, and implement it on a silicon chip fabricated in a semiconductor manufacturing foundry. Our device can generate programmable RF bursts or continuous waveforms with only the light source, electrical drives/controls and detectors being off chip. It turns on and off an individual pulse in the RF burst within 4 nanoseconds, achieving a reconfiguration speed three orders of magnitude faster than thermal tuning. The on-chip optical delay elements offers an integrated approach to accurately manipulate individual RF waveform features without constrains set by the speed and timing jitter of electronics, and should find broad applications ranging from high-speed wireless to defense electronics.

physics.optics↗

arXiv2013

Drop-port study of microresonator frequency combs: power transfer and time-domain characterization

We use a drop-port geometry to study power transfer in silicon nitride on-chip microresonator frequency comb generators. In sharp contrast with the traditional transmission geometry, we observe smooth output spectra with comparable powers in the pump and adjacent comb lines. An observation of saturation in the drop-port output power is explained semi-empirically by introducing pump saturation into a coupling of modes model. Autocorrelation measurements are performed on the drop-port output, without the need to filter out or suppress the strong pump line as is necessary in thru-port experiments. Passively mode-locked pulses are observed with a normal dispersion microcavity.

physics.optics↗

arXiv2013

Priority-aware Gray-box Placement of Virtual Machines in Cloud Platforms

Virtual machine (VM) placement is very important for cloud platforms. While techniques, such as live virtual machine migration, are very useful to balance the load in the data centers, they are expensive operations. In this position paper, we propose to minimize the chance of the load hot spots in the data center by applying the workload patterns of the VMs in the virtual machine placement algorithms - place VMs that require a lot of same type of resource across different physical servers. In this way, the resource competition of VMs on the same physical server is significantly mitigated. Meanwhile, we also consider the priorities of applications and VMs in our virtual machine placement algorithms.

cs.NI↗

arXiv2012

A Silicon Optical Transistor

A fundamental road block for all-optical information processing is the difficulty in realizing a silicon optical transistor with the ability to provide optical gain, input output isolation and buffer action. In this work, we demonstrate an all-optical transistor using optical nonlinearity in microrings. By using weak light to control strong light, we observed an On/Off ratio up to 20 dB. It can compensate losses in other optical devices and provide fan-out capability. The device is ultra compact and is compatible with current complementary metal-oxide-semiconductor (CMOS) processing.

physics.optics↗