Olena-patches

olena-patches@lrde.epita.fr

9625 discussions

branch file-gen created: olena-2.0-51-ge8b7ee8

by git＠lrde.epita.fr

This is an automated email from the git hooks/post-receive script. It was generated because a ref change was pushed to the repository containing the project "Olena, a generic and efficient image processing platform". The branch file-gen has been created at e8b7ee8c1524bdf22fd6d12c67f3da68d44d9d78 (commit) - Log ----------------------------------------------------------------- e8b7ee8 Add a script to generate a Milena header file. ----------------------------------------------------------------------- hooks/post-receive -- Olena, a generic and efficient image processing platform

12 years, 3 months

branch exp/khalimsky updated: olena-2.0-31-g25a6947

by git＠lrde.epita.fr

This is an automated email from the git hooks/post-receive script. It was generated because a ref change was pushed to the repository containing the project "Olena, a generic and efficient image processing platform". The branch exp/khalimsky has been updated via 25a6947e13ca488b5f1b0601f2333d113c85d2d7 (commit) via 91b3fcb92cb20730dc0c3b29a6e8ea1462eec7f7 (commit) from d0d18bf100fa99b288d55dd025055c1c79ada3cc (commit) Those revisions listed above that are new to this repository have not appeared on any other notification email; so we list those revisions in full, below. - Log ----------------------------------------------------------------- 25a6947 New value types. 91b3fcb New routine for filling internal border in K1. ----------------------------------------------------------------------- Summary of changes: milena/ChangeLog | 22 + milena/mln/value/next.hh | 20 +- milena/mln/value/range.hh | 425 ++++++++++++++++++++ milena/mln/value/unsignedh.hh | 415 +++++++++++++++++++ ..._faces.hh => fill_0_1_faces_internal_border.hh} | 79 ++-- milena/tests/value/Makefile.am | 16 +- .../tests/{world/k1/immerse.cc => value/range.cc} | 52 ++- .../tests/{fun/i2v/array.cc => value/unsignedh.cc} | 22 +- milena/tests/world/k1/Makefile.am | 2 + ...mmerse.cc => fill_0_1_faces_internal_border.cc} | 29 +- 10 files changed, 993 insertions(+), 89 deletions(-) create mode 100644 milena/mln/value/range.hh create mode 100644 milena/mln/value/unsignedh.hh copy milena/mln/world/k1/{fill_0_from_primary_faces.hh => fill_0_1_faces_internal_border.hh} (53%) copy milena/tests/{world/k1/immerse.cc => value/range.cc} (61%) copy milena/tests/{fun/i2v/array.cc => value/unsignedh.cc} (80%) copy milena/tests/world/k1/{un_immerse.cc => fill_0_1_faces_internal_border.cc} (76%) hooks/post-receive -- Olena, a generic and efficient image processing platform

12 years, 3 months

olena-2.0-31-g25a6947 New value types.

by Guillaume Lazzara

