Simo Särkkä

Simo Särkkä

Auto-generated profile, based on publicly available information

Simo Särkkä

Aalto University

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 August 2019 in Statistics and Computing
Verified
Journal Article
Open access
PDF file
ASArno Solin
Arno Solin
SSSimo Särkkä
Simo Särkkä
This paper proposes a novel scheme for reduced-rank Gaussian process regression. The method is based on an approximate series expansion of the covariance function in terms of an eigenfunction expansion of the Laplace operator in a compact subset of \(\mathbb {R}^d\). On this approximate eigenbasis, the eigenvalues of the covariance function can be expressed as simple functions of the spectral density of the Gaussian process, which allows the GP inference to be solved under a computational cost scaling as \(\mathcal {O}(nm^2)\) (initial) and \(\mathcal {O}(m^3)\) (hyperparameter learning) with m basis functions and n data points. Furthermore, the basis functions are independent of the parameters of the covariance function, which allows for very fast hyperparameter learning. The approach also allows for rigorous error analysis with Hilbert space theory, and we show that the approximation becomes exact when the size of the compact subset and the number of eigenfunctions go to infinity. We also show that the convergence rate of the truncation error is independent of the input dimensionality provided that the differentiability order of the covariance function increases appropriately, and for the squared exponential covariance function it is always bounded by \({\sim }1/m\) regardless of the input dimensionality. The expansion generalizes to Hilbert spaces with an inner product which is defined as an integral over a specified input density. The method is compared to previously proposed methods theoretically and through empirical tests with simulated and real data.

28 September 2020 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Open access
STSarang Thombre
Sarang Thombre
ZZZheng Zhao
Zheng Zhao
HRHenrik Ramm-Schmidt
Henrik Ramm-Schmidt
JGJose M. Vallet Garcia
Jose M. Vallet Garcia
TMTuomo Malkamaki
Tuomo Malkamaki
Ville LehtolaVille Lehtola
Ville Lehtola
Autonomous ships are expected to improve the level of safety and efficiency in future maritime navigation. Such vessels need perception for two purposes: to perform autonomous situational awareness and to monitor the integrity of the sensor system itself. In order to meet these needs, the perception system must fuse data from novel and traditional perception sensors using Artificial Intelligence (AI) techniques. This article overviews the recognized operational requirements that are imposed on regular and autonomous seafaring vessels, and then proceeds to consider suitable sensors and relevant AI techniques for an operational sensor system. The integration of four sensors families is considered: sensors for precise absolute positioning (Global Navigation Satellite System (GNSS) receivers and Inertial Measurement Unit (IMU)), visual sensors (monocular and stereo cameras), audio sensors (microphones), and sensors for remote-sensing (RADAR and LiDAR). Additionally, sources of auxiliary data, such as Automatic Identification System (AIS) and external data archives are discussed. The perception tasks are related to well-defined problems, such as situational abnormality detection, vessel classification, and localization, that are solvable using AI techniques. Machine learning methods, such as deep learning and Gaussian processes, are identified to be especially relevant for these problems. The different sensors and AI techniques are characterized keeping in view the operational requirements, and some example state-of-the-art options are compared based on accuracy, complexity, required resources, compatibility and adaptability to maritime environment, and especially towards practical realization of autonomous systems.

6 June 2018 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
ASArno Solin
Arno Solin
MKManon Kok
Manon Kok
NWNiklas Wahlstrom
Niklas Wahlstrom
TSThomas B. Schon
Thomas B. Schon
SSSimo Sarkka
Simo Sarkka
Anomalies in the ambient magnetic field can be used as features in indoor positioning and navigation. By using Maxwell’s equations, we derive and present a Bayesian nonparametric probabilistic modeling approach for interpolation and extrapolation of the magnetic field. We model the magnetic field components jointly by imposing a Gaussian process (GP) prior to the latent scalar potential of the magnetic field. By rewriting the GP model in terms of a Hilbert space representation, we circumvent the computational pitfalls associated with GP modeling and provide a computationally efficient and physically justified modeling tool for the ambient magnetic field. The model allows for sequential updating of the estimate and time-dependent changes in the magnetic field. The model is shown to work well in practice in different applications. We demonstrate mapping of the magnetic field both with an inexpensive Raspberry Pi powered robot and on foot using a standard smartphone.

1 April 2012 in NeuroImage
Verified
Journal Article
Closed access
SSSimo Särkkä
Simo Särkkä
ASArno Solin
Arno Solin
ANAapo Nummenmaa
Aapo Nummenmaa
AVAki Vehtari
Aki Vehtari
TAToni Auranen
Toni Auranen
FLFa-Hsuan Lin
Fa-Hsuan Lin

26 July 2015 in Autonomous Robots
Verified
Journal Article
Closed access
PDF file
SASean Anderson
Sean Anderson
TBTimothy D. Barfoot
Timothy D. Barfoot
CTChi Hay Tong
Chi Hay Tong
SSSimo Särkkä
Simo Särkkä

8 January 2018 in Statistics and Computing
Verified
Journal Article
Open access
PDF file
MSMichael Schober
Michael Schober
SSSimo Särkkä
Simo Särkkä
PHPhilipp Hennig
Philipp Hennig
We study connections between ordinary differential equation (ODE) solvers and probabilistic regression methods in statistics. We provide a new view of probabilistic ODE solvers as active inference agents operating on stochastic differential equation models that estimate the unknown initial value problem (IVP) solution from approximate observations of the solution derivative, as provided by the ODE dynamics. Adding to this picture, we show that several multistep methods of Nordsieck form can be recasted as Kalman filtering on q-times integrated Wiener processes. Doing so provides a family of IVP solvers that return a Gaussian posterior measure, rather than a point estimate. We show that some such methods have low computational overhead, nontrivial convergence order, and that the posterior has a calibrated concentration rate. Additionally, we suggest a step size adaptation algorithm which completes the proposed method to a practically useful implementation, which we experimentally evaluate using a representative set of standard codes in the DETEST benchmark set.