[Octave-bug-tracker] [bug #54567] median(uint8) gives bad results

[Dan Sebald]

Follow-up Comment #14, bug #54567 (project octave):

The Mohanty algorithm is actually for "running" median, or another common
terminology, "moving median".  It keeps a sorted linked list for which it can
easily drop a sample when the window moves past that sample, and add a sorted
sample in the list when that sample moves into the window.  This would be
something good for the signal-processing toolbox if a moving median doesn't
exist already.  (Of course, Octave scripting of linked lists isn't very
efficient, so written in C++ is preferred.)

Octave's current median() with sorting is pretty efficient.  The mean()
function definitely needs some work, though.  There probably is not a lot of
coding, but because of its importance the routine needs attention to detail
which could take time.

    _______________________________________________________

Reply to this item at:

  <http://savannah.gnu.org/bugs/?54567>

_______________________________________________
  Message sent via Savannah
  https://savannah.gnu.org/