* mln/value/next.hh: Add support for unsignedh. * mln/value/range.hh, * mln/value/unsignedh.hh, * tests/value/range.cc, * tests/value/unsignedh.cc: New. * tests/value/Makefile.am: Add targets. --- milena/ChangeLog | 13 + milena/mln/value/next.hh | 20 +- milena/mln/value/range.hh | 425 ++++++++++++++++++++ milena/mln/value/unsignedh.hh | 415 +++++++++++++++++++ milena/tests/value/Makefile.am | 16 +- .../range.cc} | 62 ++-- .../tests/{fun/i2v/array.cc => value/unsignedh.cc} | 22 +- 7 files changed, 930 insertions(+), 43 deletions(-) create mode 100644 milena/mln/value/range.hh create mode 100644 milena/mln/value/unsignedh.hh copy milena/tests/{world/k1/fill_0_1_faces_internal_border.cc => value/range.cc} (61%) copy milena/tests/{fun/i2v/array.cc => value/unsignedh.cc} (80%) diff --git a/milena/ChangeLog b/milena/ChangeLog index 525ab23..4ff88af 100644 --- a/milena/ChangeLog +++ b/milena/ChangeLog @@ -1,5 +1,18 @@ 2012-09-28 Guillaume Lazzara <z(a)lrde.epita.fr> + New value types. + + * mln/value/next.hh: Add support for unsignedh. + + * mln/value/range.hh, + * mln/value/unsignedh.hh, + * tests/value/range.cc, + * tests/value/unsignedh.cc: New. + + * tests/value/Makefile.am: Add targets. + +2012-09-28 Guillaume Lazzara <z(a)lrde.epita.fr> + New routine for filling internal border in K1. * mln/world/k1/fill_0_1_faces_internal_border.hh, diff --git a/milena/mln/value/next.hh b/milena/mln/value/next.hh index e1dac48..b9bc06e 100644 --- a/milena/mln/value/next.hh +++ b/milena/mln/value/next.hh @@ -1,4 +1,5 @@ -// Copyright (C) 2010 EPITA Research and Development Laboratory (LRDE) +// Copyright (C) 2010, 2012 EPITA Research and Development Laboratory +// (LRDE) // // This file is part of Olena. // @@ -28,9 +29,10 @@ /// \file /// -/// Return a given value incremented by 1. +/// Return the next value. # include <mln/value/label.hh> +# include <mln/value/unsignedh.hh> namespace mln @@ -74,6 +76,14 @@ namespace mln return v.next(); } + + inline + mln::value::unsignedh + next_unsignedh(const mln::value::unsignedh& v) + { + return mln::value::succ(v); + } + } // end of namespace mln::value::implementation @@ -91,6 +101,12 @@ namespace mln return implementation::next_label(v); } + inline + unsignedh + next_dispatch(const unsignedh& v) + { + return implementation::next_unsignedh(v); + } template <typename V> inline diff --git a/milena/mln/value/range.hh b/milena/mln/value/range.hh new file mode 100644 index 0000000..ca8f2f4 --- /dev/null +++ b/milena/mln/value/range.hh @@ -0,0 +1,425 @@ +// Copyright (C) 2012 EPITA Research and Development Laboratory (LRDE) +// +// This file is part of Olena. +// +// Olena is free software: you can redistribute it and/or modify it under +// the terms of the GNU General Public License as published by the Free +// Software Foundation, version 2 of the License. +// +// Olena is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +// General Public License for more details. +// +// You should have received a copy of the GNU General Public License +// along with Olena. If not, see <http://www.gnu.org/licenses/>. +// +// As a special exception, you may use this file as part of a free +// software project without restriction. Specifically, if other files +// instantiate templates or use macros or inline functions from this +// file, or you compile this file and link it with other files to produce +// an executable, this file does not by itself cause the resulting +// executable to be covered by the GNU General Public License. This +// exception does not however invalidate any other reasons why the +// executable file might be covered by the GNU General Public License. + +#ifndef MLN_VALUE_RANGE_HH +# define MLN_VALUE_RANGE_HH + +/// \file +/// +/// Define a range value. + +# include <cstdlib> +# include <iostream> +# include <mln/value/next.hh> + +namespace mln +{ + + namespace value + { + + template <typename T> + class range + { + public: + range(); + + template <typename T_> + range(T_ value); + + range(T lower, T upper); + + range& operator=(const range& rhs); + + template <typename T_> + range& operator=(T_ value); + + bool has(const T& v) const; + + T length() const; + + unsigned nelements() const; + + bool is_degenerated() const; + + const T& lower() const; + const T& upper() const; + + const T& first() const; + const T& last() const; + + operator T() const; + + private: + T lower_; + T upper_; + }; + +// comparison + + template <typename T> + bool + operator==(const range<T>& lhs, const range<T>& rhs); + + template <typename T> + bool + operator!=(const range<T>& lhs, const range<T>& rhs); + +// deactivation of ordering related operators + + template <typename T> + void operator<(const range<T>&, const range<T>&); + + template <typename T> + void operator<=(const range<T>&, const range<T>&); + + template <typename T> + void operator>(const range<T>&, const range<T>&); + + template <typename T> + void operator>=(const range<T>&, const range<T>&); + +// set ops + + template <typename T> + bool + are_adjacent(const range<T>& r1, const range<T>& r2); + + template <typename T> + bool + do_intersect(const range<T>& r1, const range<T>& r2); + + template <typename T> + range<T> + inter(const range<T>& r1, const range<T>& r2); + +// min / max + + template <typename T> + range<T> + min(const range<T>& r1, const range<T>& r2); + + template <typename T> + range<T> + max(const range<T>& r1, const range<T>& r2); + +// mean + + template <typename T> + range<T> + mean(const range<T>& r1, const range<T>& r2); + +// span + + template <typename T> + range<T> + span(const range<T>& r1, const range<T>& r2); + +// op<< + + template <typename T> + std::ostream& + operator<<(std::ostream& ostr, const range<T>& i); + + } // end of namespace mln::value + +} // end of namespace mln + + +// for sorting purpose + +namespace std +{ + + template <typename T> + struct less< mln::value::range<T> > + { + bool operator()(const mln::value::range<T>& l, + const mln::value::range<T>& r) const; + }; + +} // std + + + +# ifndef MLN_INCLUDE_ONLY + + +namespace mln +{ + + namespace value + { + + + template <typename T> + range<T>::range() + { + } + + template <typename T> + template <typename T_> + range<T>::range(T_ value) + { + lower_ = upper_ = value; + } + + template <typename T> + range<T>::range(T lower, T upper) + { + if (upper < lower) + std::abort(); + lower_ = lower; + upper_ = upper; + } + + template <typename T> + range<T>& + range<T>::operator=(const range& rhs) + { + lower_ = rhs.lower_; + upper_ = rhs.upper_; + return *this; + } + + template <typename T> + template <typename T_> + range<T>& + range<T>::operator=(T_ value) + { + lower_ = upper_ = value; + return *this; + } + + template <typename T> + bool + range<T>::has(const T& v) const + { + return lower_ <= v && v <= upper_; + } + + template <typename T> + T + range<T>::length() const + { + return upper_ - lower_; + } + + template <typename T> + unsigned + range<T>::nelements() const + { + unsigned n = 1; + T v = lower_; + for (; v != upper_; v = value::next(v)) + n += 1; + + return n; + } + + template <typename T> + bool + range<T>::is_degenerated() const + { + return upper_ == lower_; + } + + template <typename T> + const T& + range<T>::lower() const + { + return lower_; + } + + template <typename T> + const T& + range<T>::upper() const + { + return upper_; + } + + template <typename T> + const T& + range<T>::first() const + { + return lower_; + } + + template <typename T> + const T& + range<T>::last() const + { + return upper_; + } + + template <typename T> + range<T>::operator T() const + { + if (! is_degenerated()) + std::abort(); + return upper_; + } + + +// comparison + + template <typename T> + bool + operator==(const range<T>& lhs, const range<T>& rhs) + { + return lhs.lower() == rhs.lower() && lhs.upper() == rhs.upper(); + } + + template <typename T> + bool + operator!=(const range<T>& lhs, const range<T>& rhs) + { + return ! (lhs == rhs); + } + + +// deactivation of ordering related operators + + template <typename T> + void operator<(const range<T>&, const range<T>&); + + template <typename T> + void operator<=(const range<T>&, const range<T>&); + + template <typename T> + void operator>(const range<T>&, const range<T>&); + + template <typename T> + void operator>=(const range<T>&, const range<T>&); + + + +// set ops + + template <typename T> + bool + are_adjacent(const range<T>& r1, const range<T>& r2) + { + return span(r1, r2).length() == r1.length() + r2.length() + + (value::next(r2.lower()) - r2.lower()); + } + + template <typename T> + bool + do_intersect(const range<T>& r1, const range<T>& r2) + { + return span(r1, r2).length() <= r1.length() + r2.length(); + } + + template <typename T> + range<T> + inter(const range<T>& r1, const range<T>& r2) + { + if (! do_intersect(r1, r2)) + std::abort(); + return range<T>(std::max(r1.lower(), r2.lower()), + std::min(r1.upper(), r2.upper())); + } + + + +// min / max + + template <typename T> + range<T> + min(const range<T>& r1, const range<T>& r2) + { + return range<T>(std::min(r1.lower(), r2.lower()), + std::min(r1.upper(), r2.upper())); + } + + template <typename T> + range<T> + max(const range<T>& r1, const range<T>& r2) + { + return range<T>(std::max(r1.lower(), r2.lower()), + std::max(r1.upper(), r2.upper())); + } + + +// mean + + template <typename T> + range<T> + mean(const range<T>& r1, const range<T>& r2) + { + return range<T>(mean(r1.lower(), r2.lower()), + mean(r1.upper(), r2.upper())); + } + + +// span + + template <typename T> + range<T> + span(const range<T>& r1, const range<T>& r2) + { + return range<T>(std::min(r1.lower(), r2.lower()), + std::max(r1.upper(), r2.upper())); + } + + + +// op<< + + template <typename T> + std::ostream& + operator<<(std::ostream& ostr, const range<T>& i) + { + if (i.is_degenerated()) + return ostr << i.lower(); + else + return ostr << '[' << i.lower() << ',' << i.upper() << ']'; + } + + + } // end of namespace mln::value + +} // end of namespace mln + + +namespace std +{ + + template <typename T> + bool less< mln::value::range<T> >::operator()(const mln::value::range<T>& l, + const mln::value::range<T>& r) const + { + if (! l.is_degenerated() || ! r.is_degenerated()) + std::abort(); + return l.lower() < r.lower(); + } + +} // std + + +# endif // ! MLN_INCLUDE_ONLY + +#endif // ndef MLN_VALUE_RANGE_HH diff --git a/milena/mln/value/unsignedh.hh b/milena/mln/value/unsignedh.hh new file mode 100644 index 0000000..1f0281c --- /dev/null +++ b/milena/mln/value/unsignedh.hh @@ -0,0 +1,415 @@ +// Copyright (C) 2012 EPITA Research and Development Laboratory (LRDE) +// +// This file is part of Olena. +// +// Olena is free software: you can redistribute it and/or modify it under +// the terms of the GNU General Public License as published by the Free +// Software Foundation, version 2 of the License. +// +// Olena is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +// General Public License for more details. +// +// You should have received a copy of the GNU General Public License +// along with Olena. If not, see <http://www.gnu.org/licenses/>. +// +// As a special exception, you may use this file as part of a free +// software project without restriction. Specifically, if other files +// instantiate templates or use macros or inline functions from this +// file, or you compile this file and link it with other files to produce +// an executable, this file does not by itself cause the resulting +// executable to be covered by the GNU General Public License. This +// exception does not however invalidate any other reasons why the +// executable file might be covered by the GNU General Public License. + +#ifndef MLN_VALUE_UNSIGNEDH_HH +# define MLN_VALUE_UNSIGNEDH_HH + +/// \file +/// +/// Define a semi-unsigned value class. + +# include <cstdlib> +# include <iostream> +# include <sstream> + +// FIXME: parameterize unsignedh so that we also can have +// Z/4 and so on... + +namespace mln +{ + + namespace value + { + + + class unsignedh + { + public: + unsignedh(); + unsignedh(const unsignedh& rhs); + unsignedh(unsigned i); + unsignedh(int i); + + unsignedh& operator=(const unsignedh& rhs); + unsignedh& operator=(unsigned i); + unsignedh& operator=(int i); + + unsigned enc() const; + + /// Construct an unsignedh with value v + static unsignedh make(unsigned v); + /// Construct an unsignedh with value v. The given value is + /// rounded to the closest integer or half value. +// static unsignedh make(float v); + + bool is_integer() const; + + unsigned to_unsigned() const; + + /// Set this unsignedh to its next value and return itself. + unsignedh& goto_succ(); + + /// Set this unsignedh to its previous value and return itself. + unsignedh& goto_pred(); + + operator std::string() const; + + private: + unsigned enc_; + }; + + + extern const unsignedh half; + + +// next + + unsignedh succ(unsignedh i); + unsignedh pred(unsignedh i); + +// rounding + + unsignedh floor(unsignedh i); + unsignedh ceil(unsignedh i); + + +// comparison + + bool operator==(unsignedh l, unsignedh r); + bool operator<=(unsignedh l, unsignedh r); + bool operator!=(unsignedh l, unsignedh r); + bool operator>=(unsignedh l, unsignedh r); + bool operator>(unsignedh l, unsignedh r); + bool operator<(unsignedh l, unsignedh r); + +// arithmetics + + unsignedh operator+(unsignedh l, unsignedh r); + void operator+=(unsignedh& l, unsignedh r); + unsignedh operator-(unsignedh l, unsignedh r); + void operator-=(unsignedh& l, unsignedh r); + unsignedh operator/(unsignedh l, unsigned r); + +// other ops + + unsignedh min(unsignedh u1, unsignedh u2); + unsignedh max(unsignedh u1, unsignedh u2); + unsignedh mean(unsignedh u1, unsignedh u2); + +// for a transparent use of both unsigned and unsignedh +// FIXME: is it useful? + + unsigned decode(unsigned u); + void encode(unsigned u, unsigned& dst); + unsigned decode(unsignedh u); + void encode(unsigned u, unsignedh& dst); + +// << + + std::ostream& + operator<<(std::ostream& ostr, const unsignedh& i); + + +# ifndef MLN_INCLUDE_ONLY + + inline + unsignedh::unsignedh() + { + } + + inline + unsignedh::unsignedh(const unsignedh& rhs) + : enc_(rhs.enc_) + { + } + + + inline + unsignedh::unsignedh(unsigned i) + { + enc_ = 2 * i; + } + + inline + unsignedh::unsignedh(int i) + { + if (i < 0) + std::abort(); + enc_ = 2 * i; + } + + inline + unsignedh& + unsignedh::operator=(const unsignedh& rhs) + { + enc_ = rhs.enc_; + return *this; + } + + inline + unsignedh& + unsignedh::operator=(unsigned i) + { + enc_ = 2 * i; + return *this; + } + + inline + unsignedh& + unsignedh::operator=(int i) + { + if (i < 0) + std::abort(); + enc_ = 2 * i; + return *this; + } + + inline + unsigned + unsignedh::enc() const + { + return enc_; + } + + inline + unsignedh unsignedh::make(unsigned enc) + { + unsignedh i; + i.enc_ = enc; + return i; + } + + inline + bool + unsignedh::is_integer() const + { + return enc_ % 2 == 0; + } + + inline + unsigned + unsignedh::to_unsigned() const + { + if (! this->is_integer()) + std::abort(); + return enc_ / 2; + } + + inline + unsignedh& + unsignedh::goto_succ() + { + enc_ += 1; + return *this; + } + + inline + unsignedh& + unsignedh::goto_pred() + { + if (enc_ == 0) + std::abort(); + enc_ -= 1; + return *this; + } + + inline + unsignedh::operator std::string() const + { + std::stringstream s; + s << *this; + return s.str(); + } + + + +// half + +# ifndef MLN_WO_GLOBAL_VARS + + const unsignedh half = unsignedh::make(1u); + +# endif // ! MLN_WO_GLOBAL_VARS + + +// next + + unsignedh succ(unsignedh i) + { + return unsignedh::make(i.enc() + 1); + } + + unsignedh pred(unsignedh i) + { + if (i.enc() == 0) + std::abort(); + return unsignedh::make(i.enc() - 1); + } + + + +// rounding + + unsignedh floor(unsignedh i) + { + return i.is_integer() ? i : pred(i); + } + + unsignedh ceil(unsignedh i) + { + return i.is_integer() ? i : succ(i); + } + + + +// comparison + + bool operator==(unsignedh l, unsignedh r) + { + return l.enc() == r.enc(); + } + + bool operator<=(unsignedh l, unsignedh r) + { + return l.enc() <= r.enc(); + } + + bool operator!=(unsignedh l, unsignedh r) + { + return ! (l == r); + } + + bool operator>=(unsignedh l, unsignedh r) + { + return r <= l; + } + + bool operator>(unsignedh l, unsignedh r) + { + return ! (l <= r); + } + + bool operator<(unsignedh l, unsignedh r) + { + return r > l; + } + + + +// arithmetics + + unsignedh operator+(unsignedh l, unsignedh r) + { + return unsignedh::make(l.enc() + r.enc()); + } + + void operator+=(unsignedh& l, unsignedh r) + { + l = l + r; + } + + unsignedh operator-(unsignedh l, unsignedh r) + { + if (r > l) + std::abort(); + return unsignedh::make(l.enc() - r.enc()); + } + + void operator-=(unsignedh& l, unsignedh r) + { + if (r > l) + std::abort(); + l = l - r; + } + + unsignedh operator/(unsignedh l, unsigned r) + { + if (l.enc() % r != 0) + std::abort(); + return unsignedh::make(l.enc() / r); + } + + + +// other ops + + unsignedh min(unsignedh u1, unsignedh u2) + { + return unsignedh::make(u1.enc() < u2.enc() ? u1.enc() : u2.enc()); + } + + unsignedh max(unsignedh u1, unsignedh u2) + { + return unsignedh::make(u1.enc() > u2.enc() ? u1.enc() : u2.enc()); + } + + unsignedh mean(unsignedh u1, unsignedh u2) + { + return (u1 + u2) / 2; + } + + +// for a transparent use of both unsigned and unsignedh +// FIXME: is it useful? + + unsigned decode(unsigned u) + { + return u; + } + + void encode(unsigned u, unsigned& dst) + { + dst = u; + } + + unsigned decode(unsignedh u) + { + return u.enc(); + } + + void encode(unsigned u, unsignedh& dst) + { + dst = unsignedh::make(u); + } + + +// << + + std::ostream& + operator<<(std::ostream& ostr, const unsignedh& i) + { + if (i.is_integer()) + return ostr << i.to_unsigned(); + else + return ostr << floor(i).to_unsigned() << ".5"; + } + +# endif // ! MLN_INCLUDE_ONLY + + } // end of namespace mln::value + +} // end of namespace mln + +#endif // ndef UNSIGNEDH_HH diff --git a/milena/tests/value/Makefile.am b/milena/tests/value/Makefile.am index 975d471..fb654fa 100644 --- a/milena/tests/value/Makefile.am +++ b/milena/tests/value/Makefile.am @@ -31,15 +31,17 @@ check_PROGRAMS = \ interop \ label \ proxy \ + range \ rgb8 \ scalar \ set \ - sign -# float01 -# float01_bis -# float01_f -# graylevel -# graylevel_f + sign \ + unsignedh +# float01 +# float01_bis +# float01_f +# graylevel +# graylevel_f bool_SOURCES = bool.cc equiv_SOURCES = equiv.cc @@ -54,10 +56,12 @@ int_u8_SOURCES = int_u8.cc interop_SOURCES = interop.cc label_SOURCES = label.cc proxy_SOURCES = proxy.cc +range_SOURCES = range.cc rgb8_SOURCES = rgb8.cc scalar_SOURCES = scalar.cc set_SOURCES = set.cc sign_SOURCES = sign.cc +unsignedh_SOURCES = unsignedh.cc #<<lrde # FIXME: Not distributed (yet). diff --git a/milena/tests/world/k1/fill_0_1_faces_internal_border.cc b/milena/tests/value/range.cc similarity index 61% copy from milena/tests/world/k1/fill_0_1_faces_internal_border.cc copy to milena/tests/value/range.cc index fbb9f73..22421ed 100644 --- a/milena/tests/world/k1/fill_0_1_faces_internal_border.cc +++ b/milena/tests/value/range.cc @@ -25,35 +25,47 @@ /// \file -#include <mln/core/image/image2d.hh> -#include <mln/make/box2d.hh> -#include <mln/data/compare.hh> -#include <mln/world/k1/fill_0_1_faces_internal_border.hh> +#include <cassert> +#include <vector> +#include <algorithm> + +#include <mln/value/unsignedh.hh> +#include <mln/value/range.hh> + +static const char *ref[] = { "1", "1.5", "2", "2.5", "3", "3.5", "4", "4.5", "5" }; int main() { - using namespace mln; - - int refvals[5][5] = { - {1, 1, 1, 1, 1 }, - {1, 2, 0, 2, 1 }, - {1, 0, 0, 0, 1 }, - {1, 2, 0, 2, 1 }, - {1, 1, 1, 1, 1 } - }; - image2d<int> ref = make::image(refvals, point2d(-1, -1)); - - int vals[5][5] = { - {0, 0, 0, 0, 0 }, - {0, 2, 0, 2, 0 }, - {0, 0, 0, 0, 0 }, - {0, 2, 0, 2, 0 }, - {0, 0, 0, 0, 0 } - }; - image2d<int> imak1 = make::image(vals, point2d(-1, -1)); + using namespace mln::value; + + typedef range<unsignedh> R; + + { + R r(0, 0); + assert(r.is_degenerated()); + assert(r.length() == 0); + assert(r.nelements() == 1); + } + + { + assert(are_adjacent(R(0,1), R(1+half,2))); + } { - world::k1::fill_0_1_faces_internal_border(imak1, 1); - mln_assertion(ref == imak1); + std::vector<R> v; + v.push_back(R(0,0)); + std::sort(v.begin(), v.end(), std::less<R>()); } + + { + R r(1, 5); + assert(!r.is_degenerated()); + assert(r.length() == 4); + assert(r.nelements() == 9); + + int ref_i = 0; + for (unsignedh v = r.first(); v != r.last(); v.goto_succ()) + mln_assertion(static_cast<std::string>(v) == ref[ref_i++]); + } + } diff --git a/milena/tests/fun/i2v/array.cc b/milena/tests/value/unsignedh.cc similarity index 80% copy from milena/tests/fun/i2v/array.cc copy to milena/tests/value/unsignedh.cc index 2633b41..ca98a59 100644 --- a/milena/tests/fun/i2v/array.cc +++ b/milena/tests/value/unsignedh.cc @@ -1,4 +1,4 @@ -// Copyright (C) 2009 EPITA Research and Development Laboratory (LRDE) +// Copyright (C) 2012 EPITA Research and Development Laboratory (LRDE) // // This file is part of Olena. // @@ -23,20 +23,22 @@ // exception does not however invalidate any other reasons why the // executable file might be covered by the GNU General Public License. -#include <mln/fun/i2v/array.hh> +/// \file + +#include <cassert> +#include <mln/value/unsignedh.hh> int main() { - using namespace mln; + using namespace mln::value; - fun::i2v::array<int> f; - mln_assertion(f.size() == 0u); + unsignedh i = 2; + i.goto_succ(); - f.append(0); - mln_assertion(f(0) == 0); + // i == 2.5 + assert(i == 2 + half); - f.append(1); - mln_assertion(f(1) == 1); - mln_assertion(f.size() == 2u); + // (2.5 + 0.5) / 2 == 1.5 + assert(mean(i, half) == 1 + half); } -- 1.7.2.5

