GMD: geometric model-based local binary descriptor

Abstract

Many researchers focused on binary descriptor due to its low computational power. It is an adequate solution for embedded systems. The previous works on the elaboration of binary descriptor did not exploit all information brought by a patch. The authors used just the pixel intensities to generate a binary test, so these descriptors lack efficiency on patch description. In this paper, we design a new descriptor named Geometric Model Descriptor (GMD) based on intensity and geometric coordinate of the pixel. We divide the patch into a grid cell (sub-patches); then each sub-patch is augmented in dimension (being 3D) by considering the intensity as the third dimension rather than its two dimensions (2D) form. Based on geometric modeling (polynomial interpolation and Bezier curve), we interpolate the cloud of points to find an approximation of the geometric model for each sub-patch. A binary test will be performed between the coefficients of sub-patch models to generate the patch description. The deep evaluation of GMD on a benchmark data set shows a high discrimination in the presence of similarity. The GMD exhibits robustness and reliability against severe changes. A computation costing is reported in the results section by presenting a compromise between accuracy and real-time constraint.

https://ift.tt/2TkXqZa