Ajad Chhatkuli

Dr. Ajad Chhatkuli


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
19 April 2024 in Machine Intelligence Research
Verified
Journal Article
Open access
PDF file
YLYun Liu
Yun Liu
YWYu-Huan Wu
Yu-Huan Wu
GSGuolei Sun
Guolei Sun
LZLe Zhang
Le Zhang
ACAjad Chhatkuli
Ajad Chhatkuli
LGLuc Van Gool
Luc Van Gool
This paper tackles the high computational/space complexity associated with multi-head self-attention (MHSA) in vanilla vision transformers. To this end, we propose hierarchical MHSA (H-MHSA), a novel approach that computes sell-attention in a hierarchical fashion. Specifically, we first divide the input image into patches as commonly done, and each patch is viewed as a token. Then, the proposed H-MHSA learns token relationships within local patches, serving as local relationship modeling. Then, the small patches are merged into larger ones, and H-MHSA models the global dependencies for the small number of the merged tokens. At last, the local and global attentive features are aggregated to obtain features with powerful representation capacity. Since we only calculate attention for a limited number of tokens at each step, the computational load is reduced dramatically. Hence, H-MHSA can efficiently model global relationships among tokens without sacrificing fine-grained information. With the H-MHSA module incorporated, we build a family of hierarchical-attention-based transformer networks, namely HAT-Net. To demonstrate the superiority of HAT-Net in scene understanding, we conduct extensive experiments on fundamental vision tasks, including image classification, semantic segmentation, object detection and instance segmentation. Therefore, HAT-Net provides a new perspective for vision transformers. Code and pretrained models are available at https://github.com/yun-liu/HAT-Net .

4 May 2016 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
ACAjad Chhatkuli
Ajad Chhatkuli
DPDaniel Pizarro
Daniel Pizarro
ABAdrien Bartoli
Adrien Bartoli
TCToby Collins
Toby Collins
Shape-from-Template (SfT) reconstructs the shape of a deforming surface from a single image, a 3D template and a deformation prior. For isometric deformations, this is a well-posed problem. However, previous methods which require no initialization break down when the perspective effects are small, which happens when the object is small or viewed from larger distances. That is, they do not handle all projection geometries. We propose stable SfT methods that accurately reconstruct the 3D shape for all projection geometries. We follow the existing approach of using first-order differential constraints and obtain local analytical solutions for depth and the first-order quantities: the depth-gradient or the surface normal. Previous methods use the depth solution directly to obtain the 3D shape. We prove that the depth solution is unstable when the projection geometry tends to affine, while the solution for the first-order quantities remain stable for all projection geometries. We therefore propose to solve SfT by first estimating the first-order quantities (either depth-gradient or surface normal) and integrating them to obtain shape. We validate our approach with extensive synthetic and real-world experiments and obtain significantly more accurate results compared to previous initialization-free methods. Our approach does not require any optimization, which makes it very fast.

27 November 2017 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
TPThomas Probst
Thomas Probst
KMKevis-Kokitsi Maninis
Kevis-Kokitsi Maninis
ACAjad Chhatkuli
Ajad Chhatkuli
MOMouloud Ourak
Mouloud Ourak
EPEmmanuel Benjamin Vander Poorten
Emmanuel Benjamin Vander Poorten
LGLuc Van Gool
Luc Van Gool
Computer vision and robotics are being increasingly applied in medical interventions. Especially in interventions where extreme precision is required, they could make a difference. One such application is robot-assisted retinal microsurgery. In recent works, such interventions are conducted under a stereo-microscope, and with a robot-controlled surgical tool. The complementarity of computer vision and robotics has, however, not yet been fully exploited. In order to improve the robot control, we are interested in three-dimensional (3-D) reconstruction of the anatomy and in automatic tool localization using a stereo microscope. In this letter, we solve this problem for the first time using a single pipeline, starting from uncalibrated cameras to reach metric 3-D reconstruction and registration, in retinal microsurgery. The key ingredients of our method are 1) surgical tool landmark detection, and 2) 3-D reconstruction with the stereo microscope, using the detected landmarks. To address the former, we propose a novel deep learning method that detects and recognizes keypoints in high-definition images at higher than real-time speed. We use the detected two-dimensional keypoints along with their corresponding 3-D coordinates obtained from the robot sensors to calibrate the stereo microscope using an affine projection model. We design an online 3-D reconstruction pipeline that makes use of smoothness constraints and performs robot-to-camera registration. The entire pipeline is extensively validated on open-sky porcine eye sequences. Quantitative and qualitative results are presented for all steps.

