Victor O.K. Li

Victor O.K. Li


Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 May 2018 in EURASIP Journal on Wireless Communications and Networking
Verified
Journal Article
Open access
PDF file
YMYijie Mao
Yijie Mao
BCBruno Clerckx
Bruno Clerckx
VLVictor O.K. Li
Victor O.K. Li
Space-division multiple access (SDMA) utilizes linear precoding to separate users in the spatial domain and relies on fully treating any residual multi-user interference as noise. Non-orthogonal multiple access (NOMA) uses linearly precoded superposition coding with successive interference cancellation (SIC) to superpose users in the power domain and relies on user grouping and ordering to enforce some users to fully decode and cancel interference created by other users. In this paper, we argue that to efficiently cope with the high throughput, heterogeneity of quality of service (QoS), and massive connectivity requirements of future multi-antenna wireless networks, multiple access design needs to depart from those two extreme interference management strategies, namely fully treat interference as noise (as in SDMA) and fully decode interference (as in NOMA). Considering a multiple-input single-output broadcast channel, we develop a novel multiple access framework, called rate-splitting multiple access (RSMA). RSMA is a more general and more powerful multiple access for downlink multi-antenna systems that contains SDMA and NOMA as special cases. RSMA relies on linearly precoded rate-splitting with SIC to decode part of the interference and treat the remaining part of the interference as noise. This capability of RSMA to partially decode interference and partially treat interference as noise enables to softly bridge the two extremes of fully decoding interference and treating interference as noise and provides room for rate and QoS enhancements and complexity reduction. The three multiple access schemes are compared, and extensive numerical results show that RSMA provides a smooth transition between SDMA and NOMA and outperforms them both in a wide range of network loads (underloaded and overloaded regimes) and user deployments (with a diversity of channel directions, channel strengths, and qualities of channel state information at the transmitter). Moreover, RSMA provides rate and QoS enhancements over NOMA at a lower computational complexity for the transmit scheduler and the receivers (number of SIC layers).

12 February 2012 in Memetic Computing
Verified
Journal Article
Open access
PDF file
Albert Y.S. LamAlbert Y.S. Lam
Albert Y.S. Lam
VLVictor O.K. Li
Victor O.K. Li
Chemical Reaction Optimization (CRO) is a recently established metaheuristics for optimization, inspired by the nature of chemical reactions. A chemical reaction is a natural process of transforming the unstable substances to the stable ones. In microscopic view, a chemical reaction starts with some unstable molecules with excessive energy. The molecules interact with each other through a sequence of elementary reactions. At the end, they are converted to those with minimum energy to support their existence. This property is embedded in CRO to solve optimization problems. CRO can be applied to tackle problems in both the discrete and continuous domains. We have successfully exploited CRO to solve a broad range of engineering problems, including the quadratic assignment problem, neural network training, multimodal continuous problems, etc. The simulation results demonstrate that CRO has superior performance when compared with other existing optimization algorithms. This tutorial aims to assist the readers in implementing CRO to solve their problems. It also serves as a technical overview of the current development of CRO and provides potential future research directions.

23 June 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YMYijie Mao
Yijie Mao
BCBruno Clerckx
Bruno Clerckx
JZJian Zhang
Jian Zhang
VLVictor O.K. Li
Victor O.K. Li
MAMohammed Amer Arafah
Mohammed Amer Arafah
Cooperative Rate-Splitting (CRS) strategy, relying on linearly precoded rate-splitting at the transmitter and opportunistic transmission of the common message by the relaying user, has recently been shown to outperform typical Non-cooperative Rate-Splitting (NRS), Cooperative Non-Orthogonal Multiple Access (C-NOMA) and Space Division Multiple Access (SDMA) in a two-user Multiple Input Single Output (MISO) Broadcast Channel (BC) with user relaying. In this work, the existing two-user CRS transmission strategy is generalized to the K-user case. We study the problem of jointly optimizing the precoders, message split, time slot allocation, and relaying user scheduling with the objective of maximizing the minimum rate among users subject to a transmit power constraint at the base station. As the user scheduling problem is discrete and the entire problem is non-convex, we propose a two-stage low-complexity algorithm to solve the problem. Both centralized and decentralized relaying protocols based on selecting K1 (K1<K) strongest users are first proposed followed by a Successive Convex Approximation (SCA)-based algorithm to jointly optimize the time slot, precoders and message split. Numerical results show that by applying the proposed two-stage algorithm, the worst-case achievable rate achieved by CRS is significantly increased over that of NRS and SDMA in a wide range of network loads (underloaded and overloaded regimes) and user deployments (with a diversity of channel strengths). Importantly, the proposed SCA-based algorithm dramatically reduces the computational complexity without any rate loss compared with the conventional algorithm in the literature of CRS. Therefore, we conclude that the proposed K-user CRS combined with the two-stage algorithm is more powerful than the existing transmission schemes.

