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

Arman Karimian

dblp:213/2842 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2023
0000-0002-9293-0533ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 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.

Theoretical computer science
2 papers
Mathematical optimization · 100%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 50% Computational photography and imaging · 50%
Artificial intelligence
1 paper
Robot navigation and mapping · 100%

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

TopicWeightPapersLastEvidence papers
Computational photography and imaging › camera geometry
essential matrix estimation
0.712023
Essential Matrix Estimation using Convex Relaxations in Orthogonal Space · ICCV 2023
Geometric modeling and processing › 3d reconstruction
structure from motion
0.712023
Essential Matrix Estimation using Convex Relaxations in Orthogonal Space · ICCV 2023
Mathematical optimization
convex relaxation
0.712023
Essential Matrix Estimation using Convex Relaxations in Orthogonal Space · ICCV 2023
Mathematical optimization › convex relaxation
semidefinite relaxation
0.712023
Essential Matrix Estimation using Convex Relaxations in Orthogonal Space · ICCV 2023
Robotics › Robot navigation and mapping › SLAM › graph optimization
pose graph optimization
0.412020
Rotational Outlier Identification in Pose Graphs using Dual Decomposition · ECCV (30) 2020
Robotics › Robot navigation and mapping
SLAM
0.412020
Rotational Outlier Identification in Pose Graphs using Dual Decomposition · ECCV (30) 2020
Mathematical optimization › large-scale optimization › decomposition methods
dual decomposition
0.112020
Rotational Outlier Identification in Pose Graphs using Dual Decomposition · ECCV (30) 2020

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

semidefinite programming · 1.3riemannian optimization · 1.3quaternions · 1.3dual decomposition · 0.9
YearPublicationVenuePosition
2023 Essential Matrix Estimation using Convex Relaxations in Orthogonal Space
abstract
We introduce a novel method to estimate the essential matrix for two-view Structure from Motion (SfM). We show that every 3 × 3 essential matrix can be embedded in a 4 × 4 rotation having its bottom right entry fixed to zero; we call the latter the quintessential matrix. This embedding leads to rich relations with the space of 4-D rotations, quaternions, and the classical twisted-pair ambiguity in two-view SfM. We use this structure to derive a succession of semidefinite relaxations that require fewer parameters than the existing non-minimal solvers and yield faster convergence with certifiable optimality. We then exploit the low-rank geometry of these relaxations to reduce them to an equivalent optimization on a Riemannian manifold and solve them via the Riemannian Staircase method. The experimental evaluation confirms that our algorithm always finds the globally optimal solution and outperforms the existing non-minimal methods. We make our implementations open source .1.
Arman Karimian, Roberto Tron
ICCV1
2023 Trajectory-Based SLAM for Indoor Mobile Robots with Limited Sensing Capabilities
abstract
In this paper we introduce a novel SLAM system for 2-D indoor environments that relies only on limited sensing. Our fully autonomous system uses only the trajectory of the robot around walls and objects in the environment as landmarks and is capable of robust and long-term exploration and mapping of a broad range of household floor plans. Rank-deficient and full-rank factors are created when the robot observes existing trajectory-based landmarks, and they are filtered and added in a pose graph, which is optimized periodically. The mission space is mapped by efficient adaptive local mapping algorithms. The proposed SLAM system has been extensively tested in various scenarios, and experimental results show its robustness and accuracy.
Jeremias Rodriguez, Arman Karimian, Benjamin Pheil, Jose Franco, Renaud Moser, Read Sandström, Scott Lenser, Artem Gritsenko, Daniele Tamino, Felipe Andres Tenaglia Giunta, Guanlai Li, Philip Wasserman, Andrea M. Okerholm
IROS3
2020 Rotational Outlier Identification in Pose Graphs using Dual Decomposition
Arman Karimian, Roberto Tron
ECCV (30)1
2020 Aerial-DeepSearch: Distributed Multi-Agent Deep Reinforcement Learning for Search Missions
abstract
Search and Rescue (SAR) is an important part of several applications of national and social interest. Existing solutions for search missions in both terrestrial and aerial domains are mostly limited to single agent and specific environments; however, search missions can significantly benefit from the use of multiple agents that can quickly adapt to new environments. In this paper, we propose a framework based on Multi-Agent Deep Reinforcement Learning (MADRL) that realizes the actor-critic framework in a distributed manner for coordinating multiple Unmanned Aerial Vehicles (UAVs) in the exploration of unknown regions. One of the original aspects of our work is that the actors represent simulated or actual UAVs exploring the environment in parallel instead of traditional computer threads. Also, we propose addition of Long Short Term Memory (LSTM) neural network layers to the actor and critic architectures to handle imperfect communication and partial observability scenarios. The proposed approach has been evaluated in a grid world and has been compared against other competing algorithms such as Multi-Agent Q-Learning, Multi-Agent Deep Q-Learning to show its advantages. More generally, our approach could be extended to image-based/continuous action space environments as well.
Vidyasagar Sadhu, Chuanneng Sun, Arman Karimian, Roberto Tron, Dario Pompili
MASS3