Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings

Abstract : A method of text detection in natural images, to be turned into an effective embedded software on a mobile device, shall be both efficient and lightweight. We observed that a simple method based on the morphological Laplace operator can do the trick: we can construct in quasi-linear time a hierarchical image decomposition / simplification based on its 0-crossings, and search for some text in the resulting tree. Yet, for this decomposition to be sound, we need " 0-crossings " to be Jordan curves, and to that aim, we rely on some discrete topology tools. Eventually, the hierarchical representation is the morphological tree of shapes of the Laplacian sign (ToSL). Moreover, we provide an algorithm with linear time complexity to compute this representation. We expect that the proposed hierarchical representation can be useful in some applications other than text detection.
Type de document :
Communication dans un congrès
13th International Symposium on Mathematical Morphology (ISMM), May 2017, Fontainebleau, France
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01476302
Contributeur : Thierry Géraud <>
Soumis le : vendredi 24 février 2017 - 16:58:05
Dernière modification le : samedi 15 avril 2017 - 01:08:40
Document(s) archivé(s) le : jeudi 25 mai 2017 - 13:51:54

Fichier

article.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01476302, version 1

Citation

Lê Duy Huỳn, Yongchao Xu, Thierry Géraud. Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings. 13th International Symposium on Mathematical Morphology (ISMM), May 2017, Fontainebleau, France. 〈hal-01476302〉

Partager

Métriques

Consultations de la notice

48

Téléchargements de fichiers

24