12 years, 3 months

olena-2.0-30-g91b3fcb New routine for filling internal border in K1.

by Guillaume Lazzara

* mln/world/k1/fill_0_1_faces_internal_border.hh, * tests/world/k1/fill_0_1_faces_internal_border.cc: New. * tests/world/k1/Makefile.am: New target. --- milena/ChangeLog | 9 ++ ..._faces.hh => fill_0_1_faces_internal_border.hh} | 79 +++++++++---------- milena/tests/world/k1/Makefile.am | 2 + ...mmerse.cc => fill_0_1_faces_internal_border.cc} | 29 ++++--- 4 files changed, 65 insertions(+), 54 deletions(-) copy milena/mln/world/k1/{fill_0_from_primary_faces.hh => fill_0_1_faces_internal_border.hh} (53%) copy milena/tests/world/k1/{un_immerse.cc => fill_0_1_faces_internal_border.cc} (76%) diff --git a/milena/ChangeLog b/milena/ChangeLog index 0744148..525ab23 100644 --- a/milena/ChangeLog +++ b/milena/ChangeLog @@ -1,3 +1,12 @@ +2012-09-28 Guillaume Lazzara <z(a)lrde.epita.fr> + + New routine for filling internal border in K1. + + * mln/world/k1/fill_0_1_faces_internal_border.hh, + * tests/world/k1/fill_0_1_faces_internal_border.cc: New. + + * tests/world/k1/Makefile.am: New target. + 2012-09-27 Guillaume Lazzara <z(a)lrde.epita.fr> * mln/world/k1/neighb2d.hh: New neighborhoods. diff --git a/milena/mln/world/k1/fill_0_from_primary_faces.hh b/milena/mln/world/k1/fill_0_1_faces_internal_border.hh similarity index 53% copy from milena/mln/world/k1/fill_0_from_primary_faces.hh copy to milena/mln/world/k1/fill_0_1_faces_internal_border.hh index db3aed8..0ee3d27 100644 --- a/milena/mln/world/k1/fill_0_from_primary_faces.hh +++ b/milena/mln/world/k1/fill_0_1_faces_internal_border.hh @@ -25,13 +25,13 @@ /// \file /// -/// \brief Fill 1 faces in a K1 2D image using its primary faces. +/// \brief Fill 0 and 1 faces border with a value in a K1 2D image. -#ifndef MLN_WORLD_K1_FILL_0_FROM_PRIMARY_FACES_HH -# define MLN_WORLD_K1_FILL_0_FROM_PRIMARY_FACES_HH +#ifndef MLN_WORLD_K1_FILL_0_1_FACES_INTERNAL_BORDER_HH +# define MLN_WORLD_K1_FILL_0_1_FACES_INTERNAL_BORDER_HH # include <mln/core/alias/point2d.hh> -# include <mln/world/k1/fill_0_from_2_faces.hh> +# include <mln/world/k1/is_0_face.hh> namespace mln @@ -43,27 +43,23 @@ namespace mln namespace k1 { - /*! \brief Fill 0 faces in a K1 2D image using its primary faces. + /*! \brief Fill 0 and 1 faces border with a value in a K1 2D image. \param[in,out] inout A 2D image immersed in K1. - \param[in,out] f A functor computing a result from four values. + \param[in] v The border value. - This function use the following neighborhood: - - \verbatim - x x - . - x x - \endverbatim + Example with \p v=1: + . - . - . 1 1 1 1 1 + | o | o | 1 o | o 1 + . - . - . -> 1 - . - 1 + | o | o | 1 o | o 1 + . - . - . 1 1 1 1 1 */ - template <typename I, typename F> - void fill_0_from_primary_faces(Image& inout, Function_vvvv2v<F>& f); + template <typename I> + void fill_0_1_faces_internal_border(Image& inout, const mln_value(I)& v); - /// \overload - template <typename I, typename A> - void fill_0_from_primary_faces(Image& inout, const Accumulator<A>& accu); # ifndef MLN_INCLUDE_ONLY @@ -72,32 +68,31 @@ namespace mln // Facade - template <typename I, typename F> - void fill_0_from_primary_faces(Image& inout, Function_vvvv2v<F>& f) - { - trace::entering("mln::world::k1::fill_0_from_primary_faces"); - - mln_precondition(exact(inout).is_valid()); - - fill_0_from_2_faces(inout, f); - - trace::exiting("mln::world::k1::fill_0_from_primary_faces"); - } - - - template <typename I, typename A> - void fill_0_from_primary_faces(Image& inout, const Accumulator<A>& accu) + template <typename I> + void fill_0_1_faces_internal_border(Image& inout_, const mln_value(I)& v) { - trace::entering("mln::world::k1::fill_0_from_primary_faces"); - - mln_precondition(exact(inout).is_valid()); - - fill_0_from_2_faces(inout, accu); - - trace::exiting("mln::world::k1::fill_0_from_primary_faces"); + trace::entering("mln::world::k1::fill_0_1_faces_internal_border"); + + mln_precondition(exact(inout_).is_valid()); + I& inout = exact(inout_); + + // Horizontal borders + for (mln::def::coord col = geom::min_col(inout); col <= geom::max_col(inout); ++col) + { + inout.at_(geom::min_row(inout), col) = v; + inout.at_(geom::max_row(inout), col) = v; + } + + // Vertical borders + for (mln::def::coord row = geom::min_row(inout); row <= geom::max_row(inout); ++row) + { + inout.at_(row, geom::min_col(inout)) = v; + inout.at_(row, geom::max_col(inout)) = v; + } + + trace::exiting("mln::world::k1::fill_0_1_faces_internal_border"); } - # endif // ! MLN_INCLUDE_ONLY } // end of namespace mln::world::k1 @@ -106,4 +101,4 @@ namespace mln } // end of namespace mln -#endif // ! MLN_WORLD_K1_FILL_0_FROM_PRIMARY_FACES_HH +#endif // ! MLN_WORLD_K1_FILL_0_1_FACES_INTERNAL_BORDER_HH diff --git a/milena/tests/world/k1/Makefile.am b/milena/tests/world/k1/Makefile.am index 68866fb..0027267 100644 --- a/milena/tests/world/k1/Makefile.am +++ b/milena/tests/world/k1/Makefile.am @@ -18,6 +18,7 @@ include $(top_srcdir)/milena/tests/tests.mk check_PROGRAMS = \ display_enlarged \ + fill_0_1_faces_internal_border \ fill_0_from_1_faces \ fill_0_from_2_faces \ fill_0_from_primary_faces \ @@ -37,6 +38,7 @@ check_PROGRAMS = \ un_immerse display_enlarged_SOURCES = display_enlarged.cc +fill_0_1_faces_border_SOURCES = fill_0_1_faces_border.cc fill_0_from_1_faces_SOURCES = fill_0_from_1_faces.cc fill_0_from_2_faces_SOURCES = fill_0_from_2_faces.cc fill_0_from_primary_faces_SOURCES = fill_0_from_primary_faces.cc diff --git a/milena/tests/world/k1/un_immerse.cc b/milena/tests/world/k1/fill_0_1_faces_internal_border.cc similarity index 76% copy from milena/tests/world/k1/un_immerse.cc copy to milena/tests/world/k1/fill_0_1_faces_internal_border.cc index 47e06e4..fbb9f73 100644 --- a/milena/tests/world/k1/un_immerse.cc +++ b/milena/tests/world/k1/fill_0_1_faces_internal_border.cc @@ -26,29 +26,34 @@ /// \file #include <mln/core/image/image2d.hh> -#include <mln/world/k1/un_immerse.hh> #include <mln/make/box2d.hh> #include <mln/data/compare.hh> +#include <mln/world/k1/fill_0_1_faces_internal_border.hh> int main() { using namespace mln; - int refvals[2][2] = { - {3, 3}, - {3, 3} + int refvals[5][5] = { + {1, 1, 1, 1, 1 }, + {1, 2, 0, 2, 1 }, + {1, 0, 0, 0, 1 }, + {1, 2, 0, 2, 1 }, + {1, 1, 1, 1, 1 } }; - image2d<int> ref = make::image(refvals); + image2d<int> ref = make::image(refvals, point2d(-1, -1)); int vals[5][5] = { - {1, 2, 1, 2, 1 }, - {2, 3, 2, 3, 2 }, - {1, 2, 1, 2, 1 }, - {2, 3, 2, 3, 2 }, - {1, 2, 1, 2, 1 } + {0, 0, 0, 0, 0 }, + {0, 2, 0, 2, 0 }, + {0, 0, 0, 0, 0 }, + {0, 2, 0, 2, 0 }, + {0, 0, 0, 0, 0 } }; image2d<int> imak1 = make::image(vals, point2d(-1, -1)); - image2d<int> imak0 = world::k1::un_immerse(imak1); - mln_assertion(imak0 == ref); + { + world::k1::fill_0_1_faces_internal_border(imak1, 1); + mln_assertion(ref == imak1); + } } -- 1.7.2.5

