Andrei C. Jalba

ORCID: 0000-0001-9821-0767
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • 3D Shape Modeling and Analysis
  • Computer Graphics and Visualization Techniques
  • Image Processing and 3D Reconstruction
  • Medical Image Segmentation Techniques
  • Advanced Neuroimaging Techniques and Applications
  • Advanced MRI Techniques and Applications
  • Image and Object Detection Techniques
  • Diatoms and Algae Research
  • Advanced Vision and Imaging
  • Image Retrieval and Classification Techniques
  • Digital Filter Design and Implementation
  • Digital Image Processing Techniques
  • Tensor decomposition and applications
  • Image and Signal Denoising Methods
  • Advanced Numerical Analysis Techniques
  • MRI in cancer diagnosis
  • Industrial Vision Systems and Defect Detection
  • Rough Sets and Fuzzy Logic
  • Computational Geometry and Mesh Generation
  • Sparse and Compressive Sensing Techniques
  • Advanced Differential Geometry Research
  • NMR spectroscopy and applications
  • Morphological variations and asymmetry
  • Advanced Data Compression Techniques
  • Water Quality Monitoring Technologies

Eindhoven University of Technology
2014-2025

Computer Algorithms for Medicine
2010

University of Groningen
2002-2009

Universitatea Națională de Știință și Tehnologie Politehnica București
2000

The Discrete Wavelet Transform (DWT) has a wide range of applications from signal processing to video and image compression. We show that this transform, by means the lifting scheme, can be performed in memory computation-efficient way on modern, programmable GPUs, which regarded as massively parallel coprocessors through NVidia's CUDA compute paradigm. three main hardware architectures for 2D DWT (row-column, line-based, block-based) are shown unsuitable implementation. Our CUDA-specific...

10.1109/tpds.2010.143 article EN IEEE Transactions on Parallel and Distributed Systems 2010-08-10

A novel, physically motivated deformable model for shape recovery and segmentation is presented. The model, referred to as the charged-particle (CPM), inspired by classical electrodynamics based on a simulation of charged particles moving in an electrostatic field. charges are attracted towards contours objects interest field, whose sources computed gradient-magnitude image. electric field plays same role potential forces snake while internal interactions modeled repulsive Coulomb forces. We...

10.1109/tpami.2004.84 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 2004-08-16

A multiscale, morphological method for the purpose of shape-based object recognition is presented. connected operator similar to hat-transform defined, and two scale-space representations are built, using curvature function as underlying one-dimensional signal. Each peak valley extracted described by its maximum average heights extent represents an entry in top or bottom scale spaces. We demonstrate based on spaces three large data sets, a set diatom contours, silhouettes from MPEG-7...

10.1109/tip.2005.860606 article EN IEEE Transactions on Image Processing 2006-01-18

We present a GPU-based framework for extracting surface and curve skeletons of 3D shapes represented as large polygonal meshes. use an efficient parallel search strategy to compute point-cloud their distance feature transforms (FTs) with user-defined precision. regularize by new geodesic tracing technique which is orders magnitude faster more accurate than comparable techniques. reconstruct the input from skeleton clouds using fast image-based method. also show how skeletal manifold...

10.1109/tpami.2012.212 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 2012-10-02

Abstract The estimation of object orientation from RGB images is a core component in many modern computer vision pipelines. Traditional techniques mostly predict single per image, learning one-to-one mapping between and rotations. However, when objects exhibit rotational symmetries, they can appear identical multiple viewpoints. This induces ambiguity the problem, making map to rotations one-to-many fashion. In this paper, we explore several ways addressing problem. doing so, specifically...

10.1007/s00138-024-01657-6 article EN cc-by Machine Vision and Applications 2025-01-18

Computing skeletons of 2D shapes, and medial surface curve 3D is a challenging task. In particular, there no unified framework that detects all types using single model, also produces multiscale representation which allows to progressively simplify, or regularize, skeleton types. this paper, we present such framework. We model detection regularization by conservative mass transport process from shape's boundary its skeleton, next finally the shape center. The resulting density field can be...

10.1109/tpami.2015.2414420 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 2015-03-24

