Andrei JALBA

Dr. Andrei JALBA


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
2 October 2012 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
AJAndrei JALBA
Andrei JALBA
JKJacek Kustra
Jacek Kustra
ATAlexandru C. Telea
Alexandru C. Telea
We present a GPU-based framework for extracting surface and curve skeletons of 3D shapes represented as large polygonal meshes. We use an efficient parallel search strategy to compute point-cloud skeletons and their distance and feature transforms (FTs) with user-defined precision. We regularize skeletons by a new GPU-based geodesic tracing technique which is orders of magnitude faster and more accurate than comparable techniques. We reconstruct the input surface from skeleton clouds using a fast and accurate image-based method. We also show how to reconstruct the skeletal manifold structure as a polygon mesh and the curve skeleton as a polyline. Compared to recent skeletonization methods, our approach offers two orders of magnitude speed-up, high-precision, and low-memory footprints. We demonstrate our framework on several complex 3D models.

11 February 2011 in Journal of Mathematical Imaging and Vision
Verified
Journal Article
Closed access
PDF file
LALaura Astola
Laura Astola
AJAndrei JALBA
Andrei JALBA
EBEvgeniya Balmashnova
Evgeniya Balmashnova
LFLuc Florack
Luc Florack

12 December 2013 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
JKJacek Kustra
Jacek Kustra
AJAndrei JALBA
Andrei JALBA
Alexandru TeleaAlexandru Telea
Alexandru Telea

1 September 2020 in Computer Graphics Forum
Verified
Journal Article
Open access
PDF file
NHN. H. L. C. de Hoon
N. H. L. C. de Hoon
AJAndrei JALBA
Andrei JALBA
EFE.S. Farag
E.S. Farag
POPim van Ooij
Pim van Ooij
ANA.J. Nederveen
A.J. Nederveen
AVA. Vilanova
A. Vilanova
Phase-Contrast Magnetic Resonance Imaging (PC-MRI) surpasses all other imaging methods in quality and completeness for measuring time-varying volumetric blood flows and has shown potential to improve both diagnosis and risk assessment of cardiovascular diseases. However, like any measurement of physical phenomena, the data are prone to noise, artefacts and has a limited resolution. Therefore, PC-MRI data itself do not fulfil physics fluid laws making it difficult to distinguish important flow features. For data analysis, physically plausible and high-resolution data are required. Computational fluid dynamics provides high-resolution physically plausible flows. However, the flow is inherently coupled to the underlying anatomy and boundary conditions, which are difficult or sometimes even impossible to adequately model with current techniques. We present a novel methodology using data assimilation techniques for PC-MRI noise and artefact removal, generating physically plausible flow close to the measured data. It also allows us to increase the spatial and temporal resolution. To avoid sensitivity to the anatomical model, we consider and update the full 3D velocity field. We demonstrate our approach using phantom data with various amounts of induced noise and show that we can improve the data while preserving important flow features, without the need of a highly detailed model of the anatomy.

8 January 2015 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
AJAndrei JALBA
Andrei JALBA
MWMichel A. Westenberg
Michel A. Westenberg
JRJos B. T. M. Roerdink
Jos B. T. M. Roerdink
Magnetic resonance diffusion tensor imaging (DTI) measures diffusion of water molecules and is used to characterize orientation of white matter fibers and connectivity of neurological structures. Segmentation and visualization of DT images is challenging, because of low data quality and complexity of anatomical structures. In this paper, we propose an interactive segmentation approach, based on a hierarchical representation of the input DT image through a tree structure. The tree is obtained by successively merging watershed regions, based on the morphological waterfall approach, hence the name watershed tree. Region merging is done according to a combined similarity and homogeneity criterion. We introduce filters that work on the proposed tree representation, and that enable region-based attribute filtering of DTI data. Linked views between the visualizations of the simplified DT image and the tree enable a user to visually explore both data and tree at interactive rates. The coupling of filtering, semiautomatic segmentation by labeling nodes in the tree, and various interaction mechanisms support the segmentation task. Our method is robust against noise, which we demonstrate on synthetic and real DTI data.

18 January 2025 in Machine Vision and Applications
Verified
Journal Article
Open access
PDF file
TBTijn Bertens
Tijn Bertens
BCBrandon Caasenbrood
Brandon Caasenbrood
ASAlessandro Saccon
Alessandro Saccon
AJAndrei JALBA
Andrei JALBA
The estimation of object orientation from RGB images is a core component in many modern computer vision pipelines. Traditional techniques mostly predict a single orientation per image, learning a one-to-one mapping between images and rotations. However, when objects exhibit rotational symmetries, they can appear identical from multiple viewpoints. This induces ambiguity in the estimation problem, making images map to rotations in a one-to-many fashion. In this paper, we explore several ways of addressing this problem. In doing so, we specifically consider algorithms that can map an image to a range of multiple rotation estimates, accounting for symmetry-induced ambiguity. Our contributions are threefold. Firstly, we create a data set with annotated symmetry information that covers symmetries induced through self-occlusion. Secondly, we compare and evaluate various learning strategies for multiple-hypothesis prediction models applied to orientation estimation. Finally, we propose to model orientation estimation as a binary classification problem. To this end, based on existing work from the field of shape reconstruction, we design a neural network that can be sampled to reconstruct the full range of ambiguous rotations for a given image. Quantitative evaluation on our annotated data set demonstrates its performance and motivates our design choices.