Tesi Robotica Algoritmi ed architetture per la risoluzione di... | Page 85
85
Implementazione Agast in C
4
9
//machine generated code
//probability of an equal pixel on the Bresenham’s circle: 0.33 and 0.1
//number of equal pixels to switch: 1
//number of unequal pixels to switch: 6
//memory costs: cache=0.2
//
same line=1
//
memory=4
#include
#include
#include "agast5_8_init.h"
#include "agast5_8.h"
14
19
24
29
34
39
static const struct {
unsigned int width;
unsigned int height;
unsigned int bytes_per_pixel; /* 2:RGB16, 3:RGB, 4:RGBA */
unsigned char pixel_data[128 * 128 * 4 + 1];
} gimp_image1 = {
128, 128, 4,
//Codice dellimmagine non inserita
};
static const struct {
unsigned int width;
unsigned int height;
unsigned int bytes_per_pixel; /* 2:RGB16, 3:RGB, 4:RGBA */
unsigned char pixel_data[128 * 128 * 4 + 1];
} gimp_image2 = {
128, 128, 4,
//Codice dellimmagine non inserita
};
static const struct {
unsigned int width;
unsigned int height;
unsigned int bytes_per_pixel; /* 2:RGB16, 3:RGB, 4:RGBA */
unsigned char pixel_data[128 * 128 * 4 + 1];