12 years, 3 months

olena-2.0-51-ge8b7ee8 Add a script to generate a Milena header file.

by Roland Levillain

* new-header: New. * Makefile.am (EXTRA_DIST): Add new-header. --- milena/ChangeLog | 7 ++ milena/Makefile.am | 3 + milena/new-header | 155 ++++++++++++++++++++++++++++++++++++++++++++++++++++ 3 files changed, 165 insertions(+), 0 deletions(-) create mode 100755 milena/new-header diff --git a/milena/ChangeLog b/milena/ChangeLog index c1289de..fb6f94c 100644 --- a/milena/ChangeLog +++ b/milena/ChangeLog @@ -1,3 +1,10 @@ +2012-09-28 Roland Levillain <roland(a)lrde.epita.fr> + + Add a script to generate a Milena header file. + + * new-header: New. + * Makefile.am (EXTRA_DIST): Add new-header. + 2012-09-25 Roland Levillain <roland(a)lrde.epita.fr> Fix file names in apps/morphers/recorder-bft. diff --git a/milena/Makefile.am b/milena/Makefile.am index 99f5268..7492f16 100644 --- a/milena/Makefile.am +++ b/milena/Makefile.am @@ -111,3 +111,6 @@ EXTRA_DIST += \ tests/img/test_rgb8.tif \ tests/img/test_bw.tif \ tests/img/test_gl.tif + +# Header file generator. +EXTRA_DIST += new-header diff --git a/milena/new-header b/milena/new-header new file mode 100755 index 0000000..296095c --- /dev/null +++ b/milena/new-header @@ -0,0 +1,155 @@ +#! /bin/sh + +me=$(basename $0) + +stderr () +{ + for i + do + echo >&2 "$me: $i" + done +} + +fatal () +{ + stderr "$@" + exit 1 +} + +usage () +{ + cat <<EOF +Usage: $me: FILENAME + +with + FILENAME path to filename, e.g. "mln/foo/bar.hh" +EOF +} + + +process() +{ + year=$(date +%Y) + guard=$(echo "$1" | tr "[:lower:].-/" "[:upper:]_") + function=$(basename "$filename" .hh) + + # Almost fully qualified name (`mln' is dropped if it is the + # outermost namespace). + qual_name=$(echo "$filename" \ + | sed 's,^mln/,,' \ + | sed 's,\.hh$,,' \ + | sed 's,/,::,g') + + dirs=$(dirname "$filename" | tr '/' ' ') + + # Newline. + nl=" +" + # Indentation. + indent="" + # Namespace opening and closing statements. + ns_opening="" + ns_closing="" + for dir in $dirs; do + ns_opening="${ns_opening}${indent}$nl" + ns_opening="${ns_opening}${indent}namespace $dir$nl" + ns_opening="${ns_opening}${indent}{$nl" + ns_closing="${indent}} // end of namespace $dir$nl${ns_closing}" + ns_closing="${indent}$nl${ns_closing}" + indent="${indent} " + done + +#\\} // end of namespace mln + + # Perl is used when the substitution pattern contains several lines; + # in these cases, escape `@' as it is a special meaning in Perl + # (array sigil). + sed -e "s/@YEAR@/$year/" \ + -e "s/@GUARD@/$guard/" \ + -e "s/@FUNCTION@/$function/" \ + -e "s/@QUAL_NAME@/$qual_name/" \ + | sed "/@BEGIN_INDENT@/,/@END_INDENT@/s/^$[^#]$/$indent\\1/" \ + | sed -e "/@BEGIN_INDENT@/d" \ + -e "/@END_INDENT@/d" \ + | perl -p -e "s,\\@NAMESPACE_OPENING\\@,$ns_opening,;" \ + -e "s,\\@NAMESPACE_CLOSING\\@,$ns_closing," +} + + +if test $# -ne 1; then + usage + exit 1 +fi + +filename=$1 +prefix=$(dirname "$filename") + +mkdir -p "$prefix" || fatal "cannot create directory \`$prefix'" + +process "$filename" >"$filename" <<EOF +// Copyright (C) @YEAR@ EPITA Research and Development Laboratory (LRDE) +// +// This file is part of Olena. +// +// Olena is free software: you can redistribute it and/or modify it under +// the terms of the GNU General Public License as published by the Free +// Software Foundation, version 2 of the License. +// +// Olena is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +// General Public License for more details. +// +// You should have received a copy of the GNU General Public License +// along with Olena. If not, see <http://www.gnu.org/licenses/>. +// +// As a special exception, you may use this file as part of a free +// software project without restriction. Specifically, if other files +// instantiate templates or use macros or inline functions from this +// file, or you compile this file and link it with other files to produce +// an executable, this file does not by itself cause the resulting +// executable to be covered by the GNU General Public License. This +// exception does not however invalidate any other reasons why the +// executable file might be covered by the GNU General Public License. + +#ifndef @GUARD@ +# define @GUARD@ + +/// \file +/// \brief FIXME: Enter short file description here. + +// FIXME: Adjust headers inclusions. +# include <mln/core/concept/image.hh> +# include <mln/core/routine/duplicate.hh> + +@NAMESPACE_OPENING@ +@BEGIN_INDENT@ +/// FIXME: Document this function. +template <typename I> +mln_concrete(I) +@FUNCTION@(const Image& input); + + +# ifndef MLN_INCLUDE_ONLY + +template <typename I> +inline +mln_concrete(I) +@FUNCTION@(const Image& input) +{ + trace::entering("@QUAL_NAME@"); + + // FIXME: Replace this dummy statement with actual code. + mln_concrete(I) output = duplicate(input); + // ... + + trace::exiting("@QUAL_NAME@"); + return output; +} + +# endif // ! MLN_INCLUDE_ONLY + +@END_INDENT@ +@NAMESPACE_CLOSING@ +#endif // ! @GUARD@ +EOF -- 1.7.2.5

