Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tzu-Chi Liu

dblp:202/0927 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
3since 2021 · last 2026
0000-0003-1819-9022ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
3D vision · 65% Image recognition and object detection · 23% Efficient and distributed learning · 8%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
depth estimation
1.012026
US3Net: Ultralightweight Self-Supervised Stereo Matching Network using Depth-Aware Geometric Soft Occlusion · Int. J. Comput. Vis. 2026
Computer vision › 3D vision › depth estimation
monocular depth estimation
1.012026
US3Net: Ultralightweight Self-Supervised Stereo Matching Network using Depth-Aware Geometric Soft Occlusion · Int. J. Comput. Vis. 2026
Computer vision › 3D vision › stereo vision › stereo matching › deep stereo matching
self-supervised stereo matching
1.012026
US3Net: Ultralightweight Self-Supervised Stereo Matching Network using Depth-Aware Geometric Soft Occlusion · Int. J. Comput. Vis. 2026
Computer vision › 3D vision › stereo vision
stereo matching
1.012026
US3Net: Ultralightweight Self-Supervised Stereo Matching Network using Depth-Aware Geometric Soft Occlusion · Int. J. Comput. Vis. 2026
Computer vision › Image recognition and object detection › object detection
event-based object detection
0.912025
Hierarchical Spatiotemporal Fusion for Event-Visible Object Detection · ICRA 2025
Computer vision › 3D vision
multimodal perception
0.912025
Hierarchical Spatiotemporal Fusion for Event-Visible Object Detection · ICRA 2025
Computer vision › Image recognition and object detection
object detection
0.912025
Hierarchical Spatiotemporal Fusion for Event-Visible Object Detection · ICRA 2025
Machine learning › Efficient and distributed learning › model compression
lightweight neural network
0.312026
US3Net: Ultralightweight Self-Supervised Stereo Matching Network using Depth-Aware Geometric Soft Occlusion · Int. J. Comput. Vis. 2026
Machine learning › Efficient and distributed learning
model compression
0.312026
US3Net: Ultralightweight Self-Supervised Stereo Matching Network using Depth-Aware Geometric Soft Occlusion · Int. J. Comput. Vis. 2026
Robotics › Autonomous driving
perception
0.312025
Hierarchical Spatiotemporal Fusion for Event-Visible Object Detection · ICRA 2025

Methods — techniques the papers use, named apart from their topics

self-supervised learning · 1.0occlusion detection · 1.0temporal feature selection · 0.9gated event accumulation · 0.9adaptive fusion · 0.9
YearPublicationVenuePosition
2026 US3Net: Ultralightweight Self-Supervised Stereo Matching Network using Depth-Aware Geometric Soft Occlusion
abstract
Abstract An ultralightweight self-supervised stereo matching network, called US $$^3$$ 3 Net, which requires only 12K parameters, is designed for efficient and accurate depth estimation using resource-constrained devices. US $$^3$$ 3 Net incorporates two key innovations: a low-complexity feature extraction module and a soft occlusion detection approach for performance improvement. First, we design a low-complexity feature extraction module to reduce the computational burden while preserving structural details necessary for stereo matching. By refining the encoder backbone and aggregation module, our design ensures a better balance between model complexity and accuracy. Second, to address occlusion-related errors in disparity estimation, we propose a novel occlusion detection method, called Depth-Aware Geometric Soft Occlusion (DAGSO), to adaptively define the occlusion confidence scores based on depth information. DAGSO can effectively mitigate false occlusions in distant regions and can improve the accuracy of disparity estimation. Experimental results using KITTI datasets demonstrate that US $$^3$$ 3 Net achieves state-of-the-art performance in terms of model complexity and depth estimation accuracy. It outperforms previous self-supervised stereo matching methods and monocular depth estimation methods in metrics such as AbsRel, SqRel, RMSE, and RMSElog at a reduction of parameter size by 47% compared with ES $$^3$$ 3 Net (23K). This makes US $$^3$$ 3 Net a practical solution for real-time depth estimation on edge devices such as drones and autonomous systems. Code is available at: https://github.com/g830319ag/US3Net.
Po-Chung Jen, Tzu-Chi Liu, I-Sheng Fang, Hsiao-Chieh Wen, Chia-Lun Hsu, Ping-Yang Chen, Chang-Hsing Lee, Yong-Sheng Chen
Int. J. Comput. Vis.2
2025 Hierarchical Spatiotemporal Fusion for Event-Visible Object Detection
abstract
Traditional visible light cameras are prone to performance degradation under varying weather and lighting conditions. To address this challenge, we introduce an eventbased camera and propose a novel hierarchical spatiotemporal fusion approach for event-visible object detection. Our method enhances detection performance by integrating data from both event-based and visible light cameras. We have designed three key modules: The Gated Event Accumulation Representation module (GEAR), the Temporal Feature Selection module (TFS), and the Adaptive Fusion module (AF). GEAR and TFS enhance temporal feature fusion at both image and feature levels, while AF effectively integrates multi-modal features with low computational complexity. Our approach has been trained and validated on the publicly available DSEC-Detection dataset, achieving mAP50 and mAP50-95 scores of 67.2% and 45.6%, respectively, demonstrating superior detection performance and validating the effectiveness of the proposed method.
Sin-Ye Jhong, Hsin-Chun Lin, Tzu-Chi Liu, Kai-Lung Hua, Yung-Yao Chen
ICRA3
2021 IoTD: An approach to identify E-mails sent by IoT devices
Fu-Hau Hsu, Jyun-Shao Wu, Chih-Wen Ou, Tzu-Chi Liu, YungYu Zhuang
Comput. Commun.4
2019 Stereo Source Separation in the Frequency Domain: Solving the Permutation Problem by a Sliding K-means Method
abstract
Blind source separation (BSS) has been widely utilized for recovering a set of source signals from their mixtures. When the mixture is convolutive, source separation can be solved in the frequency domain but involves several challenges including the scaling uncertainty and the permutation indeterminacy. This paper presents a sliding k-means algorithm to handle the permutation problem. Experiments were conducted by playing the source files to a pair of loudspeakers and obtaining the mixture by microphones. Objective indices are then defined to evaluate the separation performance based on the actual frequency responses. Results have shown that the standard k-means method alone can consistently achieve > 90.5% permutation accuracy in different parameter settings. After introducing the proposed sliding process, the permutation accuracy further rises. Compared to a previous de-permutation method [1], the present method has a more stable performance against parameter variations in terms of its permutation accuracy and signal-to-interference ratio (SIR).
Bang-Yin Chen, Tzu-Chi Liu, Yi-Wen Liu
ICASSP2