Component tree: an efficient representation of grayscale connected components

Please use this identifier to cite or link to this publication:
Connected component is a well known and very useful notion in binary case. As often in mathematical morphology, this notion can be extended to the grayscale case, and allow to perform lot of the useful transforms based on binary connected components in the grayscale images. This article describe the component tree, a data structure able to ef?ciently represent the grayscale connected components in an grayscale image, as well as the algorithm used to build the component tree. All the source codes are provided, as well as a full set of tests and several usage examples of the new classes.
minus 2 Files (1Mb)
minus Automatic Testing Results by Insight-Journal Dashboard on Mon Dec 31 16:45:28 2007 for revision #1
starstarstarstarstar expertise: 5 sensitivity: 5
yellow This project had trouble building: 6 errors, 0 warnings
Click here for more details.

Go here to access the main testing dashboard.

There is no review at this time. Be the first to review this publication!

Quick Comments

Download All

Statistics more
Global rating: starstarstarstarstar
Review rating: starstarstarstarstar [review]
Code rating: starstarstarstarstar
Paper Quality: plus minus

Information more
Categories: Code memory optimization, Code speed optimization, Data Representation, Extreme Programming, Filtering, Generic Programming, Image, Images, Mathematical Morphology, Objects
Keywords: component tree, max-tree, min-tree, mathematical morphology, connected component, connectivity, attribute
Toolkits: ITK, CMake
Export citation:


Linked Publications more
Anisotropic Fast Marching in ITK Anisotropic Fast Marching in ITK
by Mirebeau J.
N4ITK:  Nick's N3 ITK Implementation For MRI Bias Field Correction N4ITK: Nick's N3 ITK Implementation For MRI Bias Field Correction
by Tustison N., Gee J.

View license
Loading license...

Send a message to the author
Powered by Midas