FAST COMPUTATION OF RFD-LIKE DESCRIPTORS IN FOUR ORIENTATIONS
The computation of local feature descriptors for image matching in computer vision can be computationally expensive for real-time on-device applications. Accordingly, disclosed embodiments speed up such computations by precomputing values for gradient maps, and storing them in lookup tables indexed...
Saved in:
Main Authors | , , |
---|---|
Format | Patent |
Language | English |
Published |
01.08.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The computation of local feature descriptors for image matching in computer vision can be computationally expensive for real-time on-device applications. Accordingly, disclosed embodiments speed up such computations by precomputing values for gradient maps, and storing them in lookup tables indexed by partial derivatives. In addition, certain embodiments introduce global smoothing, and optionally, global gradient maps. In an embodiment that eliminates all floating-point operations, arctangents can be precomputed for a fixed number of angles, and quantization can be performed when computing the local feature descriptors. |
---|---|
Bibliography: | Application Number: US202418409675 |