- 4115 users, 635 publications, 769 reviews -
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|
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.
Automatic Testing Results by Insight-Journal Dashboard on Mon Dec 31 16:45:28 2007 for revision #1
expertise: 5 sensitivity: 5
|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|
Linked Publications more
Anisotropic Fast Marching in ITK
by Mirebeau J.
ITK in Biomedical Research and Commercial Applications
by McCormick M., Aylward S., Johnson H., Lowekamp B.
Send a message to the author