#include <greedy.hh>
Collaboration diagram for oln::snakes::greedy< N, I, external_energy >:
Public Types | |
typedef I | image_type |
typedef I::point_type | point_type |
typedef mlc::array2d< mlc::array2d_info< N, N >, ntg::float_s > | store_type |
Public Member Functions | |
greedy (ntg::float_s alpha, ntg::float_s beta, ntg::float_s gamma, ntg::float_s khi) | |
int | update_snake (const I &gradient, snake< greedy > &s) |
Asynchronous update for more efficient convergence. | |
void | converge (const I &gradient, snake< greedy > &s) |
N | is the size of the neighborhood. |
Definition at line 47 of file greedy.hh.
int oln::snakes::greedy< N, I, external_energy >::update_snake | ( | const I & | gradient, | |
snake< greedy< N, I, external_energy > > & | s | |||
) | [inline] |
Asynchronous update for more efficient convergence.
This place is left void to make room for a future extension where a snake will be able to hold several segments.
Definition at line 53 of file greedy.hxx.
00054 { 00057 average_dist = compute_average_dist(s.s); 00058 return update_segment(gradient, s.s); 00059 }