Definition at line 72 of file narf_keypoint.h.
Definition at line 74 of file narf_keypoint.h.
Definition at line 102 of file narf_keypoint.h.
Use some heuristics to decide which areas of the interest image can be left out to improve the runtime.
Definition at line 113 of file narf_keypoint.h.
All points in this distance to a found maximum, that are above min_interest_value are also added as interest points (this is a factor for support_size, i.e.
Definition at line 98 of file narf_keypoint.h.
Definition at line 104 of file narf_keypoint.h.
Definition at line 83 of file narf_keypoint.h.
Definition at line 110 of file narf_keypoint.h.
Definition at line 84 of file narf_keypoint.h.
Definition at line 91 of file narf_keypoint.h.
Definition at line 92 of file narf_keypoint.h.
If this is >0, the exact position of the interest point is determined using bivariate polynomial approximations of the interest values of the area.
Definition at line 107 of file narf_keypoint.h.
Definition at line 87 of file narf_keypoint.h.
The size (in pixels) of the image patches from which the interest value should be computed.
This influences, which range image is selected from the scale space to compute the interest value of a pixel at a certain distance.
Definition at line 93 of file narf_keypoint.h.
Definition at line 82 of file narf_keypoint.h.
Try to decrease runtime by extracting interest points at lower reolution in areas that contain enough points, i.e., have lower range.
Definition at line 111 of file narf_keypoint.h.