Academic
Publications
Selection of Relevant Nodes from Component-Trees in Linear Time

Selection of Relevant Nodes from Component-Trees in Linear Time,10.1007/978-3-642-19867-0_38,Nicolas Passat,Benoît Naegel

Selection of Relevant Nodes from Component-Trees in Linear Time   (Citations: 1)
BibTex | RIS | RefWorks Download
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.
Conference: Discrete Geometry for Computer Imagery - DGCI , pp. 453-464, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: