#include <algorithm>
#include <iostream>
#include <fstream>
#include <stdlib.h>
#include <math.h>
#include "yape.h"
Go to the source code of this file.
Defines | |
#define | A_INF (A < Im) |
#define | A_SUP (A > Ip) |
#define | A_NOT_INF (A >= Im) |
#define | A_NOT_SUP (A <= Ip) |
#define | B0_INF (B0 < Im) |
#define | B0_SUP (B0 > Ip) |
#define | B0_NOT_INF (B0 >= Im) |
#define | B0_NOT_SUP (B0 <= Ip) |
#define | B1_INF (B1 < Im) |
#define | B1_SUP (B1 > Ip) |
#define | B1_NOT_INF (B1 >= Im) |
#define | B1_NOT_SUP (B1 <= Ip) |
#define | B2_INF (B2 < Im) |
#define | B2_SUP (B2 > Ip) |
#define | B2_NOT_INF (B2 >= Im) |
#define | B2_NOT_SUP (B2 <= Ip) |
#define | GET_A() A = I[x+dirs[a]] |
#define | GET_B0() B0 = I[x+dirs[b]] |
#define | GET_B1() b++; B1 = I[x+dirs[b]] |
#define | GET_B2() b++; B2 = I[x+dirs[b]] |
#define | GOTO_STATE(s) { score -= A + B1; state = (s); break; } |
#define | GOTO_END_NOT_AN_INTEREST_POINT { /*stats_iter[a]++;*/ Scores[x] = 0; return; } |
#define | PUT_B2_IN_B1_AND_GET_B2() B1 = B2; GET_B2() |
#define | B1_NOT_INF_B2_NOT_INF 0 |
#define | B1_NOT_SUP_B2_NOT_SUP 1 |
#define | B1_INF_B2_INF 2 |
#define | B1_SUP_B2_SUP 3 |
#define | B1_INF_B2_NOT_SUP 4 |
#define | B1_SUP_B2_NOT_INF 5 |
#define | B1_SUP_B2_INF 6 |
#define | B1_INF_B2_SUP 7 |
#define | B1_EQUAL_B2_NOT_SUP 8 |
#define | B1_EQUAL_B2_NOT_INF 9 |
#define | Dx 1 |
#define | Dy next_line |
#define | W (-Dx) |
#define | E (+Dx) |
#define | N (-Dy) |
#define | S (+Dy) |
#define | MINIMAL_SCORE (0 / radius) |
Functions | |
bool | operator< (const keypoint &p1, const keypoint &p2) |
static unsigned | mymin (unsigned a, unsigned b) |
static bool | is_local_maxima (const short *p, int neighborhood, const IplImage *scores) |
static float | fit_quadratic_2x2 (float x[2], float L[3][3]) |
Variables | |
const unsigned int | yape_bin_size = 1000 |
const int | yape_tmp_points_array_size = 10000 |
#define A_INF (A < Im) |
#define A_NOT_INF (A >= Im) |
#define A_NOT_SUP (A <= Ip) |
#define A_SUP (A > Ip) |
#define B0_INF (B0 < Im) |
#define B0_NOT_INF (B0 >= Im) |
#define B0_NOT_SUP (B0 <= Ip) |
#define B0_SUP (B0 > Ip) |
#define B1_EQUAL_B2_NOT_INF 9 |
#define B1_EQUAL_B2_NOT_SUP 8 |
#define B1_INF (B1 < Im) |
#define B1_INF_B2_INF 2 |
#define B1_INF_B2_NOT_SUP 4 |
#define B1_INF_B2_SUP 7 |
#define B1_NOT_INF (B1 >= Im) |
#define B1_NOT_INF_B2_NOT_INF 0 |
#define B1_NOT_SUP (B1 <= Ip) |
#define B1_NOT_SUP_B2_NOT_SUP 1 |
#define B1_SUP (B1 > Ip) |
#define B1_SUP_B2_INF 6 |
#define B1_SUP_B2_NOT_INF 5 |
#define B1_SUP_B2_SUP 3 |
#define B2_INF (B2 < Im) |
#define B2_NOT_INF (B2 >= Im) |
#define B2_NOT_SUP (B2 <= Ip) |
#define B2_SUP (B2 > Ip) |
#define E (+Dx) |
#define GET_A | ( | ) | A = I[x+dirs[a]] |
#define GET_B0 | ( | ) | B0 = I[x+dirs[b]] |
#define GET_B1 | ( | ) | b++; B1 = I[x+dirs[b]] |
#define GET_B2 | ( | ) | b++; B2 = I[x+dirs[b]] |
#define GOTO_END_NOT_AN_INTEREST_POINT { /*stats_iter[a]++;*/ Scores[x] = 0; return; } |
#define GOTO_STATE | ( | s | ) | { score -= A + B1; state = (s); break; } |
#define N (-Dy) |
Definition at line 602 of file yape.cpp.
Referenced by pre_allocated_alloc< T, N >::allocate(), pre_allocated_alloc< T, N >::max_size(), yape::pick_best_points(), and yape::third_check().
#define PUT_B2_IN_B1_AND_GET_B2 | ( | ) | B1 = B2; GET_B2() |
#define S (+Dy) |
#define W (-Dx) |
Definition at line 600 of file yape.cpp.
Referenced by patch_tagger::compute_sift_descriptor(), and yape::third_check().
static float fit_quadratic_2x2 | ( | float | x[2], | |
float | L[3][3] | |||
) | [static] |
static bool is_local_maxima | ( | const short * | p, | |
int | neighborhood, | |||
const IplImage * | scores | |||
) | [inline, static] |
static unsigned mymin | ( | unsigned | a, | |
unsigned | b | |||
) | [static] |
const unsigned int yape_bin_size = 1000 |
Definition at line 38 of file yape.cpp.
Referenced by yape::get_local_maxima(), and yape::reserve_tmp_arrays().
const int yape_tmp_points_array_size = 10000 |