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.

Leonid Keselman

dblp:129/2411 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
4since 2021 · last 2024
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Systems, architecture and hardware · 2 · 2 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 2

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
1 paper
Motion planning and robot control · 50% Planning, search and constraint satisfaction · 50%
Computer graphics and multimedia
1 paper
Rendering · 50% Geometric modeling and processing · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
algorithm configuration
0.712023
Discovering Multiple Algorithm Configurations · ICRA 2023
Robotics › Motion planning and robot control
robot learning
0.712023
Discovering Multiple Algorithm Configurations · ICRA 2023
Geometric modeling and processing › shape representation › implicit representation
algebraic surfaces
0.612022
Approximate Differentiable Rendering with Algebraic Surfaces · ECCV (32) 2022
Rendering
differentiable rendering
0.612022
Approximate Differentiable Rendering with Algebraic Surfaces · ECCV (32) 2022
Mathematical optimization › black-box optimization
algorithm configuration
0.212023
Discovering Multiple Algorithm Configurations · ICRA 2023

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

post hoc mode discovery · 1.3multistage mode discovery · 1.3multi-armed bandit · 1.3differentiable rendering · 0.6
YearPublicationVenuePosition
2024 Shape from Shading for Robotic Manipulation
abstract
Controlling illumination can generate high quality information about object surface normals and depth discontinuities at a low computational cost. In this work we demonstrate a robot workspace-scaled controlled illumination approach that generates high quality information for table top scale objects for robotic manipulation. With our low angle of incidence directional illumination approach, we can precisely capture surface normals and depth discontinuities of monochromatic Lambertian objects. We show that this approach to shape estimation is 1) valuable for general purpose grasping with a single point vacuum gripper, 2) can measure the deformation of known objects, and 3) can estimate pose of known objects and track unknown objects in the robot’s workspace.
Arkadeep Narayan Chaudhury, Leonid Keselman, Christopher G. Atkeson
WACV2
2023 Discovering Multiple Algorithm Configurations
abstract
Many practitioners in robotics regularly depend on classic, hand-designed algorithms. Often the performance of these algorithms is tuned across a dataset of annotated examples which represent typical deployment conditions. Automatic tuning of these settings is traditionally known as algorithm configuration. In this work, we extend algorithm configuration to automatically discover multiple modes in the tuning dataset. Unlike prior work, these configuration modes represent multiple dataset instances and are detected automatically during the course of optimization. We propose three methods for mode discovery: a post hoc method, a multistage method, and an online algorithm using a multi-armed bandit. Our results characterize these methods on synthetic test functions and in multiple robotics application domains: stereoscopic depth estimation, differentiable rendering, motion planning, and visual odometry. We show the clear benefits of detecting multiple modes in algorithm configuration space.
Leonid Keselman, Martial Hebert
ICRA1
2023 Optimizing Algorithms from Pairwise User Preferences
abstract
Typical black-box optimization approaches in robotics focus on learning from metric scores. However, that is not always possible, as not all developers have ground truth available. Learning appropriate robot behavior in human-centric contexts often requires querying users, who typically cannot provide precise metric scores. Existing approaches leverage human feedback in an attempt to model an implicit reward function; however, this reward may be difficult or impossible to effectively capture. In this work, we introduce SortCMA to optimize algorithm parameter configurations in high dimensions based on pairwise user preferences. SortCMA efficiently and robustly leverages user input to find parameter sets without directly modeling a reward. We apply this method to tuning a commercial depth sensor without ground truth, and to robot social navigation, which involves highly complex preferences over robot behavior. We show that our method succeeds in optimizing for the user's goals and perform a user study to evaluate social navigation results.
Leonid Keselman, Katherine Shih, Martial Hebert, Aaron Steinfeld
IROS1
2022 Approximate Differentiable Rendering with Algebraic Surfaces
Leonid Keselman, Martial Hebert
ECCV (32)1
2013 Dynamics based 3D skeletal hand tracking
Stan Melax, Leonid Keselman, Sterling Orsten
Graphics Interface2
2013 Dynamics based 3D skeletal hand tracking
abstract
Natural human computer interaction motivates hand tracking research, preferably without requiring the user to wear special hardware or markers. Ideally, a hand tracking solution would provide not only points of interest, but the full state of an entire hand. [Oikonomidis et al. 2011] demonstrated a particle swarm optimization that tracked a 3D skeletal hand model from a single depth camera, albeit using significant computing resources. In contrast, we track the hand from a single depth camera using an efficient physical simulation, which incrementally updates a model's fit and explores alternative candidate poses based on a variety of heuristics. Our approach enables real-time, robust 3D skeletal tracking of a user's hand, while utilizing a single x86 CPU core for processing.
Stan Melax, Leonid Keselman, Sterling Orsten
I3D2