
Component tree: an efficient representation of grayscale connected components
Please use this identifier to cite or link to this publication: http://hdl.handle.net/1926/1328 |
Published in The Insight Journal - 2007 July - December.
Submitted by Gaetan Lehmann on 12-31-2007.
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.
Data
Code







Click here for more details.
Go here to access the main testing dashboard.
Reviews
Quick Comments
Resources
![]() |
|
Download All |
Statistics more
![]() |
|
Global rating: | ![]() ![]() ![]() ![]() ![]() |
Review rating: | ![]() ![]() ![]() ![]() ![]() |
Code rating: | ![]() ![]() ![]() ![]() ![]() |
Paper Quality: |
![]() ![]() |
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: |
Share
![]() |
Linked Publications more
![]() |
||
![]() by Tustison N., Gee J.
|
||
![]() by Gorthi S., Bach Cuadra M., Thiran J.
|
View license
Loading license...
Send a message to the author