We study the evacuation dynamics of a crowd evacuating from complex geometry in presence fire as well slowly spreading smoke curtain. The is composed two kinds individuals: those who know layout building, and do not rely exclusively on potentially informed neighbors to identify path towards exit. aim capture effect knowledge environment has interaction between evacuees their residence time evolving smoke. Our approach genuinely multiscale - we employ two-scale model that able distinguish...

10.1007/s10694-018-0743-x article EN cc-by Fire Technology 2018-06-16

Simulating (elastically) deformable models that can collide with each other and the environment remains a challenging task. The resulting contact problems be elegantly approached using Lagrange multipliers to represent unknown magnitude of response forces. Typical methods construct solve Linear Complementarity Problem (LCP) obtain This requires inverse generalized mass matrix, which is generally hard for deformable-body problems. In this article, we tackle such by directly solving Mixed...

10.1145/3209887 article EN ACM Transactions on Graphics 2019-03-14

Abstract A general framework for automatic segmentation of diatom images is presented. This a critical first step in contour‐based methods identification diatoms by computerized image analysis. We review existing results, adapt popular to this difficult problem, and finally develop method that substantially improves results. based on the watershed from mathematical morphology, belongs class hybrid techniques. The novelty use connected operators computation selection markers, ingredient avoid...

10.1002/jemt.20111 article EN Microscopy Research and Technique 2004-09-01

A physically motivated method for surface reconstruction is proposed that can recover smooth surfaces from noisy and sparse data sets.No orientation information required.By a new technique based on regularized-membrane potentials the input sample points are aggregated, leading to improved noise tolerability outlier removal, without sacrificing much with respect detail (feature) recovery.After aggregating volumetric grid, novel, iterative algorithm used classify grid as exterior or interior...

10.1109/tip.2009.2016141 article EN IEEE Transactions on Image Processing 2009-03-31

Abstract We present a method for extracting complex manifolds with an arbitrary number of (self‐) intersections from unoriented point clouds containing large amounts noise. Manifolds are formed in three‐step process. First, small flat neighbourhoods all possible orientations created around points. Next, assembled into larger quasi‐flat patches, whose overlaps give the global connectivity structure cloud. Finally, curved extracted patch graph via multiple‐source flood fill. The can be...

10.1111/cgf.12255 article EN Computer Graphics Forum 2013-12-12

Abstract Modern MRI measurements deliver volumetric and time‐varying blood‐flow data of unprecedented quality. Visual analysis these potentially leads to a better diagnosis risk assessment various cardiovascular diseases. Recent advances have improved the speed quality imaging considerably. Nevertheless, remains compromised by noise lack spatiotemporal resolution. Besides data, also numerical simulations are employed. These based on mathematical models specific features physical reality....

10.1111/cgf.12368 article EN Computer Graphics Forum 2014-06-01

Abstract We propose a method for digital hair removal from dermoscopic images, based on threshold-set model. For every threshold, we adapt recent gap-detection algorithm to find hairs, and merge results in single mask image.We hairs this by combining morphological filters medial descriptors.We derive robust parameter values our over 300 skin images.We detail GPU implementation of show how it compares favorably with five existing methods, terms removing both long stubble various colors,...

10.1515/mathm-2016-0001 article EN cc-by-nc-nd Mathematical Morphology - Theory and Applications 2016-03-04

We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The employs fast convection algorithm to attract the evolving towards data points. force field in which is convected based on generalized Coulomb potentials evaluated an grid (i.e., octree) using fast, hierarchical algorithm. Formulating as problem velocity generated by offers number of advantages. Unlike methods compute distance set implicit...

10.1109/tvcg.2007.70553 article EN IEEE Transactions on Visualization and Computer Graphics 2007-11-01

Diffusion Tensor Imaging (DTI) allows to noninvasively measure the diffusion of water in fibrous tissue. By reconstructing fibers from DTI data using a fiber-tracking algorithm, we can deduce structure In this paper, outline an approach accelerating such algorithm Graphics Processing Unit (GPU). This which is based on calculation geodesics, has shown promising results for both synthetic and real data, but limited its applicability by high computational requirements. We present solution uses...

10.1155/2011/698908 article EN cc-by International Journal of Biomedical Imaging 2011-01-01
Coming Soon ...