Angel Froilan Garcia-Fernandez

Angel Froilan Garcia-Fernandez

Auto-generated profile, based on publicly available information

Angel Froilan Garcia-Fernandez

Universidad Politécnica de Madrid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
12 February 2018 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
AGAngel F. Garcia-Fernandez
Angel F. Garcia-Fernandez
JWJason L. Williams
Jason L. Williams
KGKarl Granstrom
Karl Granstrom
LSLennart Svensson
Lennart Svensson
We provide a derivation of the Poisson multi-Bernoulli mixture (PMBM) filter for multi-target tracking with he standard point target measurements without using probability generating functionals or functional derivatives. We also establish the connection with the δ-generalised labelled multi- Bernoulli (δ-GLMB) filter, showing that a δ-GLMB density represents a multi-Bernoulli mixture with labelled targets so it can be seen as a special case of PMBM. In addition, we propose an implementation for linear/Gaussian dynamic and measurement models and how to efficiently obtain typical estimators in the literature from the PMBM. The PMBM filter is shown to outperform other filters in the literature in a challenging scenario

1 July 2017
Verified
Conference Paper
Closed access
ARAbu Sajana Rahmathullah
Abu Sajana Rahmathullah
AGAngel F. Garcia-Fernandez
Angel F. Garcia-Fernandez
LSLennart Svensson
Lennart Svensson

9 July 2015 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
AGAngel F. Garcia-Fernandez
Angel F. Garcia-Fernandez
LSLennart Svensson
Lennart Svensson
MMMark R. Morelande
Mark R. Morelande
SSSimo Sarkka
Simo Sarkka
This paper is concerned with Gaussian approximations to the posterior probability density function (PDF) in the update step of Bayesian filtering with nonlinear measurements. In this setting, sigma-point approximations to the Kalman filter (KF) recursion are widely used due to their ease of implementation and relatively good performance. In the update step, these sigma-point KFs are equivalent to linearizing the nonlinear measurement function by statistical linear regression (SLR) with respect to the prior PDF. In this paper, we argue that the measurement function should be linearized using SLR with respect to the posterior rather than the prior to take into account the information provided by the measurement. The resulting filter is referred to as the posterior linearization filter (PLF). In practice, the exact PLF update is intractable but can be approximated by the iterated PLF (IPLF), which carries out iterated SLRs with respect to the best available approximation to the posterior. The IPLF can be seen as an approximate recursive Kullback-Leibler divergence minimization procedure. We demonstrate the high performance of the IPLF in relation to other Gaussian filters in two numerical examples.

5 June 2019 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
AGAngel F. Garcia-Fernandez
Angel F. Garcia-Fernandez
LSLennart Svensson
Lennart Svensson
MMMark R. Morelande
Mark R. Morelande
We propose a solution of the multiple target tracking (MTT) problem based on sets of trajectories and the random finite set framework. A full Bayesian approach to MTT should characterise the distribution of the trajectories given the measurements, as it contains all information about the trajectories. We attain this by considering multi-object density functions in which objects are trajectories. For the standard tracking models, we also describe a conjugate family of multitrajectory density functions.

16 March 2023 in Heliyon
Verified
Journal Article
Open access
JGJiawei Guo
Jiawei Guo
JMJieming Ma
Jieming Ma
ÁGÁngel F. García-Fernández
Ángel F. García-Fernández
YZYungang Zhang
Yungang Zhang
LHLiang Hai-Ning
Liang Hai-Ning
In real scenes, due to the problems of low light and unsuitable views, the images often exhibit a variety of degradations, such as low contrast, color distortion, and noise. These degradations affect not only visual effects but also computer vision tasks. This paper focuses on the combination of traditional algorithms and machine learning algorithms in the field of image enhancement. The traditional methods, including their principles and improvements, are introduced from three categories: gray level transformation, histogram equalization, and Retinex methods. Machine learning based algorithms are not only divided into end-to-end learning and unpaired learning, but also concluded to decomposition-based learning and fusion based learning based on the applied image processing strategies. Finally, the involved methods are comprehensively compared by multiple image quality assessment methods, including mean square error, natural image quality evaluator, structural similarity, peak signal to noise ratio, etc.

26 June 2020 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
AGAngel F. Garcia-Fernandez
Angel F. Garcia-Fernandez
ARAbu Sajana Rahmathullah
Abu Sajana Rahmathullah
LSLennart Svensson
Lennart Svensson
In this paper, we propose a metric on the space of finite sets of trajectories for assessing multi-target tracking algorithms in a mathematically sound way. The main use of the metric is to compare estimates of trajectories from different algorithms with the ground truth of trajectories. The proposed metric includes intuitive costs associated to localization error for properly detected targets, missed and false targets and track switches at each time step. The metric computation is based on solving a multi-dimensional assignment problem. We also propose a lower bound for the metric, which is also a metric for sets of trajectories and is computable in polynomial time using linear programming. We also extend the proposed metrics on sets of trajectories to random finite sets of trajectories.