Function to find 4-connected boundary around thresholded region. More...
Go to the source code of this file.
Functions | |
| template<class T > | |
| void | vil_next_point_below_thresh4 (int &i, int &j, int &dir, const T *&p, int ni1, int nj1, std::ptrdiff_t istep, std::ptrdiff_t jstep, T threshold) |
| Move (i,j) to next point below threshold. More... | |
| template<class T > | |
| void | vil_next_point_above_thresh4 (int &i, int &j, int &dir, const T *&p, int ni1, int nj1, std::ptrdiff_t istep, std::ptrdiff_t jstep, T threshold) |
| Move (i,j) to next point above threshold. More... | |
| template<class T > | |
| void | vil_find_4con_boundary_below_threshold (std::vector< int > &bi, std::vector< int > &bj, const vil_image_view< T > &image, const T &threshold, int p0_i, int p0_j) |
| Find 4-connected boundary around thresholded region containing point. More... | |
| template<class T > | |
| void | vil_find_4con_boundary_above_threshold (std::vector< int > &bi, std::vector< int > &bj, const vil_image_view< T > &image, const T &threshold, int p0_i, int p0_j) |
| Find 4-connected boundary around thresholded region containing point. More... | |
Function to find 4-connected boundary around thresholded region.
Definition in file vil_find_4con_boundary.h.
|
inline |
Find 4-connected boundary around thresholded region containing point.
Assumes that (p0_i,p0_j) is a point in the image which satisfies the threshold (ie image(p0_i,p0_j)>=threshold). Searches for the boundary pixels (ie points which satisfy threshold next to ones which don't) and runs around until it gets back to beginning. On exit the boundary points are given by (bi[k],bj[k])
Definition at line 122 of file vil_find_4con_boundary.h.
|
inline |
Find 4-connected boundary around thresholded region containing point.
Assumes that (p0_i,p0_j) is a point in the image which satisfies the threshold (ie image(p0_i,p0_j)<=threshold). Searches for the boundary pixels (ie points which satisfy threshold next to ones which don't) and runs around until it gets back to beginning. On exit the boundary points are given by (bi[k],bj[k])
Definition at line 79 of file vil_find_4con_boundary.h.
|
inline |
Move (i,j) to next point above threshold.
Start looking in direction dir (0=++x,1=++y,2=–x,3=–y) *p is current point (i,j). On exit (i,j) and p are updated to move to neighbour
Definition at line 49 of file vil_find_4con_boundary.h.
|
inline |
Move (i,j) to next point below threshold.
Start looking in direction dir (0=++x,1=++y,2=–x,3=–y) *p is current point (i,j). On exit (i,j) and p are updated to move to neighbour
Definition at line 21 of file vil_find_4con_boundary.h.
1.8.15