12 years, 3 months

branch unstable/scribo updated: olena-2.0-80-g39c4900

by git＠lrde.epita.fr

This is an automated email from the git hooks/post-receive script. It was generated because a ref change was pushed to the repository containing the project "Olena, a generic and efficient image processing platform". The branch unstable/scribo has been updated via 39c49007646f0a4b5ca021af14ee039220865935 (commit) via 4b68faa4d9d1d5895d02886babfa882daacfff34 (commit) via 100a5de1c32ce7239ed7516e695f73039d34c197 (commit) from a0009d29906b8d09acfec883cb0525a744af261c (commit) Those revisions listed above that are new to this repository have not appeared on any other notification email; so we list those revisions in full, below. - Log ----------------------------------------------------------------- 39c4900 mln/debug/draw_graph.hh: Add a new overload and fix comments. 4b68faa scribo/src/content_in_doc.cc: Add more debug images. 100a5de scribo/debug/logger.hh: Fix attributes initialization order. ----------------------------------------------------------------------- Summary of changes: milena/ChangeLog | 4 ++ milena/mln/debug/draw_graph.hh | 66 +++++++++++++++++++++++++++++----------- scribo/ChangeLog | 8 +++++ scribo/scribo/debug/logger.hh | 4 +- scribo/src/content_in_doc.cc | 4 ++ 5 files changed, 66 insertions(+), 20 deletions(-) hooks/post-receive -- Olena, a generic and efficient image processing platform

