Fahira Afzal Maken

Fahira Afzal Maken

Auto-generated profile, based on publicly available information

Fahira Afzal Maken

Data61, Commonwealth Scientific and Industrial Research Organisation (CSIRO), Canberra, ACT 2601, Australia

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
23 December 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
FMFahira Afzal Maken
Fahira Afzal Maken
FRFabio Ramos
Fabio Ramos
LOLionel Ott
Lionel Ott
Quantification of uncertainty in point cloud matching is critical in many tasks such as pose estimation, sensor fusion, and grasping. Iterative closest point (ICP) is a commonly used pose estimation algorithm which provides a point estimate of the transformation between two point clouds. There are many sources of uncertainty in this process that may arise due to sensor noise, ambiguous environment, initial condition, and occlusion. However, for safety critical problems such as autonomous driving, a point estimate of the pose transformation is not sufficient as it does not provide information about the multiple solutions. Current probabilistic ICP methods usually do not capture all sources of uncertainty and may provide unreliable transformation estimates which can have a detrimental effect in state estimation or decision making tasks that use this information. In this work we propose a new algorithm to align two point clouds that can precisely estimate the uncertainty of ICP’s transformation parameters. We develop a Stein variational inference framework with gradient based optimization of ICP’s cost function. The method provides a non-parametric estimate of the transformation, can model complex multi-modal distributions, and can be effectively parallelized on a GPU. Experiments using 3D kinect data as well as sparse indoor/outdoor LiDAR data show that our method is capable of efficiently producing accurate pose uncertainty estimates.

23 February 2022 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
FMFahira Afzal Maken
Fahira Afzal Maken
FRFabio Ramos
Fabio Ramos
LOLionel Ott
Lionel Ott
Estimation of a dynamical system’s latent state subject to sensor noise and model inaccuracies remains a critical yet difficult problem in robotics. While Kalman filters provide the optimal solution in the least squared sense for linear and Gaussian noise problems, the general nonlinear and non-Gaussian noise case is significantly more complicated, typically relying on sampling strategies that are limited to low-dimensional state spaces. In this letter, we devise a general inference procedure for filtering of nonlinear, non-Gaussian dynamical systems that exploits the differentiability of both the update and prediction models to scale to higher dimensional spaces. Our method, Stein particle filter, can be seen as a deterministic flow of particles, embedded in a reproducing kernel Hilbert space, from an initial state to the desirable posterior. The particles evolve jointly to conform to a posterior approximation while interacting with each other through a repulsive force. We evaluate the method in simulation and in complex localization tasks while comparing it to sequential Monte Carlo solutions.

5 February 2025 in Sensors
Verified
Journal Article
Open access
PDF file
FMFahira Afzal Maken
Fahira Afzal Maken
SMSundaram Muthu
Sundaram Muthu
CNChuong Nguyen
Chuong Nguyen
CSChangming Sun
Changming Sun
JTJinguang Tong
Jinguang Tong
LPLars Petersson
Lars Petersson
High-resolution RGB-D sensors are widely used in computer vision, manufacturing, and robotics. The depth maps from these sensors have inherently high measurement uncertainty that includes both systematic and non-systematic noise. These noisy depth estimates degrade the quality of scans, resulting in less accurate 3D reconstruction, making them unsuitable for some high-precision applications. In this paper, we focus on quantifying the uncertainty in the depth maps of high-resolution RGB-D sensors for the purpose of improving 3D reconstruction accuracy. To this end, we estimate the noise model for a recent high-precision RGB-D structured light sensor called Zivid when mounted on a robot arm. Our proposed noise model takes into account the measurement distance and angle between the sensor and the measured surface. We additionally analyze the effect of background light, exposure time, and the number of captures on the quality of the depth maps obtained. Our noise model seamlessly integrates with well-known classical and modern neural rendering-based algorithms, from KinectFusion to Point-SLAM methods using bilinear interpolation as well as 3D analytical functions. We collect a high-resolution RGB-D dataset and apply our noise model to improve tracking and produce higher-resolution 3D models.

1 July 2022 in The International Journal of Robotics Research
Verified
Journal Article
Closed access
FMFahira Afzal Maken
Fahira Afzal Maken
FRFabio Ramos
Fabio Ramos
LOLionel Ott
Lionel Ott
Accurate localization of a robot in a known environment is a fundamental capability for successfully performing path planning, manipulation, and grasping tasks. Particle filters, also known as Monte Carlo localization (MCL), are a commonly used method to determine the robot’s pose within its environment. For ground robots, noisy wheel odometry readings are typically used as a motion model to predict the vehicle’s location. Such a motion model requires tuning of various parameters based on terrain and robot type. However, such an ego-motion estimation is not always available for all platforms. Scan matching using the iterative closest point (ICP) algorithm is a popular alternative approach, providing ego-motion estimates for localization. Iterative closest point computes a point estimate of the transformation between two poses given point clouds captured at these locations. Being a point estimate method, ICP does not deal with the uncertainties in the scan alignment process, which may arise due to sensor noise, partial overlap, or the existence of multiple solutions. Another challenge for ICP is the high computational cost required to align two large point clouds, limiting its applicability to less dynamic problems. In this paper, we address these challenges by leveraging recent advances in probabilistic inference. Specifically, we first address the run-time issue and propose SGD-ICP, which employs stochastic gradient descent (SGD) to solve the optimization problem of ICP. Next, we leverage SGD-ICP to obtain a distribution over transformations and propose a Markov Chain Monte Carlo method using stochastic gradient Langevin dynamics (SGLD) updates. Our ICP variant, termed Bayesian-ICP, is a full Bayesian solution to the problem. To demonstrate the benefits of Bayesian-ICP for mobile robotic applications, we propose an adaptive motion model employing Bayesian-ICP to produce proposal distributions for Monte Carlo Localization. Experiments using both Kinect and 3D LiDAR data show that our proposed SGD-ICP method achieves the same solution quality as standard ICP while being significantly more efficient. We then demonstrate empirically that Bayesian-ICP can produce accurate distributions over pose transformations and is fast enough for online applications. Finally, using Bayesian-ICP as a motion model alleviates the need to tune the motion model parameters from odometry, resulting in better-calibrated localization uncertainty.

1 April 2015
Verified
Conference Paper
Closed access
FMFahira Afzal Maken
Fahira Afzal Maken
ABAndrew P. Bradley
Andrew P. Bradley
In this paper we investigate multiple instance learning (MIL), using generic tile-based spatio-temporal features, for the classification of benign and malignant lesions in breast cancer magnetic resonance imaging (MRI). In particular, we compare the performance of citation-kNN (CkNN) and conventional kNN against a traditional approach based on bespoke features extracted from a segmented region-of-interest (ROI). Results demonstrate that tile-based CkNN has equivalent performance to ROI-based classification. However, the tile-based approach does not require any domain specific features typically used in breast MRI. This not only has the potential to make tile-based classification robust to inaccuracies in the delineation of suspicious lesions, but also makes it suitable for the detection of suspicious lesions prior to segmentation.

21 February 2026 in Pattern Recognition
Verified
Journal Article
Open access
JTJinguang Tong
Jinguang Tong
XLXuesong Li
Xuesong Li
SMSundaram Muthu
Sundaram Muthu
FMFahira Afzal Maken
Fahira Afzal Maken
LPLars Petersson
Lars Petersson
HLHongdong Li
Hongdong Li