# Convex-based lightweight feature descriptor for Augmented Reality Tracking

**Authors:** Indhumathi S., Christopher Clement J.

PMC · DOI: 10.1371/journal.pone.0305199 · 2024-07-18

## TL;DR

This paper introduces a new feature descriptor for augmented reality that is faster and more accurate than existing methods.

## Contribution

The novel Convex Based Feature Descriptor (CBFD) system is introduced for efficient and robust augmented reality tracking.

## Key findings

- CBFD achieves an average precision of 0.97, outperforming existing feature descriptors like Superpoint and SIFT.
- CBFD has a computation time of 2.8 ms, which is 6.7% faster than other algorithms.
- CBFD shows minimal feature location distance compared to DITF and HOG.

## Abstract

Feature description is a critical task in Augmented Reality Tracking. This article introduces a Convex Based Feature Descriptor (CBFD) system designed to withstand rotation, lighting, and blur variations while remaining computationally efficient. We have developed two filters capable of computing pixel intensity variations, followed by the covariance matrix of the polynomial to describe the features. The superiority of CBFD is validated through precision, recall, computation time, and feature location distance. Additionally, we provide a solution to determine the optimal block size for describing nonlinear regions, thereby enhancing resolution. The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. Noteworthy is CBFD’s recall value of 0.87 representing at the maximum of a 13.6% improvement over Superpoint, DITF, BRIEF, BRISK, SURF, and SIFT. Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). These results highlight the speed and robustness of CBFD across various transformations.

## Full-text entities

- **Diseases:** CBFD (MESH:D005413)
- **Chemicals:** Grid (-)
- **Species:** Homo sapiens (human, species) [taxon 9606]

## Figures

42 figures with captions in the complete paper: https://tomesphere.com/paper/PMC11257345/full.md

---
Source: https://tomesphere.com/paper/PMC11257345