Hao Liu

Hao Liu

Auto-generated profile, based on publicly available information

Hao Liu

School of Integrated Circuits, Shanghai Jiao Tong University, Shanghai, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
17 January 2025 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
QJQiangqiang Jiang
Qiangqiang Jiang
LZLujie Zheng
Lujie Zheng
YZYu Zhou
Yu Zhou
HLHao Liu
Hao Liu
QKQinglei Kong
Qinglei Kong
CBChen Bo
Chen Bo
With the enormous scale of remote sensing imagery generation, on-orbit computing has become a crucial paradigm to enable near real-time processing. Due to the limited onboard resources and on-orbit power supply, satellite edge computing (SEC) is developed for satellite-ground collaboration, aiding on-orbit computation. However, the intermittent satellite-to-ground transmission link poses an efficiency challenge when collaborating SEC resources. Therefore, this paper proposes a Satellite Edge Computing resource scheduling technique for On-orbit Remote Sensing imagery processing (SECORS). First, we design a remote sensing mission-specific SEC architecture, which involves an offline-online satellite working mode. Subsequently, a computational resource scheduling model (SEC-RSM) is established, including the directed acyclic graph (DAG) model and mathematical problem formulation. Next, to obtain effective scheduling solutions, we develop an end-to-end algorithm leveraging the multi-agent proximal policy optimization and heuristic rule of the earliest finish time (SEC-MPH). Finally, we build a simulation SEC platform to carry out experiments and implement several methods as the comparison including multi-objective evolutionary algorithms, deep reinforcement learning approaches, and the scheme without optimization (baseline). Simulation results show that SECORS achieves 68.87% and 66.60% reductions in time and energy for on-orbit computation. Moreover, our method improves the energy efficiency ratio by three times and achieves high processing capacity with 548 pixels per unit of power (W) and time (ms).

21 November 2024 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
ZZZhigao Zheng
Zhigao Zheng
GWGuojia Wan
Guojia Wan
JJJiawei Jiang
Jiawei Jiang
CHChuang Hu
Chuang Hu
HLHao Liu
Hao Liu
BDBo Du
Bo Du
Finding the triangles of large scale graphs is a fundamental graph mining task in many applications, such as motif detection, microscopic evolution, and link prediction. The recent works on triangle counting can be classified into merge-based or binary search-based paradigms. The merge-based triangle counting paradigm locates the triangles using the set intersection operation, which suffers from the random memory access problem. The binary search-based triangle counting paradigm sets the neighbors of the source vertex of an edge as the lookup array and searches the neighbors of the destination vertex. There are lots of expensive lock operations needed in the binary search-based paradigm, which leads to low thread efficiency. In this paper, we aim to improve the triangle counting efficiency on GPU by designing a lock-free policy named Skiff to implement a hash-based triangle counting algorithm. In Skiff, we first design a hash trie data layout to meet the coalesced memory access model and then propose a lock-free policy to reduce the conflicts of the hash trie. In addition, we use a level array to manage the index of the hash trie to make sure the nodes of the hash trie can be quickly located. Furthermore, we implement a CTA thread organization model to reduce the load imbalance of the real-world graphs. We conducted extensive experiments on NVIDIA GPUs to show the performance of Skiff. The results show that Skiff can achieve a good system performance improvement than the state-of-the-art (SOTA) works.

10 April 2025 in IEEE Access
Verified
Journal Article
Open access
YAYu An
Yu An
QYQingpei Yang
Qingpei Yang
HLHao Liu
Hao Liu
LGLiang Geng
Liang Geng
With the widespread application of Unmanned Aerial Systems (UAS) in the aviation sector, accidents caused by drones have become increasingly frequent. As a result, numerous studies have been conducted by scholars on the risk assessment of UAS accidents. To address the challenge of evaluating the accident risks arising from the ever-changing operational environments and diverse tasks of UAS, this paper proposes a risk prediction framework for UAS accidents based on Heterogeneous Graph Embedding (HGE). By integrating various node attributes and the relationships between different factors, the framework constructs a heterogeneous graph from UAS aviation incident data. The complex heterogeneous relationships are transformed into homogeneous subgraphs through different path patterns, which are used to represent the data. Random walks are performed on each homogeneous subgraph to capture semantic information, and the Skip-Gram method is employed to embed the semantic attention-weighted walk results into high-dimensional vectors. These vectors are then integrated with the original graph embedding vectors to update the representations of incident nodes, enabling accurate prediction of accident severity and risk types. Furthermore, a meta-path-based filter module is designed to evaluate the key factors contributing to UAS accident risk by comparing the contributions of different meta-paths under various path patterns. Experimental results on a UAS incident dataset demonstrate that the proposed method effectively predicts UAS operational risks in real time, achieving an accuracy of 97.56% for accident severity prediction. Additionally, the method provides stable predictions when dealing with complex heterogeneous data. From the perspective of a novel graph structure, this research offers a new approach for the safety management of future UAS systems.