12 years, 3 months

olena-2.0-131-gc671343 src/binarization/sauvola_ms.cc: Use global timer instead of local one.

by Guillaume Lazzara

--- scribo/ChangeLog | 5 +++++ scribo/src/binarization/sauvola_ms.cc | 4 ++-- 2 files changed, 7 insertions(+), 2 deletions(-) diff --git a/scribo/ChangeLog b/scribo/ChangeLog index 615a624..4bdd1b8 100644 --- a/scribo/ChangeLog +++ b/scribo/ChangeLog @@ -9,6 +9,11 @@ * src/binarization/sauvola.cc, * src/binarization/sauvola_ms.cc: Here. +2012-09-28 Guillaume Lazzara <lazzara(a)caroussel.lrde.epita.fr> + + * src/binarization/sauvola_ms.cc: Use global timer instead of + local one. + 2012-08-23 Guillaume Lazzara <z(a)lrde.epita.fr> * tests/unit_test/unit-tests.mk: Regen. diff --git a/scribo/src/binarization/sauvola_ms.cc b/scribo/src/binarization/sauvola_ms.cc index 970e2aa..335f53e 100644 --- a/scribo/src/binarization/sauvola_ms.cc +++ b/scribo/src/binarization/sauvola_ms.cc @@ -139,13 +139,13 @@ int main(int argc, char *argv[]) mln::fun::v2v::rgb_to_luma<value::int_u8>()); - scribo::debug::logger().start_local_time_logging(); + scribo::debug::logger().start_global_time_logging(); // Binarize image2d<bool> output = scribo::binarization::sauvola_ms(input_1_gl, w_1, s); - scribo::debug::logger().stop_local_time_logging("Binarized in"); + scribo::debug::logger().stop_global_time_logging("Binarized in"); io::magick::save(output, options.arg("output.*")); } -- 1.7.2.5

