This file contains templated, vil1 versions code provided by brip_float_ops. More...
#include <vcl_cmath.h>
#include <vcl_cassert.h>
#include <vil/vil_image_view.h>
#include <vil/vil_math.h>
#include <vil/vil_fill.h>
#include <vil/vil_transpose.h>
#include <vil/algo/vil_sobel_3x3.h>
#include <vil/algo/vil_convolve_1d.h>
Go to the source code of this file.
Functions | |
template<class T > | |
void | brip_sqrt_grad_singular_values (const vil_image_view< T > &input, vil_image_view< T > &output, unsigned n) |
computes the conditioning of the 2n+1 x 2n+1 gradient neighborhood. | |
template<class srcT , class destT > | |
void | brip_gauss_filter (const vil_image_view< srcT > &src_im, vil_image_view< destT > &dest_im, double sigma, unsigned int k_size, vil_convolve_boundary_option option) |
Filter an image with a gaussian kernel. |
This file contains templated, vil1 versions code provided by brip_float_ops.
This file contains several useful image operations originally defined in brip_float_ops for vil1 floating point images. Some of the original operations are covered in the new vil library, these are use when possible and not duplicated here.
Modifications
Definition in file brip_vil_ops.h.
void brip_gauss_filter | ( | const vil_image_view< srcT > & | src_im, |
vil_image_view< destT > & | dest_im, | ||
double | sigma, | ||
unsigned int | k_size, | ||
vil_convolve_boundary_option | option | ||
) | [inline] |
Filter an image with a gaussian kernel.
This is an ntap alternative to vil_gauss_filter_5tap The kernel is generated using vcl_exp instead of vnl_erf
sigma | The width of the gaussian |
k_size | The number of elements in the 1D filter |
option | The boundary option applied at all boundaries (see vil_convolve_1d) |
Definition at line 81 of file brip_vil_ops.h.
void brip_sqrt_grad_singular_values | ( | const vil_image_view< T > & | input, |
vil_image_view< T > & | output, | ||
unsigned | n | ||
) | [inline] |
computes the conditioning of the 2n+1 x 2n+1 gradient neighborhood.
Definition at line 30 of file brip_vil_ops.h.