26 June 2025 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
JLJiepan Li
Jiepan Li
HHHe Huang
He Huang
YXYu Xia
Yu Xia
XXXian Xu
Xian Xu
YWYingxin Wu
Yingxin Wu
Danfeng HongDanfeng Hong
Danfeng Hong
With the growing availability of remote sensing (RS) data from diverse platforms, multimodal RS techniques have emerged as a transformative solution for large-scale semantic segmentation. In response, we developed MMSeg-YREB, a specialized framework that integrates complementary RS modalities, such as multispectral and synthetic aperture radar (SAR) data from Sentinel-1/2 sources, to enhance the accuracy and robustness of land use and land cover (LULC) mapping across urban and regional landscapes within the Yangtze River Economic Belt (YREB). By leveraging extensive geographic coverage and heterogeneous data sources, MMSeg-YREB supports a wide range of applications, from precise urban planning to comprehensive environmental monitoring. Utilizing state-of-the-art artificial intelligence (AI) methodologies, this framework aims to develop highly generalizable and scalable semantic segmentation models, driving methodological advancements and accelerating the adoption of Earth observation (EO) technologies across diverse regions. As part of this initiative, the Multimodal Semantic Segmentation challenge, i.e., MMSeg-YREB, is organized in conjunction with the 14th Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing (WHISPERS) 2024. To foster further research and innovation, all datasets and code will be publicly released at https://github.com/danfenghong/Outcome-of-the-2024-IEEE-WHISPERS-MMSeg-YREB-Challenge for the sake of reproducibility, contributing to the broader EO and RS communities.

20 November 2025 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
YPYanhua Pang
Yanhua Pang
GZGuoxu Zhou
Guoxu Zhou
XMXin Meng
Xin Meng
HWHaipeng Wang
Haipeng Wang
HLHao Liu
Hao Liu
CBChen Bo
Chen Bo
Satellite on-orbit remote sensing image intelligent interpretation relies on on-orbit devices with extremely limited computational resources, utilizing advanced neural networks designed through lightweight methodologies to achieve fast and accurate interpretation of on-orbit remote sensing images. Nevertheless, the current design of lightweight neural networks exhibits three salient issues: firstly, the prevailing “one-size-fits-all" network lightweight design pattern is notably inefficient; secondly, there is a deficiency in analysing the impact of lightweight operations on network performance; thirdly, the mutual influence among various lightweight operations is overlooked. To address these issues, firstly, we propose a neural network lightweightability measurement model and its computational method by investigating the effects of various lightweight operations; secondly, we propose a neural network general lightweight design framework (GLD) tailored for satellite on-orbit remote sensing images intelligent interpretation. Specifically, GLD, based on a meta-leaning approach, integrates knowledge distillation (KD), pruning and quantization, three general lightweight technologies, into a framework. It dynamically assesses the distillability, prunability and quantifiability of neural networks, and uses this assessment and uses this as supervision to dynamically jointly optimizes KD, pruning and quantization, making it applicable to various mainstream neural networks; furthermore, we explore the mutual influence among lightweight operations based on GLD; finally, through ablation experiments and comparative experiments, we further verify the effectiveness and superiority of GLD.

1 January 2026 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
SYShuiying Yu
Shuiying Yu
ZYZhixiang Yang
Zhixiang Yang
HLHao Liu
Hao Liu