Search alternatives:
convex optimization » codon optimization (Expand Search), model optimization (Expand Search), dose optimization (Expand Search)
based optimization » whale optimization (Expand Search)
binary task » binary mask (Expand Search)
task based » risk based (Expand Search)
convex optimization » codon optimization (Expand Search), model optimization (Expand Search), dose optimization (Expand Search)
based optimization » whale optimization (Expand Search)
binary task » binary mask (Expand Search)
task based » risk based (Expand Search)
-
1
Sample image for illustration.
Published 2024“…<div><p>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. …”
-
2
Quadratic polynomial in 2D image plane.
Published 2024“…<div><p>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. …”
-
3
Comparison analysis of computation time.
Published 2024“…<div><p>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. …”
-
4
Process flow diagram of CBFD.
Published 2024“…<div><p>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. …”
-
5
Precision recall curve.
Published 2024“…<div><p>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. …”