10 July 2019 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
KCKai-Fung Chu
Kai-Fung Chu
Albert Y.S. LamAlbert Y.S. Lam
Albert Y.S. Lam
VLVictor O.K. Li
Victor O.K. Li
Advancements in sensing and the Internet of Things (IoT) technologies generate a huge amount of data. Mobility on demand (MoD) service benefits from the availability of big data in the intelligent transportation system. Given the future travel demand or origin-destination (OD) flows prediction, service providers can pre-allocate unoccupied vehicles to the customers' origins of service to reduce waiting time. Traditional approaches on future travel demand and the OD flows predictions rely on statistical or machine learning methods. Inspired by deep learning techniques for image and video processing, through regarding localized travel demands as image pixels, a novel deep learning model called multi-scale convolutional long short-term memory network (MultiConvLSTM) is developed in this paper. Rather than using the traditional OD matrix which may lead to loss of geographical information, we propose a new data structure, called OD tensor to represent OD flows, and a manipulation method, called OD tensor permutation and matricization, is introduced to handle the high dimensionality features of OD tensor. MultiConvLSTM considers both temporal and spatial correlations to predict the future travel demand and OD flows. Experiments on real-world New York taxi data of around 400 million records are performed. Our results show that the MultiConvLSTM achieves the highest accuracy in both one-step and multiple-step predictions and it outperforms the existing methods for travel demand and OD flow predictions.

23 May 2022 in IEEE Access
Verified
Journal Article
Open access
QZQi Zhang
Qi Zhang
YHYang Han
Yang Han
VLVictor O.K. Li
Victor O.K. Li
JLJacqueline C. K. Lam
Jacqueline C. K. Lam
Air pollution presents a serious health challenge in urban metropolises. While accurately monitoring and forecasting air pollution are highly crucial, existing data-driven models have yet fully captured the complex interactions between the temporal characteristics of air pollution and the spatial characteristics of urban dynamics. Our proposed Deep-AIR fills this gap to provide fine-grained city-wide air pollution estimation and station-wide forecast, by exploiting domain-specific features (including Air Pollution, Weather, Urban Morphology, Transport, and Time-sensitive features), with a hybrid CNN-LSTM structure to capture the spatio-temporal features, and $1\times 1$ convolution layers to enhance the learning of temporal and spatial interaction. Deep-AIR outperforms compatible baselines by a higher accuracy of 1.5%, 2.7%, and 2.3% for Hong Kong and 1.4%, 1.4% and 3.3% for Beijing in fine-grained 1-hr pollution estimation, and 1-hr and 24-hr forecasts, respectively. Saliency analysis reveals that for Hong Kong, spatial features, including street canyon and road density, are the best predictors for NO 2 , while temporal features, including historical air pollutants and weather, are the best predictors for PM 2.5 . For Beijing, historical air pollutant data, traffic congestion, wind direction and seasonal indicator are the best predictors for all pollutants. PM 10 in Hong Kong is achieving the best estimation and forecast accuracy, whilst CO in Beijing is achieving the best results.

10 January 2022 in Scientific Reports
Verified
Journal Article
Open access
PDF file
AWAndong Wang
Andong Wang
QZQi Zhang
Qi Zhang
YHYang Han
Yang Han
SMSean Megason
Sean Megason
SHSahand Hormoz
Sahand Hormoz
VLVictor O.K. Li
Victor O.K. Li
Cell segmentation plays a crucial role in understanding, diagnosing, and treating diseases. Despite the recent success of deep learning-based cell segmentation methods, it remains challenging to accurately segment densely packed cells in 3D cell membrane images. Existing approaches also require fine-tuning multiple manually selected hyperparameters on the new datasets. We develop a deep learning-based 3D cell segmentation pipeline, 3DCellSeg, to address these challenges. Compared to the existing methods, our approach carries the following novelties: (1) a robust two-stage pipeline, requiring only one hyperparameter; (2) a light-weight deep convolutional neural network (3DCellSegNet) to efficiently output voxel-wise masks; (3) a custom loss function (3DCellSeg Loss) to tackle the clumped cell problem; and (4) an efficient touching area-based clustering algorithm (TASCAN) to separate 3D cells from the foreground masks. Cell segmentation experiments conducted on four different cell datasets show that 3DCellSeg outperforms the baseline models on the ATAS (plant), HMS (animal), and LRP (plant) datasets with an overall accuracy of 95.6%, 76.4%, and 74.7%, respectively, while achieving an accuracy comparable to the baselines on the Ovules (plant) dataset with an overall accuracy of 82.2%. Ablation studies show that the individual improvements in accuracy is attributable to 3DCellSegNet, 3DCellSeg Loss, and TASCAN, with the 3DCellSeg demonstrating robustness across different datasets and cell shapes. Our results suggest that 3DCellSeg can serve a powerful biomedical and clinical tool, such as histo-pathological image analysis, for cancer diagnosis and grading.