← Search

Hengzhu Liu

6 accepted papers

2025

Anchor-Prompt-based Segmentation and Embedding Model

ICASSP 2025accepted

Tackling multi-object tracking and segmentation (MOTS) can be attributed to a multi-task learning task, i.e., performing Segmentation and Identity Embedding jointly (SIEJ). Unfortunately, achieving optimal SIEJ is non-trivial, as it relies on different spatiotemporal features of objects. Besides, th…

Cited by 0SourceScholar
2025

Multi-layer Network Disintegration via Deep Reinforcement Learning

ICASSP 2025accepted

Multi-layer networks (MLN) effectively model interactions across layers, and the network disintegration (ND) problem yields significant importance in the analysis of MLN. Unfortunately, previous advances in ND for single-layer networks exhibits inefficiency and lack of scalability when extended to M…

Cited by 0SourceScholar
2024

Radar Recognition in the Wild: Enhancing Radar Emitter Recognition through Auto-Correlation Model-Agnostic Meta Learning

ICASSP 2024accepted

In Electronic Support Measure (ESM) systems, the recognition of radar emitters stands as a pivotal yet intricate task. The complex electromagnetic environments, however, often hinders the collection of clean radar signal data, and results in data with different noise levels. Consequently, formulatin…

Cited by 0SourceScholar
2024

Unraveling Explainable Reinforcement Learning Using Behavior Tree Structures

ICASSP 2024accepted

The black-box characteristic of deep reinforcement learning restricts the safe and scalable application of decision models in practical deployment. Existing interpretability methods for deep reinforcement learning models are often inadequate in providing comprehensive insights and generating logical…

Cited by 0SourceScholar
2023

Collision-free Coverage Path Planning for the Variable-speed Curvature-constrained Robot

ICRA 2023poster

Dubins coverage has been extensively researched to address the coverage path planning (CPP) problem of a known environment for the curvature-constrained robot. However, its fixed-speed assumption prevents the robot from accelerating to reduce the time and limits its flexibility to avoid obstacles. T…

Cited by 2SourceScholar
2018

Learning for Disparity Estimation Through Feature Constancy

CVPR 2018poster

Stereo matching algorithms usually consist of four steps, including matching cost calculation, matching cost aggregation, disparity calculation, and disparity refinement. Existing CNN-based methods only adopt CNN to solve parts of the four steps, or use different networks to deal with different step…