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

Haosong Yue

dblp:38/9454 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
3since 2021 · last 2022
0000-0001-7043-438XORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 2 first-author · 3 since 2021Systems, architecture and hardware · 3 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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 · 42% Graph learning · 42% Robot navigation and mapping · 16%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › depth estimation
depth completion
0.612022
SEHLNet: Separate Estimation of High- and Low-Frequency components for Depth Completion · ICRA 2022
Computer vision › 3D vision
depth estimation
0.612022
SEHLNet: Separate Estimation of High- and Low-Frequency components for Depth Completion · ICRA 2022
Machine learning › Graph learning › graph neural network › attention-based graph neural network
graph attention network
0.612022
SEHLNet: Separate Estimation of High- and Low-Frequency components for Depth Completion · ICRA 2022
Machine learning › Graph learning
graph neural network
0.612022
SEHLNet: Separate Estimation of High- and Low-Frequency components for Depth Completion · ICRA 2022
Robotics › Robot navigation and mapping › place recognition
bag-of-words place recognition
0.212015
Comments on Automatic Visual Bag-of-Words for Online Robot Navigation and Mapping · IEEE Trans. Robotics 2015
Robotics › Robot navigation and mapping › SLAM
visual SLAM
0.212015
Comments on Automatic Visual Bag-of-Words for Online Robot Navigation and Mapping · IEEE Trans. Robotics 2015

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

high-low frequency decomposition · 0.6attention-based self-fusion · 0.6
YearPublicationVenuePosition
2022 SEHLNet: Separate Estimation of High- and Low-Frequency components for Depth Completion
abstract
Depth completion refers to inferring the dense depth map from a sparse depth map with or without corre-sponding color image. Numerous neural networks have been proposed to accomplish this task. However, insufficient uti-lization of heteromorphic data and the fact that predicted dense depth prefers a sparse depth enormously damage the performance of approaches. To reduce data preference and fully utilize two modalities, this paper proposes a novel network that predicts high- and low-frequency components of dense depth separately. Specifically, the framework consists of a Low-Frequency(LF) branch and a High-Frequency(HF) branch. In the LF branch, we recover the low-frequency depth component from sparse depth through an Adaptive Graph-Generate Graph Attention Network, which can be seen as a low-pass filter. In the HF branch, we model the high-frequency component, e.g. boundaries, as residuals to mitigate the impact of data preferences. Moreover, in this branch, we propose an Attention-based Self-Fusion mechanism to efficiently fuse multi-scale features extracted from the sparse depth and color image. Extensive experiments demonstrate that our approach achieves state-of-the-art performance on the KITTI benchmark and ranks 1st in root mean squared error among other published approaches.
Haosong Yue, Zhanggang Lyu, Wei Wang 0036, Zhong Liu 0005, Weihai Chen
ICRA2
2022 Discriminative and semantic feature selection for place recognition towards dynamic environments
Jinyu Miao, Xingming Wu, Haosong Yue, Zhong Liu 0005, Weihai Chen
Pattern Recognit. Lett.4
2021 RaP-Net: A Region-wise and Point-wise Weighting Network to Extract Robust Features for Indoor Localization
abstract
Feature extraction plays an important role in visual localization. Unreliable features on dynamic objects or repetitive regions will interfere with feature matching and challenge indoor localization greatly. To address the problem, we propose a novel network, RaP-Net, to simultaneously predict region-wise invariability and point-wise reliability, and then extract features by considering both of them. We also introduce a new dataset, named OpenLORIS-Location, to train the proposed network. The dataset contains 1553 images from 93 indoor locations. Various appearance changes between images of the same location are included and can help the model to learn the invariability in typical indoor scenes. Experimental results show that the proposed RaP-Net trained with OpenLORIS-Location dataset achieves excellent performance in the feature matching task and significantly outperforms state-of-the-arts feature algorithms in indoor localization. The RaPNet code and dataset are available at https://github.com/ivipsourcecode/RaP-Net.
Dongjiang Li, Jinyu Miao, Xuesong Shi, Qiwei Long, Tianyu Cai, Hongfei Yu, Wei Yang 0029, Haosong Yue, Qi Wei 0001, Fei Qiao
IROS10
2019 Robust Loop Closure Detection based on Bag of SuperPoints and Graph Verification
abstract
Loop closure detection (LCD) is a crucial technique for robots, which can correct accumulated localization errors after long time explorations. In this paper, we propose a robust LCD algorithm based on Bag of SuperPoints and graph verification. The system first extracts interest points and feature descriptors using the SuperPoint neural network. Then a visual vocabulary is trained in an incremental and self-supervised manner considering the relations between consecutive training images. Finally, a topological graph is constructed using matched feature points to verify candidate loop closures obtained by a Bag-of-Words (BoW) framework. Comparative experiments with state-of-the-art LCD algorithms on several typical datasets have been carried out. The results demonstrate that our proposed graph verification method can significantly improve the accuracy of image matching and the overall LCD approach outperforms existing methods.
Haosong Yue, Jinyu Miao, Weihai Chen, Changyun Wen
IROS1
2015 Comments on Automatic Visual Bag-of-Words for Online Robot Navigation and Mapping
abstract
The paper Automatic visual bag-of-words for online robot navigation and mapping by T. Nicosevici and R. Garcia (IEEE Trans. Robot., vol. 28, no. 4, pp. 886898, Aug. 2012) proposed an algorithm for robot navigation and mapping. In this paper, we correct some errors in their analysis.
Haosong Yue, Weihai Chen
IEEE Trans. Robotics1
2010 Spline-interpolation based PVT algorithm and application in a bionic cockroach robot
abstract
To solve the problem that the final velocity curve will be unsmoothed if the PVT(Position Velocity Time) nodes velocities are determined improperly when using PVT control algorithm, based on analyzing the general principle of spline interpolation and PVT motion control, this paper presents a triple spline interpolation based PVT algorithm, which ensures the smoothness of the velocity curve. The velocity of each node is firstly calculated via spline interpolation method, and then the final trace control curve is achieved by using PVT method to these points. The proposed algorithm is applied to the kinematics control of a cockroach robot. The structure and forward/inverse kinematics model of the cockroach robot is expounded. Finally, the reliability of the proposed algorithm is verified by the contrast simulation and experiment of a single leg of the cockroach robot with one of the existing algorithms. The results show that the proposed approach can be readily used for motion controls.
Haosong Yue, Weihai Chen, Xingming Wu
ICARCV1