Home
last modified time | relevance | path

Searched refs:num_corners (Results 1 – 4 of 4) sorted by relevance

/external/libaom/libaom/third_party/fastfeat/
Dfast.c9 int num_corners; in fast9_detect_nonmax() local
13 corners = fast9_detect(im, xsize, ysize, stride, b, &num_corners); in fast9_detect_nonmax()
14 scores = fast9_score(im, stride, corners, num_corners, b); in fast9_detect_nonmax()
15 nonmax = nonmax_suppression(corners, scores, num_corners, ret_num_corners); in fast9_detect_nonmax()
Dnonmax.c8 xy* nonmax_suppression(const xy* corners, const int* scores, int num_corners, int* ret_num_nonmax) in nonmax_suppression() argument
15 const int sz = (int)num_corners; in nonmax_suppression()
23 if(num_corners < 1) in nonmax_suppression()
29 ret_nonmax = (xy*)malloc(num_corners * sizeof(xy)); in nonmax_suppression()
34 last_row = corners[num_corners-1].y; in nonmax_suppression()
42 for(i=0; i< num_corners; i++) in nonmax_suppression()
Dfast.h12 int* fast9_score(const byte* i, int stride, xy* corners, int num_corners, int b);
16 xy* nonmax_suppression(const xy* corners, const int* scores, int num_corners, int* ret_num_nonmax);
Dfast_9.c2961 int* fast9_score(const byte* i, int stride, xy* corners, int num_corners, int b) in fast9_score() argument
2963 int* scores = (int*)malloc(sizeof(int)* num_corners); in fast9_score()
2969 for(n=0; n < num_corners; n++) in fast9_score()
2978 int num_corners=0; in fast9_detect() local
5895 if(num_corners == rsize) in fast9_detect()
5900 ret_corners[num_corners].x = x; in fast9_detect()
5901 ret_corners[num_corners].y = y; in fast9_detect()
5902 num_corners++; in fast9_detect()
5906 *ret_num_corners = num_corners; in fast9_detect()