#include <gandalf/common/bit_array.h>
#include <gandalf/linalg/mat_gen.h>
Go to the source code of this file.
Functions | |
Gan_Bool | gan_fast_hough_transform (int k, Gan_Matrix *a, int *weight, int no_points, double *S0, double *X0, int max_level, int T_thres, Gan_MemoryStack *memory_stack, double *X_best, int *level_best, int *accum_best, Gan_BitArray *list_best, int *subdivs) |
General purpose Fast Hough Transform (FHT) function. |
Part of: Gandalf Library
Revision: Last edited: Author:
Copyright: (c) 2000 Imagineer Software Limited
|
General purpose Fast Hough Transform (FHT) function.
![]() (not normalised) where X[i] are the parameters and k is the dimensionality of parameter space. The starting parameter half-ranges are given by the S0 vector, and the parameter origin by the X0 vector. S0 and X0 thus define the root hypercube: ![]() This is a depth-first version of the FHT, i.e. the child hypercubes are subdivided exhaustively before trying another child. This minimises memory requirement by limiting it to ![]()
a contains feature space (k+1)-vectors arranged as a no_points by k+1 matrix. |