Ibrahim Jubran
YOU?
Author Swipe
View article: Newton-PnP: Real-time Visual Navigation for Autonomous Toy-Drones
Newton-PnP: Real-time Visual Navigation for Autonomous Toy-Drones Open
The Perspective-n-Point problem aims to estimate the relative pose between a calibrated monocular camera and a known 3D model, by aligning pairs of 2D captured image points to their corresponding 3D points in the model. We suggest an algor…
View article: Introduction to Coresets: Approximated Mean
Introduction to Coresets: Approximated Mean Open
A \emph{strong coreset} for the mean queries of a set $P$ in ${\mathbb{R}}^d$ is a small weighted subset $C\subseteq P$, which provably approximates its sum of squared distances to any center (point) $x\in {\mathbb{R}}^d$. A \emph{weak cor…
View article: Unsupervised High-Fidelity Facial Texture Generation and Reconstruction
Unsupervised High-Fidelity Facial Texture Generation and Reconstruction Open
Many methods have been proposed over the years to tackle the task of facial 3D geometry and texture recovery from a single image. Such methods often fail to provide high-fidelity texture without relying on 3D facial scans during training. …
View article: Coresets for the Average Case Error for Finite Query Sets
Coresets for the Average Case Error for Finite Query Sets Open
Coreset is usually a small weighted subset of an input set of items, that provably approximates their loss function for a given set of queries (models, classifiers, hypothesis). That is, the maximum (worst-case) error over all queries is b…
View article: Coresets for Decision Trees of Signals
Coresets for Decision Trees of Signals Open
A $k$-decision tree $t$ (or $k$-tree) is a recursive partition of a matrix (2D-signal) into $k\geq 1$ block matrices (axis-parallel rectangles, leaves) where each rectangle is assigned a real label. Its regression or classification loss to…
View article: Provably Approximated ICP
Provably Approximated ICP Open
The goal of the \emph{alignment problem} is to align a (given) point cloud $P = \{p_1,\cdots,p_n\}$ to another (observed) point cloud $Q = \{q_1,\cdots,q_n\}$. That is, to compute a rotation matrix $R \in \mathbb{R}^{3 \times 3}$ and a tra…
View article: CoBe - Coded Beacons for Localization, Object Tracking, and SLAM Augmentation
CoBe - Coded Beacons for Localization, Object Tracking, and SLAM Augmentation Open
This paper presents a novel beacon light coding protocol, which enables fast and accurate identification of the beacons in an image. The protocol is provably robust to a predefined set of detection and decoding errors, and does not require…
View article: Faster PAC Learning and Smaller Coresets via Smoothed Analysis
Faster PAC Learning and Smaller Coresets via Smoothed Analysis Open
PAC-learning usually aims to compute a small subset ($\varepsilon$-sample/net) from $n$ items, that provably approximates a given loss function for every query (model, classifier, hypothesis) from a given set of queries, up to an additive …
View article: Autonomous Toy Drone via Coresets for Pose Estimation
Autonomous Toy Drone via Coresets for Pose Estimation Open
A coreset of a dataset is a small weighted set, such that querying the coreset provably yields a ( 1 + ε )-factor approximation to the original (full) dataset, for a given family of queries. This paper suggests accurate coresets ( ε = 0 ) …
View article: Sets Clustering
Sets Clustering Open
The input to the \emph{sets-$k$-means} problem is an integer $k\geq 1$ and a set $\mathcal{P}=\{P_1,\cdots,P_n\}$ of sets in $\mathbb{R}^d$. The goal is to compute a set $C$ of $k$ centers (points) in $\mathbb{R}^d$ that minimizes the sum …
View article: Sets Clustering
Sets Clustering Open
The input to the \emph{sets-$k$-means} problem is an integer $k\geq 1$ and a set $\mathcal{P}=\{P_1,\cdots,P_n\}$ of sets in $\mathbb{R}^d$. The goal is to compute a set $C$ of $k$ centers (points) in $\mathbb{R}^d$ that minimizes the sum …
View article: Introduction to Coresets: Accurate Coresets
Introduction to Coresets: Accurate Coresets Open
A coreset (or core-set) of an input set is its small summation, such that solving a problem on the coreset as its input, provably yields the same result as solving the same problem on the original (full) set, for a given family of problems…
View article: Fast and Accurate Least-Mean-Squares Solvers
Fast and Accurate Least-Mean-Squares Solvers Open
Least-mean squares (LMS) solvers such as Linear / Ridge / Lasso-Regression, SVD and Elastic-Net not only solve fundamental machine learning problems, but are also the building blocks in a variety of other methods, such as decision trees an…
View article: Provable Approximations for Constrained $\ell_p$ Regression
Provable Approximations for Constrained $\ell_p$ Regression Open
The $\ell_p$ linear regression problem is to minimize $f(x)=||Ax-b||_p$ over $x\in\mathbb{R}^d$, where $A\in\mathbb{R}^{n\times d}$, $b\in \mathbb{R}^n$, and $p>0$. To avoid overfitting and bound $||x||_2$, the constrained $\ell_p$ regress…
View article: Aligning Points to Lines: Provable Approximations
Aligning Points to Lines: Provable Approximations Open
We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computationa…
View article: Minimizing Sum of Non-Convex but Piecewise log-Lipschitz Functions using Coresets.
Minimizing Sum of Non-Convex but Piecewise log-Lipschitz Functions using Coresets. Open
We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computationa…
View article: The decline of HCV and HBV infection prevalence among haemodialysis patients in Southern Saudi Arabia: a success story
The decline of HCV and HBV infection prevalence among haemodialysis patients in Southern Saudi Arabia: a success story Open
Introduction and objective: Chronic hepatitis C and B impose a significant mortality and morbidity burden worldwide and particularly in the Kingdom of Saudi Arabia (KSA).In haemodialysis patients (HD) patients, chronic hepatitis, especiall…
View article: CoBe -- Coded Beacons for Localization, Object Tracking, and SLAM\n Augmentation
CoBe -- Coded Beacons for Localization, Object Tracking, and SLAM\n Augmentation Open
This paper presents a novel beacon light coding protocol, which enables fast\nand accurate identification of the beacons in an image. The protocol is\nprovably robust to a predefined set of detection and decoding errors, and does\nnot requ…