12 years, 3 months

olena-2.0-80-g39c4900 mln/debug/draw_graph.hh: Add a new overload and fix comments.

by Guillaume Lazzara

--- milena/ChangeLog | 4 ++ milena/mln/debug/draw_graph.hh | 66 +++++++++++++++++++++++++++++----------- 2 files changed, 52 insertions(+), 18 deletions(-) diff --git a/milena/ChangeLog b/milena/ChangeLog index c8f5f24..fdc8bd7 100644 --- a/milena/ChangeLog +++ b/milena/ChangeLog @@ -1,3 +1,7 @@ +2012-09-28 Guillaume Lazzara <z(a)lrde.epita.fr> + + * mln/debug/draw_graph.hh: Add a new overload and fix comments. + 2012-05-11 Guillaume Lazzara <z(a)lrde.epita.fr> * mln/core/alias/neighb3d.hh: Fix invalid c8_3d neighborhood. diff --git a/milena/mln/debug/draw_graph.hh b/milena/mln/debug/draw_graph.hh index 1bcbde6..0bab6f3 100644 --- a/milena/mln/debug/draw_graph.hh +++ b/milena/mln/debug/draw_graph.hh @@ -1,5 +1,5 @@ -// Copyright (C) 2007, 2008, 2009, 2011 EPITA Research and Development -// Laboratory (LRDE) +// Copyright (C) 2007, 2008, 2009, 2011, 2012 EPITA Research and +// Development Laboratory (LRDE) // // This file is part of Olena. // @@ -48,10 +48,11 @@ namespace mln namespace debug { - /// Draw an image \p ima from a mln::p_vertices \p pv, with - /// value \p vcolor for vertices, value \p ecolor for edges and 0 for - /// the background. - /* + /// \brief Draw an image \p ima from a mln::p_vertices \p pv. + /*! + * Value \p vcolor for vertices, value \p ecolor for edges + * and 0 for the background. + * * \param[in,out] ima The image to be drawn. * \param[in] pv The p_vertices which contains vertices positions. * \param[in] vcolor The value to assign to pixels which contains @@ -65,26 +66,41 @@ namespace mln mln_value(I) vcolor, mln_value(I) ecolor); - /// Draw an image \p ima from a mln::p_vertices \p pv. Colors for vertices - /// are defined through \p vcolor_f_. Colors for edges are defined though - /// \p ecolor_f_. - /* + /// \brief Draw an image \p ima from a mln::p_vertices \p pv. + /*! + * Colors for vertices are defined through \p vcolor_f_. Colors + * for edges are defined though \p ecolor_f_. + * Vertices are drawn using a box of width \vwidth. + * * \param[in,out] ima The image to be drawn. * \param[in] pv The p_vertices which contains vertices positions. - * \param[in] vcolor_f_ A function returning a color value for vertices. - * \param[in] ecolor_f_ A function returning a color value for edges. + * \param[in] vcolor_f A function returning a color value for vertices. + * \param[in] ecolor_f A function returning a color value for edges. + * \param[in] vwidth * */ template <typename I, typename G, typename F, typename V, typename E> void draw_graph(Image& ima, const p_vertices<G, F>& pv, + const Function<V>& vcolor_f, const Function<E>& ecolor_f, + unsigned vwidth); + + + /// \overload + template <typename I, typename G, typename F, typename V, typename E> + inline + void + draw_graph(Image& ima_, + const p_vertices<G, F>& pv, const Function<V>& vcolor_f_, const Function<E>& ecolor_f_); - /// Draw an image \p ima from a mln::p_vertices \p pv. Colors for vertices - /// are defined through \p vcolor_f_. Colors for edges are defined though - /// \p ecolor_f_. - /* + /// \brief Draw an image \p ima from a mln::p_vertices \p pv. + /*! + * Colors for vertices + * are defined through \p vcolor_f_. Colors for edges are defined though + * \p ecolor_f_. + * * \param[in,out] ima The image to be drawn. * \param[in] pv The p_vertices which contains vertices positions. * \param[in] vcolor_f_ A function returning a color value for vertices. @@ -172,7 +188,8 @@ namespace mln void draw_graph(Image& ima_, const p_vertices<G, F>& pv, - const Function<V>& vcolor_f_, const Function<E>& ecolor_f_) + const Function<V>& vcolor_f_, const Function<E>& ecolor_f_, + unsigned vwidth) { trace::entering("debug::draw_graph"); @@ -191,11 +208,13 @@ namespace mln draw::line(ima, pv(ei.v1()), pv(ei.v2()), ecolor_f(ei.id())); // Draw vertices. + unsigned vhalf_width = vwidth / 2; mln_piter(pv_t) p(pv); for_all(p) if (ima.has(p) && p.id() != 0u) { - box2d box(p + dpoint2d(-5, -5), p + dpoint2d(+5, +5)); + box2d box(p + dpoint2d(-vhalf_width, -vhalf_width), + p + dpoint2d(+vhalf_width, +vhalf_width)); box.crop_wrt(ima.domain()); draw::box_plain(ima, box, vcolor_f(p.id())); } @@ -204,6 +223,17 @@ namespace mln } + template <typename I, typename G, typename F, typename V, typename E> + inline + void + draw_graph(Image& ima, + const p_vertices<G, F>& pv, + const Function<V>& vcolor_f, const Function<E>& ecolor_f) + { + draw_graph(ima, pv, vcolor_f, ecolor_f, 5); + } + + // FIXME: Refactor + be more restrictive on the function type. template <typename I, typename G, typename F, typename V, typename E> inline -- 1.7.2.5

