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

Mikael Persson

dblp:33/1641 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
2since 2021 · last 2021
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
2 papers
3D vision · 70% Trustworthy machine learning · 30%
Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › stereo vision
stereo matching
0.512021
Predicting Disparity Distributions · ICRA 2021
Machine learning › Trustworthy machine learning
uncertainty estimation
0.512021
Predicting Disparity Distributions · ICRA 2021
Computer vision › 3D vision
camera pose estimation
0.312018
Lambda Twist: An Accurate Fast Robust Perspective Three Point (P3P) Solver · ECCV (4) 2018
Computer vision › 3D vision › camera pose estimation
perspective-three-point problem
0.312018
Lambda Twist: An Accurate Fast Robust Perspective Three Point (P3P) Solver · ECCV (4) 2018

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

p3p solver · 0.7lambda twist · 0.7distribution regression · 0.5deep learning · 0.5
YearPublicationVenuePosition
2021 Practical Pose Trajectory Splines With Explicit Regularization
abstract
We investigate spline-based continuous-time pose trajectory estimation using non-linear explicit motion priors. Current regularization priors either linearize the orientation, rely on the implicit regularization obtained from the used spline basis function, or use sampling based regularization schemes. The latter is a special case of a Riemann sum approximation, and we demonstrate when and why this can fail, and propose a way to avoid these issues. In addition we provide a number of novel practically useful theoretical contributions, including requirements on knot spacing for orientation splines, new basis functions for constant velocity extrapolation, and a generalization of the popular P-Spline penalty to orientation. We analyze the properties of the proposed approach using synthetic data. We validate our system using the standard task of visual-inertial calibration, and apply it to stereo visual odometry where we demonstrate real-time performance on KITTI.
Mikael Persson, Gustav Häger, Hannes Ovren, Per-Erik Forssén
3DV1
2021 Predicting Disparity Distributions
abstract
We investigate a novel deep-learning-based approach to estimate uncertainty in stereo disparity prediction networks. Current state-of-the-art methods often formulate disparity prediction as a regression problem with a single scalar output in each pixel. This can be problematic in practical applications as in many cases there might not exist a single well defined disparity, for example in cases of occlusions or at depth-boundaries. While current neural-network-based disparity estimation approaches obtain good performance on benchmarks, the disparity prediction is treated as a black box at inference time. In this paper we show that by formulating the learning problem as a regression with a distribution target, we obtain a robust estimate of the uncertainty in each pixel, while maintaining the performance of the original method. The proposed method is evaluated both on a large-scale standard benchmark, as well on our own data. We also show that the uncertainty estimate significantly improves by maximizing the uncertainty in those pixels that have no well defined disparity during learning.
Gustav Häger, Mikael Persson, Michael Felsberg
ICRA2
2018 Lambda Twist: An Accurate Fast Robust Perspective Three Point (P3P) Solver
Mikael Persson, Klas Nordberg
ECCV (4)1
2017 Robust Accurate Extrinsic Calibration of Static Non-overlapping Cameras
Andreas Robinson, Mikael Persson, Michael Felsberg
CAIP (2)2
2015 Robust stereo visual odometry from monocular techniques
abstract
Visual odometry is one of the most active topics in computer vision. The automotive industry is particularly interested in this field due to the appeal of achieving a high degree of accuracy with inexpensive sensors such as cameras. The best results on this task are currently achieved by systems based on a calibrated stereo camera rig, whereas monocular systems are generally lagging behind in terms of performance. We hypothesise that this is due to stereo visual odometry being an inherently easier problem, rather than than due to higher quality of the state of the art stereo based algorithms. Under this hypothesis, techniques developed for monocular visual odometry systems would be, in general, more refined and robust since they have to deal with an intrinsically more difficult problem. In this work we present a novel stereo visual odometry system for automotive applications based on advanced monocular techniques. We show that the generalization of these techniques to the stereo case result in a significant improvement of the robustness and accuracy of stereo based visual odometry. We support our claims by the system results on the well known KITTI benchmark, achieving the top rank for visual only systems*.
Mikael Persson, Tommaso Piccini, Michael Felsberg, Rudolf Mester
Intelligent Vehicles Symposium1
2012 A novel Bayesian approach to adaptive mean shift segmentation of brain images
abstract
We present a novel adaptive mean shift (AMS) algorithm for the segmentation of tissues in magnetic resonance (MR) brain images. In particular we introduce a novel Bayesian approach for the estimation of the adaptive kernel bandwidth and investigate its impact on segmentation accuracy. We studied the three class problem where the brain tissues are segmented into white matter, gray matter and cerebrospinal fluid. The segmentation experiments were performed on both multi-modal simulated and real patient TI-weighted MR volumes with different noise characteristics and spatial inhomogeneities. The performance of the algorithm was evaluated relative to several competing methods using real and synthetic data. Our results demonstrate the efficacy of the proposed algorithm and that it can outperform competing methods, especially when the noise and spatial intensity inhomogeneities are high.
Qaiser Mahmood, Artur Chodorowski, Andrew Mehnert, Mikael Persson
CBMS4