$extrastylesheet
Functions | |
template<typename I , typename N > | |
p_set< typename I::psite > | attachment (const Image< I > &ima, const typename I::psite &f, const Neighborhood< N > &nbh) |
mln::box1d | box1d (unsigned ninds) |
mln::box1d | box1d (def::coord min_ind, def::coord max_ind) |
mln::box2d | box2d (unsigned nrows, unsigned ncols) |
mln::box2d | box2d (def::coord min_row, def::coord min_col, def::coord max_row, def::coord max_col) |
mln::box2d_h | box2d_h (unsigned nrows, unsigned ncols) |
mln::box2d_h | box2d_h (def::coord min_row, def::coord min_col, def::coord max_row, def::coord max_col) |
mln::box3d | box3d (unsigned nslis, unsigned nrows, unsigned ncols) |
mln::box3d | box3d (def::coord min_sli, def::coord min_row, def::coord min_col, def::coord max_sli, def::coord max_row, def::coord max_col) |
template<unsigned D, typename G > | |
p_set< complex_psite< D, G > > | cell (const complex_psite< D, G > &f) |
template<typename T , typename U > | |
util::couple< T, U > | couple (const T &val1, const T &val2) |
template<typename I , typename N > | |
p_set< typename I::psite > | detachment (const Image< I > &ima, const typename I::psite &f, const Neighborhood< N > &nbh) |
template<typename F , unsigned St, unsigned Sf> | |
neighb< win::multiple < window2d, F > > | double_neighb2d (const F &test, bool const (&when_true)[St], bool const (&when_false)[Sf]) |
mln::dpoint2d_h | dpoint2d_h (def::coord row, def::coord col) |
template<typename I , typename N > | |
neighb< win::multiple_size < 2, mln_window(N), pw::value_ < I > > > | dual_neighb (const Image< I > &ima, const Neighborhood< N > &nbh_true, const Neighborhood< N > &nbh_false) |
template<typename G , typename P > | |
p_edges< G, pw::cst_< P > > | dummy_p_edges (const Graph< G > &g_, const P &dummy_site) |
template<typename G > | |
p_edges< G > | dummy_p_edges (const Graph< G > &g) |
template<typename G , typename P > | |
p_vertices< G, pw::cst_< P > > | dummy_p_vertices (const Graph< G > &g_, const P &dummy_site) |
template<typename G > | |
p_vertices< G > | dummy_p_vertices (const Graph< G > &g) |
template<typename V , typename G > | |
mln::edge_image< void, V, G > | edge_image (const Graph< G > &g, const fun::i2v::array< V > &fv) |
template<typename FV , typename G > | |
mln::edge_image< void, typename FV::result, G > | edge_image (const Graph< G > &g, const Function_v2v< FV > &fv) |
template<typename FP , typename FV , typename G > | |
mln::edge_image< typename FP::result, typename FV::result, G > | edge_image (const Graph< G > &g_, const Function_v2v< FP > &fp, const Function_v2v< FV > &fv) |
template<typename P , typename V , typename G , typename FP , typename FV > | |
mln::edge_image< typename FP::result, typename FV::result, G > | edge_image (const mln::vertex_image< P, V, G > &v_ima_, const p_edges< G, FP > pe, const Function_vv2v< FV > &fv_) |
template<typename P , typename V , typename G , typename FV > | |
mln::edge_image< void, typename FV::result, G > | edge_image (const mln::vertex_image< P, V, G > &v_ima_, const Function_vv2v< FV > &fv_) |
template<typename P , typename V , typename G , typename F > | |
mln::edge_image< void, bool, G > | edge_image (const mln::vertex_image< P, V, G > &v_ima_, const Function_v2b< F > &fv_) |
template<typename T , unsigned N> | |
algebra::h_mat< mlc_sqrt_int(N), T > | h_mat (const T(&tab)[N]) |
template<typename C > | |
algebra::h_mat< 3, C > | h_mat (const C &v, const algebra::quat &q) |
template<typename V , unsigned L> | |
mln::image1d< V > | image (V(&values)[L]) |
template<typename V , unsigned R, unsigned C> | |
mln::image2d< V > | image (V(&values)[R][C]) |
template<typename V , unsigned S, unsigned R, unsigned C> | |
mln::image3d< V > | image (V(&values)[S][R][C]) |
template<typename V , unsigned S> | |
mln::image2d< V > | image2d (V(&values)[S]) |
template<typename I > | |
mln::image3d< typename I::value > | image3d (const util::array< I > &ima) |
template<typename I > | |
mln::image3d< typename I::value > | image3d (const Image< I > &ima) |
template<typename I , typename N > | |
util::graph | influence_zone_adjacency_graph (const Image< I > &iz, const Neighborhood< N > &nbh, const typename I::value &nlabels) |
template<typename I > | |
mln::labeled_image< I > | labeled_image (const Image< I > &ima, const typename I::value &nlabels) |
template<unsigned n, unsigned m, typename T > | |
algebra::mat< n, m, T > | mat (const T(&tab)[n *m]) |
mln::w_window2d_float | mk_chamfer_3x3_float (float d10, float d11) |
template<int d10, int d11> | |
mln::w_window2d_int | mk_chamfer_3x3_int () |
mln::w_window2d_float | mk_chamfer_5x5_float (float d10, float d11, float d21) |
template<int d10, int d11, int d21> | |
mln::w_window2d_int | mk_chamfer_5x5_int () |
mln::w_window2d_float | mk_chamfer_exact () |
template<unsigned S> | |
mln::neighb2d | neighb2d (bool const (&vals)[S]) |
template<typename T > | |
util::ord_pair< T > | ord_pair (const T &val1, const T &val2) |
template<typename W , typename G > | |
p_edges< G, fun::i2v::array < util::site_pair< typename W::site > > > | p_edges_with_mass_centers (const Image< W > &wst_, const Graph< G > &g_) |
template<typename W , typename G > | |
p_vertices< G, fun::i2v::array < typename W::site > > | p_vertices_with_mass_centers (const Image< W > &wst_, const Graph< G > &g_) |
template<typename I > | |
mln::util::pix< I > | pix (const Image< I > &ima, const typename I::psite &p) |
template<typename I > | |
mln::pixel< const I > | pixel (const Image< I > &ima, const typename I::psite &p) |
template<typename I > | |
mln::pixel< I > | pixel (Image< I > &ima, const typename I::psite &p) |
mln::point2d_h | point2d_h (def::coord row, def::coord col) |
template<typename C > | |
mln::algebra::quat | quat (double angle, const mln::algebra::vec< 3, C > &axis) |
template<typename I , typename N > | |
util::couple< util::graph, typename mln::trait::concrete < I >::ret > | rag_and_labeled_wsl (const Image< I > &wshd_, const Neighborhood< N > &nbh_, const typename I::value &nbasins) |
template<typename I , typename N > | |
util::graph | region_adjacency_graph (const Image< I > &wshd_, const Neighborhood< N > &nbh, const typename I::value &nbasins) |
template<typename V , typename F > | |
fun::i2v::array< V > | relabelfun (const Function_v2b< F > &fv2b, const V &nlabels, V &new_nlabels) |
template<typename V , typename F > | |
fun::i2v::array< V > | relabelfun (const Function_v2v< F > &fv2v, const V &nlabels, V &new_nlabels) |
template<typename T > | |
algebra::vec< 1, T > | vec (const T &v_0) |
template<typename T > | |
algebra::vec< 2, T > | vec (const T &v_0, const T &v_1) |
template<typename T > | |
algebra::vec< 3, T > | vec (const T &v_0, const T &v_1, const T &v_2) |
template<typename T > | |
algebra::vec< 4, T > | vec (const T &v_0, const T &v_1, const T &v_2, const T &v_3) |
template<typename G , typename FV > | |
mln::vertex_image< void, typename FV::result, G > | vertex_image (const Graph< G > &g, const Function_v2v< FV > &fv) |
template<typename FP , typename FV , typename G > | |
mln::vertex_image< typename FP::result, typename FV::result, G > | vertex_image (const Graph< G > &g_, const Function_v2v< FP > &fp, const Function_v2v< FV > &fv) |
template<typename I , typename N > | |
p_vertices< util::graph, fun::i2v::array< typename I::site > > | voronoi (Image< I > &ima_, Image< I > &orig_, const Neighborhood< N > &nbh) |
template<typename W , typename F > | |
mln::w_window< typename W::dpsite, typename F::result > | w_window (const Window< W > &win, const Function_v2v< F > &wei) |
template<typename W , unsigned M> | |
mln::w_window< mln::dpoint1d, W > | w_window1d (W(&weights)[M]) |
template<unsigned M> | |
mln::w_window1d_int | w_window1d_int (int(&weights)[M]) |
template<typename W , unsigned S> | |
mln::w_window< mln::dpoint2d, W > | w_window2d (W(&weights)[S]) |
template<unsigned M> | |
mln::w_window2d_int | w_window2d_int (int(&weights)[M]) |
template<typename W , unsigned M> | |
mln::w_window< mln::dpoint3d, W > | w_window3d (W(&weights)[M]) |
template<unsigned M> | |
mln::w_window3d_int | w_window3d_int (int(&weights)[M]) |
template<typename D , typename W , unsigned L> | |
mln::w_window< D, W > | w_window_directional (const Gdpoint< D > &dp, W(&weights)[L]) |
Variables | |
neighb< win::multiple < window2d, bool(*)(A)> > | double_neighb2d (bool(*test)(A), bool const (&when_true)[St], bool const (&when_false)[Sf]) |
Namespace of routines that help to make Milena's objects.
p_set<typename I ::psite> mln::make::attachment | ( | const Image< I > & | ima, |
const typename I::psite & | f, | ||
const Neighborhood< N > & | nbh | ||
) |
Compute the attachment of the cell corresponding to the face f to the image ima.
ima | The input image to which the face is attached. |
f | The psite corresponding to the attached face. |
nbh | An adjacency relationship between faces (should return the set of (n-1)- and (n+1)-faces adjacent to an n-face). |
We do not use the fomal definition of the attachment here (see couprie.08.pami). We use the following (equivalent) definition: an N-face F in CELL is in the attachment of CELL to IMA if it is adjacent to at least an (N-1)-face or an (N+1)-face that does not belong to CELL.
mln::box1d mln::make::box1d | ( | unsigned | ninds | ) |
Create an mln::box1d.
[in] | ninds | Number of indices. |
ninds
!= 0 and ncols
!= 0.mln::box1d mln::make::box1d | ( | def::coord | min_ind, |
def::coord | max_ind | ||
) |
Create an mln::box1d.
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
[in] | min_ind | Minimum index. |
[in] | max_ind | Maximum index. |
max_ind
>= min_ind
.mln::box2d mln::make::box2d | ( | unsigned | nrows, |
unsigned | ncols | ||
) |
Create an mln::box2d.
[in] | nrows | Number of rows. |
[in] | ncols | Number of columns. |
nrows
!= 0 and ncols
!= 0.mln::box2d mln::make::box2d | ( | def::coord | min_row, |
def::coord | min_col, | ||
def::coord | max_row, | ||
def::coord | max_col | ||
) |
Create an mln::box2d.
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
[in] | min_row | Index of the top most row. |
[in] | min_col | Index of the left most column. |
[in] | max_row | Index of the botton most row. |
[in] | max_col | Index of the right most column. |
max_row
>= min_row
and max_col
>= min_col
.mln::box2d_h mln::make::box2d_h | ( | unsigned | nrows, |
unsigned | ncols | ||
) |
Create an mln::box2d_h.
[in] | nrows | Number of rows. |
[in] | ncols | Number of columns. |
nrows
!= 0 and ncols
!= 0.mln::box2d_h mln::make::box2d_h | ( | def::coord | min_row, |
def::coord | min_col, | ||
def::coord | max_row, | ||
def::coord | max_col | ||
) |
Create an mln::box2d_h.
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
[in] | min_row | Index of the top most row. |
[in] | min_col | Index of the left most column. |
[in] | max_row | Index of the botton most row. |
[in] | max_col | Index of the right most column. |
max_row
>= min_row
and max_col
>= min_col
.mln::box3d mln::make::box3d | ( | unsigned | nslis, |
unsigned | nrows, | ||
unsigned | ncols | ||
) |
Create an mln::box3d.
[in] | nslis | Number of slices. |
[in] | nrows | Number of rows. |
[in] | ncols | Number of columns. |
ninds
!= 0 and ncols
!= 0 and nslis
!= 0.mln::box3d mln::make::box3d | ( | def::coord | min_sli, |
def::coord | min_row, | ||
def::coord | min_col, | ||
def::coord | max_sli, | ||
def::coord | max_row, | ||
def::coord | max_col | ||
) |
Create an mln::box3d.
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
[in] | min_sli | Index of the lowest slice. |
[in] | min_row | Index of the top most row. |
[in] | min_col | Index of the left most column. |
[in] | max_sli | Index of the highest slice. |
[in] | max_row | Index of the botton most row. |
[in] | max_col | Index of the right most column. |
max_sli
>= min_sli
. max_row
>= min_row
. max_col
>= min_col
.p_set< complex_psite<D, G> > mln::make::cell | ( | const complex_psite< D, G > & | f | ) |
Compute the set of faces of the cell corresponding to the face f.
util::couple<T,U> mln::make::couple | ( | const T & | val1, |
const T & | val2 | ||
) |
Construct an mln::util::couple on-the-fly.
p_set<typename I ::psite> mln::make::detachment | ( | const Image< I > & | ima, |
const typename I::psite & | f, | ||
const Neighborhood< N > & | nbh | ||
) |
Compute the detachment of the cell corresponding to the face f from the image ima.
ima | The input image from which the face is to be detached. |
f | The psite corresponding to the face to detach. |
nbh | An adjacency relationship between faces (should return the set of (n-1)- and (n+1)-faces adjacent to an n-face). |
We do not use the fomal definition of the detachment here (see couprie.08.pami). We use the following (equivalent) definition: an N-face F in CELL is not in the detachment of CELL from IMA if it is adjacent to at least an (N-1)-face or an (N+1)-face that does not belong to CELL.
Moreover, the term detachment does not correspond to the complex resulting from the collapsing of CELL onto IMA, but the part that is removed, i.e., the detached part CELL - ATTACHMENT. It would be wise to rename this routine to something else, e.g., `detached'.
neighb< win::multiple<window2d, F> > mln::make::double_neighb2d | ( | const F & | test, |
bool const (&) | when_true[St], | ||
bool const (&) | when_false[Sf] | ||
) |
mln::dpoint2d_h mln::make::dpoint2d_h | ( | def::coord | row, |
def::coord | col | ||
) |
Create an mln::dpoint2d_h.
[in] | row | Row coordinate. |
[in] | col | Column coordinate. |
neighb< win::multiple_size< 2, mln_window(N), pw::value_<I> > > mln::make::dual_neighb | ( | const Image< I > & | ima, |
const Neighborhood< N > & | nbh_true, | ||
const Neighborhood< N > & | nbh_false | ||
) |
p_edges< G, pw::cst_<P> > mln::make::dummy_p_edges | ( | const Graph< G > & | g_, |
const P & | dummy_site | ||
) |
p_edges<G> mln::make::dummy_p_edges | ( | const Graph< G > & | g | ) |
p_vertices< G, pw::cst_<P> > mln::make::dummy_p_vertices | ( | const Graph< G > & | g_, |
const P & | dummy_site | ||
) |
Create a p_vertices which associate a graph element to a constant site.
[in] | g_ | A graph. |
[in] | dummy_site | The dummy site mapped to graph vertices. |
p_vertices<G> mln::make::dummy_p_vertices | ( | const Graph< G > & | g | ) |
Create a p_vertices which associate a graph element to a constant site.
0
(int) is used as dummy site.
[in] | g | A graph. |
mln::edge_image<void,V,G> mln::make::edge_image | ( | const Graph< G > & | g, |
const fun::i2v::array< V > & | fv | ||
) |
Construct an edge image.
[in] | g | A graph. |
[in] | fv | A function mapping edge ids to values. |
mln::edge_image<void, typename FV ::result, G> mln::make::edge_image | ( | const Graph< G > & | g, |
const Function_v2v< FV > & | fv | ||
) |
Construct an edge image.
[in] | g | A graph. |
[in] | fv | A function mapping edge ids to values. |
mln::edge_image<typename FP ::result,typename FV ::result,G> mln::make::edge_image | ( | const Graph< G > & | g_, |
const Function_v2v< FP > & | fp, | ||
const Function_v2v< FV > & | fv | ||
) |
Construct an edge image.
[in] | g_ | A graph. |
[in] | fp | A function mapping edge ids to sites. |
[in] | fv | A function mapping edge ids to values. |
mln::edge_image<typename FP ::result,typename FV ::result,G> mln::make::edge_image | ( | const mln::vertex_image< P, V, G > & | v_ima_, |
const p_edges< G, FP > | pe, | ||
const Function_vv2v< FV > & | fv_ | ||
) |
Construct an edge image.
[in] | v_ima_ | A vertex image. |
[in] | pe | A p_edges mapping graph elements to sites. |
[in] | fv_ | A function mapping two vertex ids to a value. The result is associated to the corresponding edge. |
mln::edge_image<void,typename FV ::result,G> mln::make::edge_image | ( | const mln::vertex_image< P, V, G > & | v_ima_, |
const Function_vv2v< FV > & | fv_ | ||
) |
Construct an edge image.
[in] | v_ima_ | A vertex image. |
[in] | fv_ | A function mapping two vertices' values to a value. The result is associated to the corresponding edge. |
mln::edge_image<void,bool,G> mln::make::edge_image | ( | const mln::vertex_image< P, V, G > & | v_ima_, |
const Function_v2b< F > & | fv_ | ||
) |
Construct an edge image.
[in] | v_ima_ | A vertex image. |
[in] | fv_ | A predicate on a vertex's value. The (Boolean) result is associated to the edges adjacent to the vertex. |
algebra::h_mat<mlc_sqrt_int(N), T> mln::make::h_mat | ( | const T(&) | tab[N] | ) |
Create an mln::algebra::h_mat<n,T>.
algebra::h_mat<3, C> mln::make::h_mat | ( | const C & | v, |
const algebra::quat & | q | ||
) |
Create a rotation matrix as mln::algebra::h_mat<n,T>.
[in] | q | A quaternion. |
q
. mln::image1d<V> mln::make::image | ( | V(&) | values[L] | ) |
mln::image2d<V> mln::make::image | ( | V(&) | values[R][C] | ) |
mln::image3d<V> mln::make::image | ( | V(&) | values[S][R][C] | ) |
mln::image2d<V> mln::make::image2d | ( | V(&) | values[S] | ) |
mln::image3d<typename I ::value> mln::make::image3d | ( | const util::array< I > & | ima | ) |
Create an image3d from an array of 2D images.
mln::image3d<typename I ::value> mln::make::image3d | ( | const Image< I > & | ima | ) |
Create an image3d from a 2D image.
util::graph mln::make::influence_zone_adjacency_graph | ( | const Image< I > & | iz, |
const Neighborhood< N > & | nbh, | ||
const typename I::value & | nlabels | ||
) |
Create a graph from an influence zone image.
[in] | iz | influence zone image. |
[in] | nbh | A neighborhood. |
[in] | nlabels | number of influence zone in iz . |
mln::labeled_image<I> mln::make::labeled_image | ( | const Image< I > & | ima, |
const typename I::value & | nlabels | ||
) |
algebra::mat<n,m,T> mln::make::mat | ( | const T(&) | tab[n *m] | ) |
Create an mln::algebra::mat<n,m,T>.
[in] | tab | Array of values. |
mln::w_window2d_float mln::make::mk_chamfer_3x3_float | ( | float | d10, |
float | d11 | ||
) |
mln::w_window2d_int mln::make::mk_chamfer_3x3_int | ( | ) |
mln::w_window2d_float mln::make::mk_chamfer_5x5_float | ( | float | d10, |
float | d11, | ||
float | d21 | ||
) |
mln::w_window2d_int mln::make::mk_chamfer_5x5_int | ( | ) |
mln::w_window2d_float mln::make::mk_chamfer_exact | ( | ) |
mln::neighb2d mln::make::neighb2d | ( | bool const (&) | vals[S] | ) |
util::ord_pair<T> mln::make::ord_pair | ( | const T & | val1, |
const T & | val2 | ||
) |
Construct an mln::util::ord_pair on-the-fly.
|
inline |
Construct a p_edges from a watershed image and a region adjacency graph (RAG).
Map each graph edge to a pair of mass centers of two adjacent regions.
wst_ | A watershed image. |
g_ | A region adjacency graph. |
|
inline |
Construct a p_vertices from a watershed image and a region adjacency graph (RAG).
Map each graph vertex to the mass center of its corresponding region.
wst_ | A watershed image. |
g_ | A region adjacency graph. |
mln::util::pix<I> mln::make::pix | ( | const Image< I > & | ima, |
const typename I::psite & | p | ||
) |
Create an mln::util::pix from an image ima
and a psite p
.
[in] | ima | The input image. |
[in] | p | The point site. |
mln::pixel<const I> mln::make::pixel | ( | const Image< I > & | ima, |
const typename I::psite & | p | ||
) |
Create a mln::pixel from a constant image ima
and a point p
.
mln::pixel<I> mln::make::pixel | ( | Image< I > & | ima, |
const typename I::psite & | p | ||
) |
Create a mln::pixel from a mutable image ima
and a point p
.
mln::point2d_h mln::make::point2d_h | ( | def::coord | row, |
def::coord | col | ||
) |
Create an mln::point2d_h.
[in] | row | Row coordinate. |
[in] | col | Column coordinate. |
mln::algebra::quat mln::make::quat | ( | double | angle, |
const mln::algebra::vec< 3, C > & | axis | ||
) |
util::couple<util::graph,typename mln::trait::concrete< I >::ret> mln::make::rag_and_labeled_wsl | ( | const Image< I > & | wshd_, |
const Neighborhood< N > & | nbh_, | ||
const typename I::value & | nbasins | ||
) |
Create a region adjacency graph and a label image of the watershed line from a watershed image.
[in] | wshd_ | Watershed image. |
[in] | nbh_ | Neighborhood |
[in] | nbasins | Number of influence zone in wshd . |
|-----------------| |-----------------| | 1 1 1 0 2 2 0 3 | | . . . 1 . . 2 . | | 1 1 0 2 2 2 0 3 | | . . 1 . . . 2 . | | 1 0 4 0 2 0 3 3 | ----> | . 1 . 3 . 4 . . | | 0 4 4 4 0 5 0 3 | | 1 . . . 5 . 6 . | |-----------------| |-----------------| Watershed image Labeled watershed line (watershed line labeled with 0) | | | v 1 -- 2 - 3 \ / / 4 -- 5 Region Adjacency graph (RAG)
util::graph mln::make::region_adjacency_graph | ( | const Image< I > & | wshd_, |
const Neighborhood< N > & | nbh, | ||
const typename I::value & | nbasins | ||
) |
Create a region adjacency graph from a watershed image.
[in] | wshd_ | watershed image. |
[in] | nbh | A neighborhood. |
[in] | nbasins | number of influence zone in wshd . |
fun::i2v::array<V> mln::make::relabelfun | ( | const Function_v2b< F > & | fv2b, |
const V & | nlabels, | ||
V & | new_nlabels | ||
) |
Create a i2v function from a v2b function.
This function can be used to relabel a labeled image.
[in] | fv2b | A v2b function. |
[in] | nlabels | The number of labels. |
[in] | new_nlabels | The number of labels after relabeling. |
fun::i2v::array<V> mln::make::relabelfun | ( | const Function_v2v< F > & | fv2v, |
const V & | nlabels, | ||
V & | new_nlabels | ||
) |
Create a i2v function from a v2v function.
This function can be used to relabel a labeled image.
[in] | fv2v | A v2v function. This function maps an id to an already existing one. |
[in] | nlabels | The number of labels. |
[in] | new_nlabels | The number of labels after relabeling. |
algebra::vec<1, T> mln::make::vec | ( | const T & | v_0 | ) |
Create an mln::algebra::vec<n,T>.
[in] | v_0 | First coordinate. |
algebra::vec<2, T> mln::make::vec | ( | const T & | v_0, |
const T & | v_1 | ||
) |
Create an mln::algebra::vec<2,T>.
[in] | v_0 | First coordinate. |
[in] | v_1 | Second coordinate. |
algebra::vec<3, T> mln::make::vec | ( | const T & | v_0, |
const T & | v_1, | ||
const T & | v_2 | ||
) |
Create an mln::algebra::vec<3,T>.
[in] | v_0 | First coordinate. |
[in] | v_1 | Second coordinate. |
[in] | v_2 | Third coordinate. |
algebra::vec<4, T> mln::make::vec | ( | const T & | v_0, |
const T & | v_1, | ||
const T & | v_2, | ||
const T & | v_3 | ||
) |
Create an mln::algebra::vec<4,T>.
[in] | v_0 | First coordinate. |
[in] | v_1 | Second coordinate. |
[in] | v_2 | Third coordinate. |
[in] | v_3 | Fourth coordinate. |
mln::vertex_image<void,typename FV ::result,G> mln::make::vertex_image | ( | const Graph< G > & | g, |
const Function_v2v< FV > & | fv | ||
) |
Construct a vertex image.
[in] | g | A graph. |
[in] | fv | A function mapping vertex ids to values. |
mln::vertex_image<typename FP ::result,typename FV ::result,G> mln::make::vertex_image | ( | const Graph< G > & | g_, |
const Function_v2v< FP > & | fp, | ||
const Function_v2v< FV > & | fv | ||
) |
Construct a vertex image.
[in] | g_ | A graph. |
[in] | fp | A function mapping vertex ids to sites. |
[in] | fv | A function mapping vertex ids to values. |
p_vertices<util::graph, fun::i2v::array<typename I ::site> > mln::make::voronoi | ( | Image< I > & | ima_, |
Image< I > & | orig_, | ||
const Neighborhood< N > & | nbh | ||
) |
Apply the Voronoi algorithm on ima_
with the original image orig_
for node computing with neighborhood nbh
.
[in] | ima_ | The labeling image. |
[in] | orig_ | The original image. |
[in] | nbh | The neighborhood for computing algorithm. |
mln::w_window<typename W ::dpsite, typename F ::result> mln::make::w_window | ( | const Window< W > & | win, |
const Function_v2v< F > & | wei | ||
) |
Create a mln::w_window from a window and a weight function.
[in] | win | A simple window. |
[in] | wei | A weight function. |
mln::w_window<mln::dpoint1d, W> mln::make::w_window1d | ( | W(&) | weights[M] | ) |
Create a 1D mln::w_window from an array of weights.
[in] | weights | Array. |
M
, has to be a square of an odd integer.mln::w_window1d_int mln::make::w_window1d_int | ( | int(&) | weights[M] | ) |
Create a mln::w_window1d_int.
[in] | weights | Array of integers. |
M
, has to be a square of an odd integer.mln::w_window<mln::dpoint2d, W> mln::make::w_window2d | ( | W(&) | weights[S] | ) |
Create a 2D mln::w_window from an array of weights.
[in] | weights | Array. |
S
, has to be a square of an odd integer.mln::w_window2d_int mln::make::w_window2d_int | ( | int(&) | weights[M] | ) |
Create a mln::w_window2d_int.
[in] | weights | Array of integers. |
M
, has to be a square of an odd integer.mln::w_window<mln::dpoint3d, W> mln::make::w_window3d | ( | W(&) | weights[M] | ) |
Create a 3D mln::w_window from an array of weights.
[in] | weights | Array. |
M
, has to be a cube of an odd integer.mln::w_window3d_int mln::make::w_window3d_int | ( | int(&) | weights[M] | ) |
Create a mln::w_window3d_int.
[in] | weights | Array of integers. |
M
, has to be a cube of an odd integer.mln::w_window<D,W> mln::make::w_window_directional | ( | const Gdpoint< D > & | dp, |
W(&) | weights[L] | ||
) |
Create a directional centered weighted window.
[in] | dp | A delta-point to set the orientation. |
[in] | weights | An array of weights. |
The window length L
has to be odd.
neighb< win::multiple<window2d, bool(*)(A)> > mln::make::double_neighb2d(bool(*test)(A), bool const (&when_true)[St], bool const (&when_false)[Sf]) |
Definition at line 49 of file double_neighb2d.hh.