13 October 2017 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
ACAjad Chhatkuli
Ajad Chhatkuli
DPDaniel Pizarro
Daniel Pizarro
TCToby Collins
Toby Collins
ABAdrien Bartoli
Adrien Bartoli
We present a global and convex formulation for the templateless 3D reconstruction of a deforming object with the perspective camera. We show for the first time how to construct a Second-Order Cone Programming (SOCP) problem for Non-Rigid Structure-from-Motion (NRSfM) using the Maximum-Depth Heuristic (MDH). In this regard, we deviate strongly from the general trend of using affine cameras and factorization-based methods to solve NRSfM, which do not perform well with complex nonlinear deformations. In MDH, the points' depths are maximized so that the distance between neighbouring points in camera space are upper bounded by the geodesic distance. In NRSfM both geodesic and camera space distances are unknown. We show that, nonetheless, given point correspondences and the camera's intrinsics the whole problem can be solved with SOCP. This is the first convex formulation for NRSfM with physical constraints. We further present how robustness and temporal continuity can be included in the formulation to handle outliers and decrease the problem size, respectively. We show with extensive experiments that our methods accurately reconstruct quasi-isometric objects from partial views under articulated and strong deformations. Compared to the previous methods, our approach gives better or similar accuracy. It naturally handles missing correspondences, non-smooth objects and is very simple to implement compared to previous methods, with only one free parameter (the neighbourhood size).

1 November 2024
Verified
Book Chapter
Closed access
PDF file
PPPramish Paudel
Pramish Paudel
AKAnubhav Khanal
Anubhav Khanal
DPDanda Pani Paudel
Danda Pani Paudel
JTJyoti Tandukar
Jyoti Tandukar
ACAjad Chhatkuli
Ajad Chhatkuli

22 October 2024 in International Journal of Computer Vision
Verified
Journal Article
Open access
PDF file
EREdoardo Mello Rella
Edoardo Mello Rella
ACAjad Chhatkuli
Ajad Chhatkuli
EKEnder Konukoglu
Ender Konukoglu
LGLuc Van Gool
Luc Van Gool
Neural implicit fields have recently shown increasing success in representing, learning and analysis of 3D shapes. Signed distance fields and occupancy fields are still the preferred choice of implicit representations with well-studied properties, despite their restriction to closed surfaces. With neural networks, unsigned distance fields as well as several other variations and training principles have been proposed with the goal to represent all classes of shapes. In this paper, we develop a novel and yet a fundamental representation considering unit vectors in 3D space and call it Vector Field (VF). At each point in $$\mathbb {R}^3$$ R 3 , VF is directed to the closest point on the surface. We theoretically demonstrate that VF can be easily transformed to surface density by computing the flux density. Unlike other standard representations, VF directly encodes an important physical property of the surface, its normal. We further show the advantages of VF representation, in learning open, closed, or multi-layered surfaces. We show that, thanks to the continuity property of the neural optimization with VF, a separate distance field becomes unnecessary for extracting surfaces from the implicit field via Marching Cubes. We compare our method on several datasets including ShapeNet where the proposed new neural implicit field shows superior accuracy in representing any type of shape, outperforming other standard methods. Codes are available at https://github.com/edomel/ImplicitVF.