Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Abed Malti

dblp:33/8365 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 5 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 first-authorSystems, architecture and hardware · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
3D vision · 97% Robot navigation and mapping · 3%
Theoretical computer science
3 papers
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › 3d shape reconstruction
shape-from-template
0.732017
Elastic Shape-from-Template with Spatially Sparse Deforming Forces · CVPR 2017
A linear least-squares solution to elastic Shape-from-Template · CVPR 2015
Monocular Template-Based 3D Reconstruction of Extensible Surfaces with Local Linear Elasticity · CVPR 2013
Computer vision › 3D vision › 3d reconstruction › non-rigid reconstruction
deformable surface reconstruction
0.532017
A linear least-squares solution to elastic Shape-from-Template · CVPR 2015
Monocular Template-Based 3D Reconstruction of Extensible Surfaces with Local Linear Elasticity · CVPR 2013
Elastic Shape-from-Template with Spatially Sparse Deforming Forces · CVPR 2017
Mathematical optimization
sparse optimization
0.312017
Elastic Shape-from-Template with Spatially Sparse Deforming Forces · CVPR 2017
Computer vision › 3D vision
feature detection and matching
0.112010
Feature detection and matching in images with radial distortion · ICRA 2010
Medical and health informatics
computer-assisted surgery
0.112010
Robust hand-eye calibration for computer aided medical endoscopy · ICRA 2010
Mathematical optimization
least squares
0.112015
A linear least-squares solution to elastic Shape-from-Template · CVPR 2015
Mathematical optimization › discrete optimization
energy minimization
0.012013
Monocular Template-Based 3D Reconstruction of Extensible Surfaces with Local Linear Elasticity · CVPR 2013
Robotics › Robot navigation and mapping › SLAM
visual SLAM
0.012010
Feature detection and matching in images with radial distortion · ICRA 2010
Computational photography and imaging
camera calibration
0.012010
Robust hand-eye calibration for computer aided medical endoscopy · ICRA 2010

Methods — techniques the papers use, named apart from their topics

