Component-trees associate to a discrete grey-level image a descriptive data structure induced by the inclusion relation between the binary components obtained at successive level-sets. This article presents a method to extract a subset of the component-tree of an image enabling to fit at best a given binary target selected beforehand in the image. A proof of the algorithmic efficiency of this method is proposed. Application examples related to the extraction of drop caps from ancient documents emphasise the usefulness of this technique in the context of assisted segmentation. © 2011 Springer-Verlag.
CITATION STYLE
Passat, N., & Naegel, B. (2011). Selection of relevant nodes from component-trees in linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6607 LNCS, pp. 453–464). https://doi.org/10.1007/978-3-642-19867-0_38
Mendeley helps you to discover research relevant for your work.