| 1. |
- Gunnarsson, Fredrik, et al.
(författare)
-
Particle filtering for network-based positioning terrestrial radio networks
- 2014
-
Ingår i: Data Fusion & Target Tracking 2014: Algorithms and Applications (DF&TT 2014), IET Conference on. - : Institution of Engineering and Technology. - 9781849198639
-
Konferensbidrag (refereegranskat)abstract
- There is strong interest in positioing in wireless networks, partly to support end user service needs, but also to support network management with network-based network information. The focus in this paper is on the latter, while using measurements that are readily available in wireless networks. We show how thesignal direction of departure and inter-distance between the base station and the mobile terminal can be estimated, and how particle filters and smoothers can be used to post-process the measurements. The methods are evaluated in a live 3GPP LTE network with promising results inlcuding position error medians of less than 100 m.
|
|
| 2. |
- Lindsten, Fredrik, et al.
(författare)
-
Conflict Detection Metrics for Aircraft Sense and Avoid Systems
- 2009
-
Ingår i: Proceedings of the 7th IFAC Symposium on Fault Detection, Supervision and Safety of Technical Processes. - Linköping : Linköping University Electronic Press. - 9783902661463 ; , s. 65-70
-
Konferensbidrag (refereegranskat)abstract
- The task of an airborne collision avoidance system is to continuously evaluate the risk of collision and in the case of too high risk initiate an evasive action. The traditional way to assess risk is to focus on a critical point of time. A recently proposed alternative is to evaluate the cumulated risk over time. It is the purpose of this contribution to evaluate the difference between these two concepts and also to validate an approximate method for computing the cumulated risk, suitable for real-time implementations. For this purpose, random scenarios are generated from stochastic models created from observed conflicts. A realistic tracking filter, based on angle-only measurements, is used to produce uncertain state estimates which are used for risk assessment. It is shown that the cumulated risk is much more robust to estimation accuracy than the maximum of the instantaneous risk. The intended application is for unmanned aerial vehicles to be used in civilian airspace, but a real mid-air collision scenario between two traffic aircraft is studied as well.
|
|
| 3. |
- Lindsten, Fredrik, et al.
(författare)
-
Geo-Referencing for UAV Navigation using Environmental Classification
- 2010
-
Ingår i: Proceedings of the 2010 IEEE International Conference on Robotics and Automation. - Linköping : Linköping University Electronic Press. - 9781424450404 - 9781424450381 ; , s. 1420-1425
-
Konferensbidrag (refereegranskat)abstract
- A UAV navigation system relying on GPS is vulnerable to signal failure, making a drift free backup system necessary. We introduce a vision based geo-referencing system that uses pre-existing maps to reduce the long term drift. The system classifies an image according to its environmental content and thereafter matches it to an environmentally classified map over the operational area. This map matching provides a measurement of the absolute location of the UAV, that can easily be incorporated into a sensor fusion framework. Experiments show that the geo-referencing system reduces the long term drift in UAV navigation, enhancing the ability of the UAV to navigate accurately over large areas without the use of GPS.
|
|
| 4. |
- Lindsten, Fredrik, 1984-
(författare)
-
Particle filters and Markov chains for learning of dynamical systems
- 2013
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC) methods provide computational tools for systematic inference and learning in complex dynamical systems, such as nonlinear and non-Gaussian state-space models. This thesis builds upon several methodological advances within these classes of Monte Carlo methods.Particular emphasis is placed on the combination of SMC and MCMC in so called particle MCMC algorithms. These algorithms rely on SMC for generating samples from the often highly autocorrelated state-trajectory. A specific particle MCMC algorithm, referred to as particle Gibbs with ancestor sampling (PGAS), is suggested. By making use of backward sampling ideas, albeit implemented in a forward-only fashion, PGAS enjoys good mixing even when using seemingly few particles in the underlying SMC sampler. This results in a computationally competitive particle MCMC algorithm. As illustrated in this thesis, PGAS is a useful tool for both Bayesian and frequentistic parameter inference as well as for state smoothing. The PGAS sampler is successfully applied to the classical problem of Wiener system identification, and it is also used for inference in the challenging class of non-Markovian latent variable models.Many nonlinear models encountered in practice contain some tractable substructure. As a second problem considered in this thesis, we develop Monte Carlo methods capable of exploiting such substructures to obtain more accurate estimators than what is provided otherwise. For the filtering problem, this can be done by using the well known Rao-Blackwellized particle filter (RBPF). The RBPF is analysed in terms of asymptotic variance, resulting in an expression for the performance gain offered by Rao-Blackwellization. Furthermore, a Rao-Blackwellized particle smoother is derived, capable of addressing the smoothing problem in so called mixed linear/nonlinear state-space models. The idea of Rao-Blackwellization is also used to develop an online algorithm for Bayesian parameter inference in nonlinear state-space models with affine parameter dependencies.
|
|
| 5. |
- Lindsten, Fredrik
(författare)
-
Rao-Blackwellised particle methods for inference and identification
- 2011
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- We consider the two related problems of state inference in nonlinear dynamical systems and nonlinear system identification. More precisely, based on noisy observations from some (in general) nonlinear and/or non-Gaussian dynamical system, we seek to estimate the system state as well as possible unknown static parameters of the system. We consider two different aspects of the state inference problem, filtering and smoothing, with the emphasis on the latter. To address the filtering and smoothing problems, we employ sequential Monte Carlo (SMC) methods, commonly referred to as particle filters (PF) and particle smoothers (PS).Many nonlinear models encountered in practice contain some tractable substructure. If this is the case, a natural idea is to try to exploit this substructure to obtain more accurate estimates than what is provided by a standard particle method. For the filtering problem, this can be done by using the well-known Rao-Blackwellised particle filter (RBPF). In this thesis, we analyse the RBPF and provide explicit expressions for the variance reduction that is obtained from Rao-Blackwellisation. Furthermore, we address the smoothing problem and develop a novel Rao-Blackwellised particle smoother (RBPS), designed to exploit a certain tractable substructure in the model.Based on the RBPF and the RBPS we propose two different methods for nonlinear system identification. The first is a recursive method referred to as the Rao-Blackwellised marginal particle filter (RBMPF). By augmenting the state variable with the unknown parameters, a nonlinear filter can be applied to address the parameter estimation problem. However, if the model under study has poor mixing properties, which is the case if the state variable contains some static parameter, SMC filters such as the PF and the RBPF are known to degenerate. To circumvent this we introduce a so called “mixing” stage in the RBMPF, which makes it more suitable for models with poor mixing properties.The second identification method is referred to as RBPS-EM and is designed for maximum likelihood parameter estimation in a type of mixed linear/nonlinear Gaussian statespace models. The method combines the expectation maximisation (EM) algorithm with the RBPS mentioned above, resulting in an identification method designed to exploit the tractable substructure present in the model.
|
|
| 6. |
- Özkan, Emre, et al.
(författare)
-
Recursive Maximum Likelihood Identification of Jump Markov Nonlinear Systems
- 2015
-
Ingår i: IEEE Transactions on Signal Processing. - : Institute of Electrical and Electronics Engineers (IEEE). - 1053-587X .- 1941-0476. ; 63:3, s. 754-765
-
Tidskriftsartikel (refereegranskat)abstract
- We present an online method for joint state and parameter estimation in jump Markov non-linear systems (JMNLS). State inference is enabled via the use of particle filters which makes the method applicable to a wide range of non-linear models. To exploit the inherent structure of JMNLS, we design a Rao-Blackwellized particle filter (RBPF) where the discrete mode is marginalized out analytically. This results in an efficient implementation of the algorithm and reduces the estimation error variance. The proposed RBPF is then used to compute, recursively in time, smoothed estimates of complete data sufficient statistics. Together with the online expectation maximization algorithm, this enables recursive identification of unknown model parameters including the transition probability matrix. The method is also applicable to online identification of jump Markov linear systems(JMLS). The performance of the method is illustrated in simulations and on a localization problem in wireless networks using real data.
|
|
| 7. |
- Ahmadian, Amirhossein, 1992-, et al.
(författare)
-
Enhancing Representation Learning with Deep Classifiers in Presence of Shortcut
- 2023
-
Ingår i: Proceedings of IEEE ICASSP 2023.
-
Konferensbidrag (refereegranskat)abstract
- A deep neural classifier trained on an upstream task can be leveraged to boost the performance of another classifier in a related downstream task through the representations learned in hidden layers. However, presence of shortcuts (easy-to-learn features) in the upstream task can considerably impair the versatility of intermediate representations and, in turn, the downstream performance. In this paper, we propose a method to improve the representations learned by deep neural image classifiers in spite of a shortcut in upstream data. In our method, the upstream classification objective is augmented with a type of adversarial training where an auxiliary network, so called lens, fools the classifier by exploiting the shortcut in reconstructing images. Empirical comparisons in self-supervised and transfer learning problems with three shortcut-biased datasets suggest the advantages of our method in terms of downstream performance and/or training time.
|
|
| 8. |
- Ahmadian, Amirhossein, 1992-, et al.
(författare)
-
Likelihood-free Out-of-Distribution Detection with Invertible Generative Models
- 2021
-
Ingår i: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI 2021). - California : International Joint Conferences on Artificial Intelligence Organization.
-
Konferensbidrag (refereegranskat)abstract
- Likelihood of generative models has been used traditionally as a score to detect atypical (Out-of-Distribution, OOD) inputs. However, several recent studies have found this approach to be highly unreliable, even with invertible generative models, where computing the likelihood is feasible. In this paper, we present a different framework for generative model--based OOD detection that employs the model in constructing a new representation space, instead of using it directly in computing typicality scores, where it is emphasized that the score function should be interpretable as the similarity between the input and training data in the new space. In practice, with a focus on invertible models, we propose to extract low-dimensional features (statistics) based on the model encoder and complexity of input images, and then use a One-Class SVM to score the data. Contrary to recently proposed OOD detection methods for generative models, our method does not require computing likelihood values. Consequently, it is much faster when using invertible models with iteratively approximated likelihood (e.g. iResNet), while it still has a performance competitive with other related methods
|
|
| 9. |
|
|
| 10. |
- Alenlöv, Johan, et al.
(författare)
-
Pseudo-Marginal Hamiltonian Monte Carlo
- 2021
-
Ingår i: Journal of machine learning research. - : MICROTOME PUBL. - 1532-4435 .- 1533-7928. ; 22
-
Tidskriftsartikel (refereegranskat)abstract
- Bayesian inference in the presence of an intractable likelihood function is computationally challenging. When following a Markov chain Monte Carlo (MCMC) approach to approximate the posterior distribution in this context, one typically either uses MCMC schemes which target the joint posterior of the parameters and some auxiliary latent variables, or pseudo-marginal Metropolis-Hastings (MH) schemes. The latter mimic a MH algorithm targeting the marginal posterior of the parameters by approximating unbiasedly the intractable likelihood. However, in scenarios where the parameters and auxiliary variables are strongly correlated under the posterior and/or this posterior is multimodal, Gibbs sampling or Hamiltonian Monte Carlo (HMC) will perform poorly and the pseudo-marginal MH algorithm, as any other MH scheme, will be inefficient for high-dimensional parameters. We propose here an original MCMC algorithm, termed pseudo-marginal HMC, which combines the advantages of both HMC and pseudo-marginal schemes. Specifically, the PM-HMC method is controlled by a precision parameter N, controlling the approximation of the likelihood and, for any N, it samples the marginal posterior of the parameters. Additionally, as N tends to infinity, its sample trajectories and acceptance probability converge to those of an ideal, but intractable, HMC algorithm which would have access to the intractable likelihood and its gradient. We demonstrate through experiments that PM-HMC can outperform significantly both standard HMC and pseudo-marginal MH schemes.
|
|