elastic model · 0.6stiffness matrix · 0.4solid boundary constraints · 0.4linear least squares · 0.4stretching energy · 0.3poisson ratio · 0.3linear elasticity · 0.3ℓ0-norm minimization · 0.3l1-norm relaxation · 0.3l1 norm relaxation · 0.3l0-norm minimization · 0.3dual quaternion · 0.2SE(3) optimization · 0.2adaptive gaussian filtering · 0.1
YearPublicationVenuePosition
2021 On the exact recovery conditions of 3D human motion from 2D landmark motion with sparse articulated motion
Abed Malti
Comput. Vis. Image Underst.1
2017 Elastic Shape-from-Template with Spatially Sparse Deforming Forces
abstract
Current Elastic SfT (Shape from Template) methods are based on ℓ2-norm minimization. None can accurately recover the spatial location of the acting forces since ℓ2-norm based minimization tends to find the best tradeoff among noisy data to fit an elastic model. In this work, we study shapes that are deformed with spatially sparse set of forces. We propose two formulations for a new class of SfT problems dubbed here SLE-SfT (Sparse Linear Elastic-SfT). The First ideal formulation uses an ℓ0-norm to minimize the cardinal of non-zero components of the deforming forces. The second relaxed formulation uses an ℓ1-norm to minimize the sum of absolute values of force components. These new formulations do not use Solid Boundary Constraints (SBC) which are usually needed to rigidly position the shape in the frame of the deformed image. We introduce the Projective Elastic Space Property (PESP) that jointly encodes the reprojection constraint and the elastic model. We prove that filling this property is necessary and sufficient for the relaxed formulation to: (i) retrieve the ground-truth 3D deformed shape, (ii) recover the right spatial domain of non-zero deforming forces. (iii) It also proves that we can rigidly place the deformed shape in the image frame without using SBC. Finally, we prove that when filling PESP, resolving the relaxed formulation provides the same ground-truth solution as the ideal formulation. Results with simulated and real data show substantial improvements in recovering the deformed shapes as well as the spatial location of the deforming forces.
Abed Malti, Cédric Herzet
CVPR1
2016 Safe screening tests for LASSO based on firmly non-expansiveness
abstract
This paper focusses on safe screening techniques for the LASSO problem. We derive a new sphere test, coined RFNE, exploiting the firmly non-expansiveness of projection operators. Our test generalizes some methods of the literature but, unlike the latter, exploits approximated primal-dual solutions of the LASSO problem while remaining safe and effective. Our simulation results show that the proposed RFNE test outperforms the best methodology of the state of the art, namely the GAP test derived by Fercoq et al.
Abed Malti, Cédric Herzet
ICASSP1
2015 A linear least-squares solution to elastic Shape-from-Template
abstract
We cast SfT (Shape-from-Template) as the search of a vector field (X, δX), composed of the pose X and the displacement δX that produces the deformation. We propose the first fully linear least-squares SfT method modeling elastic deformations. It relies on a set of Solid Boundary Constraints (SBC) to position the template at X in the deformed frame. The displacement is mapped by the stiffness matrix to minimize the amount of force responsible for the deformation. This linear minimization is subjected to the Reprojection Boundary Constraints (RBC) of the deformed shape X + δX on the deformed image. Compared to state-of-the-art methods, this new formulation allows us to obtain accurate results at a low computation cost.
Abed Malti, Adrien Bartoli, Richard I. Hartley
CVPR1
2013 Monocular Template-Based 3D Reconstruction of Extensible Surfaces with Local Linear Elasticity
abstract
We propose a new approach for template-based extensible surface reconstruction from a single view. We extend the method of isometric surface reconstruction and more recent work on conformal surface reconstruction. Our approach relies on the minimization of a proposed stretching energy formalized with respect to the Poisson ratio parameter of the surface. We derive a patch-based formulation of this stretching energy by assuming local linear elasticity. This formulation unifies geometrical and mechanical constraints in a single energy term. We prevent local scale ambiguities by imposing a set of fixed boundary 3D points. We experimentally prove the sufficiency of this set of boundary points and demonstrate the effectiveness of our approach on different developable and non-developable surfaces with a wide range of extensibility.
Abed Malti, Richard I. Hartley, Adrien Bartoli, Jae-Hak Kim
CVPR1
2010 Feature detection and matching in images with radial distortion
abstract
Image keypoints are broadly used in robotics for different purposes, ranging from recognition to 3D reconstruction, passing by SLAM and visual servoing. Robust keypoint matching across different views is problematic because of the relative motion between camera and scene that causes significant changes in feature appearance. The problem can be partially overcome by using state-of-the-art methods for keypoint detection and matching, that are resilient to common affine transformations such as changes in scale and rotation. Unfortunately, these approaches are not invariant to the radial distortion present in images acquired by cameras with wide field-of-view. This article proposes modifications to the Scale Invariant Feature Transform (SIFT), that improve the repeatability of detection and effectiveness of matching in the presence of distortion, while preserving the characteristics of invariance to scale and rotation. These modifications require an approximate modeling of the image distortion, and consist in using adaptative gaussian filtering for detection and implicit gradient correction for description. Extensive experiments, with both synthetic and real images, show that our method outperforms explicit distortion correction using image rectification.
Miguel Lourenço, João Pedro Barreto 0001, Abed Malti
ICRA3
2010 Robust hand-eye calibration for computer aided medical endoscopy
abstract
Endoscopic camera for surgical navigation and 3D visualization requires precise and stable estimates of the calibration parameters. The estimation of the hand-eye transform between the camera frame and the opto-tracked body of the endoscope is an important issue of the calibration. This paper presents a new stable method for the hand-eye calibration problem. The most popular method estimates the transform directly in the special euclidean group SE(3) by computing separately the rotation and the translation. The second famous approach formulates the problem in the dual quaternion space and estimates jointly the rotation and the translation. In a first glance, the simultaneous estimation seems to be always advantageous. However, and according to the experiments, this is not the case for the rotation estimation that is affected by the noise in translation. Our approach takes advantage of the both methods and uses the dual quaternion to estimate separately the rotation and the translation. We show experimentally that our algorithm is more stable with minimal number and small amplitude of motions.
Abed Malti, João Pedro Barreto 0001
ICRA1