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

Kenneth Batstone

dblp:182/9899 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2019
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorArtificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
1 paper
3D vision · 75% Efficient and distributed learning · 25%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › structure from motion
affine structure from motion
0.212016
Trust No One: Low Rank Matrix Factorization Using Hierarchical RANSAC · CVPR 2016
Machine learning › Efficient and distributed learning › model compression
low-rank approximation
0.212016
Trust No One: Low Rank Matrix Factorization Using Hierarchical RANSAC · CVPR 2016
Computer vision › 3D vision › structure from motion
non-rigid structure from motion
0.212016
Trust No One: Low Rank Matrix Factorization Using Hierarchical RANSAC · CVPR 2016
Computer vision › 3D vision
structure from motion
0.212016
Trust No One: Low Rank Matrix Factorization Using Hierarchical RANSAC · CVPR 2016

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

hierarchical RANSAC · 0.2bootstrapping · 0.2
YearPublicationVenuePosition
2019 Robust Self-calibration of Constant Offset Time-difference-of-arrival
abstract
In this paper we study the problem of estimating receiver and sender positions from time-difference-of-arrival measurements, assuming an unknown constant time-difference-of-arrival offset. This problem is relevant for example for repetitive sound events. In this paper it is shown that there are three minimal cases to the problem. One of these (the five receiver, five sender problem) is of particular importance. A fast solver (with run-time under 4 µs) is given. We show how this solver can be used in robust estimation algorithms, based on RANSAC, for obtaining an initial estimate followed by local optimization using a robust error norm. The system is verified on both real and synthetic data.
Kenneth Batstone, Gabrielle Flood, Thejasvi Beleyur, Viktor Larsson, Holger R. Goerlitz, Magnus Oskarsson, Kalle Åström
ICASSP1
2019 Collaborative Merging of Radio SLAM Maps in View of Crowd-sourced Data Acquisition and Big Data
abstract
Indoor localization and navigation is a much researched and difficult problem. The best solutions, usually use expensive specialized equipment and/or prior calibration of some form. To the average person with smart or Internet-Of-Things devices, these solutions are not feasible, particularly in large scales. With hardware advancements making Ultra-Wideband devices more accurate and low powered, this unlocks the potential of having such devices in commonplace around factories and homes, enabling an alternative method of navigation. Therefore, indoor anchor calibration becomes a key problem in order to implement these devices efficiently and effectively. In this paper, we present a method to fuse radio SLAM (also known as Time-Of-Arrival self-calibration) maps together in a linear way. In doing so we are then able to collaboratively calibrate the anchor positions in 3D to native precision of the devices. Furthermore, we introduce an automatic scheme to determine which of the maps are best to use to further improve the anchor calibration and its robustness but also show which maps could be discarded. Additionally, when a map is fused in a linear way, it is a very computationally cheap process and produces a reasonable map which is required to push for crowd-sourced data acquisition.
Kenneth Batstone, Magnus Oskarsson, Kalle Åström
ICPRAM1
2017 Towards real-time time-of-arrival self-calibration using ultra-wideband anchors
abstract
Indoor localisation is a currently a key issue, from robotics to the Internet of Things. With hardware advancements making Ultra-Wideband devices more accurate and low powered (potentially even passive), this unlocks the potential of having such devices in common place around factories and homes, enabling an alternative method of navigation. Therefore, anchor calibration indoors becomes a key problem in order to implement these devices efficiently and effectively. In this paper, we study the possibility for sequentially gathering Ultra-Wideband Time-of-Arrival measurements and using previously studied robust solvers, merge solutions together in order to calculate anchor positions in 3D in real-time. Here it is assumed that there is no prior knowledge of the anchor positions. This is then validated using Ultra-Wideband Time-of-Arrival data gathered by a Bitcraze Crazyflie quadcopter in 2D motion, 3D motion and full flight.
Kenneth Batstone, Magnus Oskarsson, Kalle Åström
IPIN1
2017 Robust phase-based positioning using massive MIMO with limited bandwidth
abstract
This paper presents a phase-based positioning framework using a massive MIMO system. The phase-based distance estimates of MPCs together with other parameters are tracked with an EKF, the state dimension of which varies with the birth-death processes of paths. The RIMAX and the modeling of dense multipath components in the framework further enhance the quality of parameter tracking by providing an accurate initial state and the underlying noise covariance. The tracked MPCs are fed into a time-of-arrival self-calibration positioning algorithm for simultaneous trajectory and environment estimation. Throughout the positioning process, no prior knowledge of the surrounding environment and base station position is needed. The performance is demonstrated with the measurement of a 2D complex movement, which was performed in a sports hall with an antenna array with 128 ports as base station using a standard cellular bandwidth of 40 MHz. The positioning result shows that the mean deviation of the estimated user equipment trajectory from the ground truth is 13 cm. In summary, the proposed framework is a promising high-resolution radio-based positioning solution for current and next generation cellular systems.
Xuhong Li 0001, Kenneth Batstone, Kalle Åström, Magnus Oskarsson, Carl Gustafson, Fredrik Tufvesson
PIMRC2
2016 Trust No One: Low Rank Matrix Factorization Using Hierarchical RANSAC
abstract
In this paper we present a system for performing low rank matrix factorization. Low-rank matrix factorization is an essential problem in many areas, including computer vision with applications in affine structure-from-motion, photometric stereo, and non-rigid structure from motion. We specifically target structured data patterns, with outliers and large amounts of missing data. Using recently developed characterizations of minimal solutions to matrix factorization problems with missing data, we show how these can be used as building blocks in a hierarchical system that performs bootstrapping on all levels. This gives a robust and fast system, with state-of-the-art performance.
Magnus Oskarsson, Kenneth Batstone, Kalle Åström
CVPR2