Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members | Related Pages | Search for 

oln::snakes::greedy< N, I, external_energy > Class Template Reference

#include <greedy.hh>

Collaboration diagram for oln::snakes::greedy< N, I, external_energy >:

Collaboration graph
[legend]
List of all members.

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)

Detailed Description

template<int N, class I, template< typename > class external_energy = dummy_energy>
class oln::snakes::greedy< N, I, external_energy >

This class can be use as the algorithm of snake.

Parameters:
N is the size of the neighborhood.
Precondition:
N must be odd.
See also:
snake

Definition at line 47 of file greedy.hh.

Member Function Documentation

template<int N, class I, template< typename > class external_energy>
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     }

The documentation for this class was generated from the following files:
Generated on Thu Apr 15 20:17:04 2004 for Olena by doxygen 1.3.6-20040222