Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings

Résumé

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.
Fichier principal
Vignette du fichier
article.pdf (2.17 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01476302 , version 1 (24-02-2017)

Identifiants

  • HAL Id : hal-01476302 , version 1

Citer

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⟩
125 Consultations
154 Téléchargements

Partager

Gmail Facebook X LinkedIn More