Rectification from Radially-Distorted Scales

This paper introduces the first minimal solvers that jointly estimate lens distortion and affine rectification from repetitions of rigidly transformed coplanar local features. The proposed solvers incorporate lens distortion into the camera model and extend accurate rectification to wide-angle images that contain nearly any type of coplanar repeated content. We demonstrate a principled approach to generating stable minimal solvers by the Grobner basis method, which is accomplished by sampling feasible monomial bases to maximize numerical stability. Synthetic and real-image experiments confirm that the solvers give accurate rectifications from noisy measurements when used in a RANSAC-based estimator. The proposed solvers demonstrate superior robustness to noise compared to the state-of-the-art. The solvers work on scenes without straight lines and, in general, relax the strong assumptions on scene content made by the state-of-the-art. Accurate rectifications on imagery that was taken with narrow focal length to near fish-eye lenses demonstrate the wide applicability of the proposed method. The method is fully automated, and the code is publicly available at https://github.com/prittjam/repeats.Comment: pre-prin

Digital hyperplane fitting

International audienceThis paper addresses the hyperplane fitting problem of discrete points in any dimension (i.e. in Z d). For that purpose, we consider a digital model of hyperplane, namely digital hyperplane, and present a combinatorial approach to find the optimal solution of the fitting problem. This method consists in computing all possible digital hyperplanes from a set S of n points, then an exhaustive search enables us to find the optimal hyperplane that best fits S. The method has, however, a high complexity of O(n d), and thus can not be applied for big datasets. To overcome this limitation, we propose another method relying on the Delaunay triangulation of S. By not generating and verifying all possible digital hyperplanes but only those from the elements of the triangula-tion, this leads to a lower complexity of O(n d 2 +1). Experiments in 2D, 3D and 4D are shown to illustrate the efficiency of the proposed method

A Scale Independent Selection Process for 3D Object Recognition in Cluttered Scenes

During the last years a wide range of algorithms and devices have been made available to easily acquire range images. The increasing abundance of depth data boosts the need for reliable and unsupervised analysis techniques, spanning from part registration to automated segmentation. In this context, we focus on the recognition of known objects in cluttered and incomplete 3D scans. Locating and fitting a model to a scene are very important tasks in many scenarios such as industrial inspection, scene understanding, medical imaging and even gaming. For this reason, these problems have been addressed extensively in the literature. Several of the proposed methods adopt local descriptor-based approaches, while a number of hurdles still hinder the use of global techniques. In this paper we offer a different perspective on the topic: We adopt an evolutionary selection algorithm that seeks global agreement among surface points, while operating at a local level. The approach effectively extends the scope of local descriptors by actively selecting correspondences that satisfy global consistency constraints, allowing us to attack a more challenging scenario where model and scene have different, unknown scales. This leads to a novel and very effective pipeline for 3D object recognition, which is validated with an extensive set of experiment

A computerized craniofacial reconstruction method for an unidentified skull based on statistical shape models

Craniofacial reconstruction (CFR) has been widely used to produce the facial appearance of an unidentified skull in the realm of forensic science. Many studies have indicated that the computerized CFR approach is fast, flexible, consistent and objective in comparison to the traditional manual CFR approach. This paper presents a computerized CFR system called CFRTools, which features a CFR method based on a statistical shape model (SSM) of living human head models. Given an unidentified skull, a geometrically-similar template skull is chosen as a template, and a non-registration method is used to improve the accuracy of the construction of dense corresponding vertices through the alignment of the template and the unidentified skull. Generalized Procrustes analysis (GPA) and principal component analysis (PCA) are carried out to construct the skull and face SSMs. The sex of the unidentified skull is then predicted based on skull SSM and centroid size, rather than geometric measurements based on anatomical landmarks. Furthermore, a craniofacial morphological relationship which is learnt from the principal component (PC) scores of the skull and face dataset is used to produce a possible reconstructed face. Finally, multiple possible reconstructed faces for the same skull can further be recreated based on adjusting the PC coefficients. The experimental results show that the average rate of sex classification is 97.14% and the reconstructed face of the unidentified skull can be produced. In addition, experts’ understanding and experience can be harnessed in production of face variations for the same skull, which can further be used as a reference for portraiture creation