Selection of relevant nodes from component-trees in linear time

Abstract : 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.
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.univ-reims.fr/hal-01695039
Contributor : Nicolas Passat <>
Submitted on : Wednesday, February 28, 2018 - 11:07:50 PM
Last modification on : Monday, October 8, 2018 - 6:14:15 PM
Long-term archiving on : Monday, May 28, 2018 - 1:46:52 PM

File

Passat_DGCI_2011.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Nicolas Passat, Benoît Naegel. Selection of relevant nodes from component-trees in linear time. Discrete Geometry for Computer Imagery (DGCI), 2011, Nancy, France. pp.453-464, ⟨10.1007/978-3-642-19867-0_38⟩. ⟨hal-01695039⟩

Share

Metrics

Record views

136

Files downloads

100