[ImageJ-devel] ImgLib2 algorithm ComponentTree / Maximally Stable Extremal Regions

[Stephan Preibisch]

Awesome Tobias! :)

On Nov 28, 2011, at 10:24 AM, Tobias Pietzsch wrote:

> Hi,
> 
> I just pushed the branch mser to the imglib repository.
> It contains an implementation of the linear (in the number of pixels) algorithm to build the component tree of an image, as described in the paper by D. Nister and H. Stewenius "Linear Time Maximally Stable Extremal Regions".
> 
> The generic algorithm is in net.imglib2.algorithm.componenttree.
> 
> In net.imglib2.algorithm.componenttree.pixellist there is an instantiation that stores the complete tree where all components share a single linked list to represent their respective pixel sets (This idea is from Jan Funke's MSER implementation).
> 
> In net.imglib2.algorithm.componenttree.mser there is an instantiation which builds the MSER tree (respectively forrest) of an image.
> 
> See imglib2-tests net.imglib2.algorithm.componenttree.pixellist.PixelListComponentTreeTest and net.imglib2.algorithm.componenttree.mser.MserTreeTest for examples of how to use.
> 
> best regards,
> Tobias
> 
> _______________________________________________
> ImageJ-devel mailing list
> ImageJ-devel at imagejdev.org
> http://imagejdev.org/mailman/listinfo/imagej-devel