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.

Martin Labrie

dblp:52/4036 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

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
Robot navigation and mapping · 51% 3D vision · 26% Efficient and distributed learning · 11%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › neural rendering
3d gaussian splatting
0.912025
POp-GS: Next Best View in 3D-Gaussian Splatting with P-Optimality · CVPR 2025
Computer vision › 3D vision
3d scene reconstruction
0.912025
POp-GS: Next Best View in 3D-Gaussian Splatting with P-Optimality · CVPR 2025
Robotics › Robot navigation and mapping › view planning
next-best-view planning
0.912025
POp-GS: Next Best View in 3D-Gaussian Splatting with P-Optimality · CVPR 2025
Machine learning › Efficient and distributed learning › active learning
active label correction
0.812024
Probabilistic Active Loop Closure for Autonomous Exploration · ICRA 2024
Machine learning › Reinforcement learning › exploration
autonomous exploration
0.812024
Probabilistic Active Loop Closure for Autonomous Exploration · ICRA 2024
Robotics › Robot navigation and mapping › SLAM
loop closure detection
0.812024
Probabilistic Active Loop Closure for Autonomous Exploration · ICRA 2024
Robotics › Robot navigation and mapping
mobile robot navigation
0.812024
Probabilistic Active Loop Closure for Autonomous Exploration · ICRA 2024
Robotics › Robot navigation and mapping
SLAM
0.812024
Probabilistic Active Loop Closure for Autonomous Exploration · ICRA 2024
Robotics › Robot navigation and mapping
occupancy grid mapping
0.212024
Probabilistic Active Loop Closure for Autonomous Exploration · ICRA 2024

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

t-optimality · 0.9p-optimality · 0.9d-optimality · 0.9block diagonal covariance approximation · 0.9probabilistic reward · 0.8pose graph optimization · 0.8
YearPublicationVenuePosition
2025 POp-GS: Next Best View in 3D-Gaussian Splatting with P-Optimality
abstract
In this paper, we present a novel algorithm for quantifying uncertainty and information gained within 3D Gaussian Splatting (3D-GS) through P-Optimality. While 3D-GS has proven to be a useful world model with high-quality rasterizations, it does not natively quantify uncertainty or information, posing a challenge for real-world applications such as 3D-GS SLAM. We propose to quantify information gain in 3D-GS by reformulating the problem through the lens of optimal experimental design, which is a classical solution widely used in literature. By restructuring information quantification of 3D-GS through optimal experimental design, we arrive at multiple solutions, of which T-Optimality and D-Optimality perform the best quantitatively and qualitatively as measured on two popular datasets. Additionally, we propose a block diagonal covariance approximation which provides a measure of correlation at the expense of a greater computation cost.
Joey Wilson, Marcelino M. de Almeida, Sachit Mahajan, Martin Labrie, Maani Ghaffari Jadidi, Omid Ghasemalizadeh, Min Sun 0001, Cheng-Hao Kuo, Arnab Sen
CVPR4
2024 Probabilistic Active Loop Closure for Autonomous Exploration
abstract
When a mobile robot autonomously explores an indoor space to produce a localization and navigation map, it is important to create both a stable pose graph and a high-quality occupancy map that covers all the navigable areas. In this work, we propose a novel probabilistic active loop closure framework which attempts to maximally reduce pose graph uncertainty during exploration and improves occupancy map quality. We calculate a probabilistic reward of getting a loop closure at any pose on a pose graph, which considers both how much pose graph uncertainty would be reduced by getting a loop closure there, and the robot’s travel cost to navigate to that pose. By choosing poses that provide the largest rewards, we can maximally reduce pose graph uncertainty while avoiding long travel times. The effectiveness of the method is illustrated through on-device testing in various floor plans.
He Yin, Jong Jin Park, Marcelino M. de Almeida, Martin Labrie, Jim Zamiska, Richard Kim
ICRA4