Difference between revisions of "Publications/huynh.17.ismm"
From LRDE
(Created page with "{{Publication | published = true | date = 2017-02-23 | authors = Lê Duy Hu`ynh, Yongchao Xu, Thierry Géraud | title = Morphological Hierarchical Image Decomposition Based on...") |
|||
(7 intermediate revisions by the same user not shown) | |||
Line 2: | Line 2: | ||
| published = true |
| published = true |
||
| date = 2017-02-23 |
| date = 2017-02-23 |
||
− | | authors = Lê Duy |
+ | | authors = Lê Duy Huỳnh, Yongchao Xu, Thierry Géraud |
| title = Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings |
| title = Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings |
||
− | | booktitle = Mathematical Morphology and Its Application to Signal and Image Processing |
+ | | booktitle = Mathematical Morphology and Its Application to Signal and Image Processing – Proceedings of the 13th International Symposium on Mathematical Morphology (ISMM) |
− | | |
+ | | editors = J Angulo, S Velasco-Forero, F Meyer |
− | | |
+ | | volume = 10225 |
| series = Lecture Notes in Computer Science |
| series = Lecture Notes in Computer Science |
||
+ | | pages = 159 to 171 |
||
| address = Fontainebleau, France |
| address = Fontainebleau, France |
||
− | | optpages = |
||
| publisher = Springer |
| publisher = Springer |
||
⚫ | | abstract = A method of text detection in natural images, to be turn into an effective embedded software on a mobile deviceshall 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. 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. |
||
− | | note = To appear. |
||
⚫ | | abstract = A method of text detection in natural images, to be turn into an effective embedded software on a mobile deviceshall be both efficient and lightweight. |
||
| lrdepaper = http://www.lrde.epita.fr/dload/papers/huynh.17.ismm.pdf |
| lrdepaper = http://www.lrde.epita.fr/dload/papers/huynh.17.ismm.pdf |
||
| lrdekeywords = Image |
| lrdekeywords = Image |
||
Line 18: | Line 17: | ||
| type = inproceedings |
| type = inproceedings |
||
| id = huynh.17.ismm |
| id = huynh.17.ismm |
||
+ | | identifier = doi:10.1007/978-3-319-57240-6_13 |
||
| bibtex = |
| bibtex = |
||
@InProceedings<nowiki>{</nowiki> huynh.17.ismm, |
@InProceedings<nowiki>{</nowiki> huynh.17.ismm, |
||
Line 27: | Line 27: | ||
Symposium on Mathematical Morphology (ISMM)<nowiki>}</nowiki>, |
Symposium on Mathematical Morphology (ISMM)<nowiki>}</nowiki>, |
||
year = <nowiki>{</nowiki>2017<nowiki>}</nowiki>, |
year = <nowiki>{</nowiki>2017<nowiki>}</nowiki>, |
||
− | + | editor = <nowiki>{</nowiki>J. Angulo and S. Velasco-Forero and F. Meyer<nowiki>}</nowiki>, |
|
− | + | volume = <nowiki>{</nowiki>10225<nowiki>}</nowiki>, |
|
series = <nowiki>{</nowiki>Lecture Notes in Computer Science<nowiki>}</nowiki>, |
series = <nowiki>{</nowiki>Lecture Notes in Computer Science<nowiki>}</nowiki>, |
||
+ | month = may, |
||
⚫ | |||
address = <nowiki>{</nowiki>Fontainebleau, France<nowiki>}</nowiki>, |
address = <nowiki>{</nowiki>Fontainebleau, France<nowiki>}</nowiki>, |
||
− | optpages = <nowiki>{</nowiki><nowiki>}</nowiki>, |
||
⚫ | |||
publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>, |
publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>, |
||
− | + | doi = <nowiki>{</nowiki>10.1007/978-3-319-57240-6_13<nowiki>}</nowiki>, |
|
abstract = <nowiki>{</nowiki>A method of text detection in natural images, to be turn |
abstract = <nowiki>{</nowiki>A method of text detection in natural images, to be turn |
||
into an effective embedded software on a mobile device, |
into an effective embedded software on a mobile device, |
Latest revision as of 13:42, 24 November 2020
- Authors
- Lê Duy Huỳnh, Yongchao Xu, Thierry Géraud
- Where
- Mathematical Morphology and Its Application to Signal and Image Processing – Proceedings of the 13th International Symposium on Mathematical Morphology (ISMM)
- Place
- Fontainebleau, France
- Type
- inproceedings
- Publisher
- Springer
- Keywords
- Image
- Date
- 2017-02-23
Abstract
A method of text detection in natural images, to be turn into an effective embedded software on a mobile deviceshall 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. 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.
Documents
Bibtex (lrde.bib)
@InProceedings{ huynh.17.ismm, author = {L\^e Duy {Hu\`ynh} and Yongchao Xu and Thierry G\'eraud}, title = {Morphological Hierarchical Image Decomposition Based on {L}aplacian 0-Crossings}, booktitle = {Mathematical Morphology and Its Application to Signal and Image Processing -- Proceedings of the 13th International Symposium on Mathematical Morphology (ISMM)}, year = {2017}, editor = {J. Angulo and S. Velasco-Forero and F. Meyer}, volume = {10225}, series = {Lecture Notes in Computer Science}, month = may, pages = {159--171}, address = {Fontainebleau, France}, publisher = {Springer}, doi = {10.1007/978-3-319-57240-6_13}, abstract = {A method of text detection in natural images, to be turn 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. 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.} }