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

Jinshi Qiu

dblp:74/428 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0006-3447-7634ORCID · corroborated

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

Computer networks · 3 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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.

Theoretical computer science
1 paper
Coding theory · 100%
Computer graphics and multimedia
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.112009
Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters] · IEEE Trans. Commun. 2009
Coding theory › error-correcting codes
hybrid ARQ
0.112009
Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters] · IEEE Trans. Commun. 2009
Coding theory › error-correcting codes
unequal error protection
0.112009
Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters] · IEEE Trans. Commun. 2009
Image and video coding
embedded bit stream
0.012009
Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters] · IEEE Trans. Commun. 2009

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

rate allocation · 0.2feedback · 0.2FEC · 0.2
YearPublicationVenuePosition
2026 A Multisensor Fusion Localization Method to Enhance Autonomous Navigation in Off-Road Environments
abstract
This paper develops a real-time localization framework based on multi-sensor fusion for the autonomous navigation of mobile robots in challenging off-road environments. The proposed framework employs a hybrid coupling strategy at its front-end, which integrates Inertial Measurement Unit (IMU) data with Global Navigation Satellite System (GNSS) and LiDAR. As a consequence, GNSS Inertial Odometry (GIO) and Lidar Inertial Odometry (LIO) are created and these are crucial for achieving precise localization in real-time. The RGB-Height-Intensity descriptor is used to improve the precision of loop closure detection while maintaining search efficiency. This is achieved by integrating surface reflectance data from the LiDAR intensity channel and RGB data from camera images. Finally, in the back-end procedure of this framework, the accuracy of posture estimation is enhanced by the optimization of odometry and loop closure factors. Additionally, a framework of real-time localization and autonomous navigation is developed and implemented on a wheeled robot to verify the proposed real-time localization framework. The experimental results indicate the framework exhibited higher performance in off-road environments, where conventional localization techniques generally degrade.
Bo Zhang 0019, Jinshi Qiu, Sicheng Tan
IEEE Internet Things J.3
2025 Distributed Robust Communication-Efficient Multirobot SLAM Combining Real-Time Intersection and Historical Loop Constraints
abstract
To perform collaborative tasks in unknown environment, multirobot simultaneous localization and mapping (SLAM) must establish their spatial constraints from the perception data, and locate each robot within a unified and consistent shared environmental map. However, it faces the challenges of insufficient utilization of perception information, low robustness, and poor real-time communication. For example, most current work focuses on historical loop constraints, neglecting the more direct, geometrically stronger, and communication-efficient “real-time intersection” constraints. To overcome this problem, we propose a distributed robust communication-efficient multirobot SLAM framework, integrating real-time intersection constraints and historical loop constraints. The detection and tracking results of anchor robot are used as real-time intersection constraints to update the front-end status estimation, and the historical loop constraints within and between robots are considered to establish a distributed optimization back-end. Additionally, to generate accurate real-time intersection constraints, a two-stage clustering detection and tracking method for teammate robots based on reflective points is proposed. We established an experimental platform consisting of different mobile robots and collected datasets to test the system. These experimental results in various scenes show that combining real-time intersection and historical loop constraints can effectively improve robust positioning, global consistent mapping and efficient communication performance of multirobot SLAM systems.
Bo Zhang 0019, Zhe Xiong, Jinshi Qiu, Shoubin Chen
IEEE Internet Things J.3
2009 Policy Allocation for Transmissionof Embedded Bit Streams over Noisy Channels with Feedback
abstract
An efficient policy allocation algorithm for the transmission of embedded bit streams over noisy channels with feedback is proposed. The transmission is based on the type-II Hybrid ARQ/FEC protocol and uses a nested sequence C of channel codes to protect the packets. There are also constraints on the total bit budget and on the allowed number of retransmissions per packet. The allocation algorithm assigns different protection policies, each policy being a subset of C, to different packets to maximize the average number of correctly received source bits. We study the performance and the complexity of the proposed scheme through the transmission of images encoded by JPEG2000 over mobile channels with correlated Rayleigh fading. We demonstrate by simulations that the proposed multiple-policy scheme provides significant improvements over a purely FEC scheme with no feedback and also the existing fixed-policy (equal error protection) schemes. Our results show that feedback is particularly helpful for poor channel conditions and that the proposed scheme is very robust against changes in the channel signal-to-noise ratio (SNR) and the mobile speed.
Jinshi Qiu, Amir H. Banihashemi
DCC1
2009 Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters]
abstract
An efficient policy allocation algorithm for the transmission of embedded bit streams over noisy channels with feedback is proposed. The transmission is based on the type-II hybrid ARQ/FEC protocol and uses a nested sequence C of channel codes to protect the packets. There are also constraints on the total bit budget and on the allowed number of retransmissions per packet. The allocation algorithm assigns different protection policies, each policy being a subset of C, to different packets to maximize the average number of correctly received source bits. We study the performance and the complexity of the proposed scheme through the transmission of images encoded by JPEG2000 over mobile channels with correlated Rayleigh fading. We demonstrate by simulations that the proposed multiple-policy scheme provides significant improvements over a purely FEC scheme with no feedback and also the existing fixed-policy schemes. Our results show that feedback is particularly helpful for poor channel conditions and that the proposed scheme is very robust against changes in the channel signal-to-noise ratio (SNR) and the mobile speed.
Jinshi Qiu, Amir H. Banihashemi
IEEE Trans. Commun.1