Re: Find maxima .. algorithm discription

Posted by HPatel on
URL: http://imagej.273.s1.nabble.com/Find-maxima-algorithm-discription-tp3683914p3683921.html

Michael,

Thanks for this.
Do you know if someone has converted this to C++ or C?

Thanks,
Hitesh

Michael Schmid-3 wrote

Hi,

sorry, there is no publication on it (at least none that I am aware of,
probably I have reinvented the wheel), but it is rather simple code:
(1) Find the local maxima
(2) Sort them in descending sequence
(3) For each local maximum, do a flood fill algorithm with the gray level
tolerance (without modifying the original, it is done on a temporary
scratch image). Maxima where flood filling reaches a previously filled
area (i.e., area of other maximum within the tolerance) are discarded.
(4) In case of 'single points' output, if there are several points having
the highest value inside the flood-filled area, use the one that is
closest to their geometric center.

Segmentation is a bit more difficult (it stems from older ImageJ
versions), and I am currently about to see whether it can't be done faster
and with better accuracy...

Michael
_____________________________________________________________________


On Wed, December 9, 2009 22:00, HPatel wrote:
> Is there a document that details the "Find Maxima" algorithm by Michael
> Schmid?
>
> Thanks,
> HPatel