12 years, 3 months

branch papers/lazzara.12.ijdar updated: olena-2.0-131-gc671343

by git＠lrde.epita.fr

This is an automated email from the git hooks/post-receive script. It was generated because a ref change was pushed to the repository containing the project "Olena, a generic and efficient image processing platform". The branch papers/lazzara.12.ijdar has been updated via c671343e8aba129d47b890f655175d3f3c07a769 (commit) from f7985a1b13b6492cf8bbbb80ac88fdb3da625005 (commit) Those revisions listed above that are new to this repository have not appeared on any other notification email; so we list those revisions in full, below. - Log ----------------------------------------------------------------- c671343 src/binarization/sauvola_ms.cc: Use global timer instead of local one. ----------------------------------------------------------------------- Summary of changes: scribo/ChangeLog | 5 +++++ scribo/src/binarization/sauvola_ms.cc | 4 ++-- 2 files changed, 7 insertions(+), 2 deletions(-) hooks/post-receive -- Olena, a generic and efficient image processing platform

12 years, 3 months

branch sandbox-theo-topology created: last-svn-commit-2-gcc5acd6

by git＠lrde.epita.fr

This is an automated email from the git hooks/post-receive script. It was generated because a ref change was pushed to the repository containing the project "Olena, a generic and efficient image processing platform". The branch sandbox-theo-topology has been created at cc5acd676636c87f53d9f9b41dd4f31e0d7718d8 (commit) - Log ----------------------------------------------------------------- cc5acd6 Update sandbox. 479e023 Populate gorely sandbox-theo-topology. ----------------------------------------------------------------------- hooks/post-receive -- Olena, a generic and efficient image processing platform

12 years, 3 months

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Olena-patches