Difference between revisions of "Publications/geraud.15.ismm"
From LRDE
(5 intermediate revisions by the same user not shown) | |||
Line 4: | Line 4: | ||
| authors = Thierry Géraud, Edwin Carlinet, Sébastien Crozet |
| authors = Thierry Géraud, Edwin Carlinet, Sébastien Crozet |
||
| title = Self-Duality and Digital Topology: Links Between the Morphological Tree of Shapes and Well-Composed Gray-Level Images |
| title = Self-Duality and Digital Topology: Links Between the Morphological Tree of Shapes and Well-Composed Gray-Level Images |
||
− | | 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 12th International Symposium on Mathematical Morphology (ISMM) |
| series = Lecture Notes in Computer Science Series |
| series = Lecture Notes in Computer Science Series |
||
| volume = 9082 |
| volume = 9082 |
||
Line 11: | Line 11: | ||
| editors = J A Benediktsson, J Chanussot, L Najman, H Talbot |
| editors = J A Benediktsson, J Chanussot, L Najman, H Talbot |
||
| pages = 573 to 584 |
| pages = 573 to 584 |
||
− | | lrdeprojects = |
+ | | lrdeprojects = Olena |
| abstract = In digital topology, the use of a pair of connectivities is required to avoid topological paradoxes. In mathematical morphology, self-dual operators and methods also rely on such a pair of connectivities. There are several major issues: self-duality is impure, the image graph structure depends on the image values, it impacts the way small objects and texture are processed, and so on. A sub-class of images defined on the cubical grid, well-composed images, has been proposed, where all connectivities are equivalent, thus avoiding many topological problems. In this paper we unveil the link existing between the notion of well-composed images and the morphological tree of shapes. We prove that a well-composed image has a well-defined tree of shapes. We also prove that the only self-dual well-composed interpolation of a 2D image is obtained by the median operator. What follows from our results is that we can have a purely self-dual representation of images, and consequently, purely self-dual operators. |
| abstract = In digital topology, the use of a pair of connectivities is required to avoid topological paradoxes. In mathematical morphology, self-dual operators and methods also rely on such a pair of connectivities. There are several major issues: self-duality is impure, the image graph structure depends on the image values, it impacts the way small objects and texture are processed, and so on. A sub-class of images defined on the cubical grid, well-composed images, has been proposed, where all connectivities are equivalent, thus avoiding many topological problems. In this paper we unveil the link existing between the notion of well-composed images and the morphological tree of shapes. We prove that a well-composed image has a well-defined tree of shapes. We also prove that the only self-dual well-composed interpolation of a 2D image is obtained by the median operator. What follows from our results is that we can have a purely self-dual representation of images, and consequently, purely self-dual operators. |
||
| lrdepaper = http://www.lrde.epita.fr/dload/papers/geraud.15.ismm.pdf |
| lrdepaper = http://www.lrde.epita.fr/dload/papers/geraud.15.ismm.pdf |
||
Line 18: | Line 18: | ||
| type = inproceedings |
| type = inproceedings |
||
| id = geraud.15.ismm |
| id = geraud.15.ismm |
||
+ | | identifier = doi:10.1007/978-3-319-18720-4_48 |
||
| bibtex = |
| bibtex = |
||
@InProceedings<nowiki>{</nowiki> geraud.15.ismm, |
@InProceedings<nowiki>{</nowiki> geraud.15.ismm, |
||
author = <nowiki>{</nowiki>Thierry G\'eraud and Edwin Carlinet and S\'ebastien Crozet<nowiki>}</nowiki>, |
author = <nowiki>{</nowiki>Thierry G\'eraud and Edwin Carlinet and S\'ebastien Crozet<nowiki>}</nowiki>, |
||
− | title = <nowiki>{</nowiki>Self-Duality and Digital Topology: |
+ | title = <nowiki>{</nowiki>Self-Duality and Digital Topology: <nowiki>{</nowiki>L<nowiki>}</nowiki>inks Between the |
Morphological Tree of Shapes and Well-Composed Gray-Level |
Morphological Tree of Shapes and Well-Composed Gray-Level |
||
Images<nowiki>}</nowiki>, |
Images<nowiki>}</nowiki>, |
||
Line 53: | Line 54: | ||
results is that we can have a purely self-dual |
results is that we can have a purely self-dual |
||
representation of images, and consequently, purely |
representation of images, and consequently, purely |
||
− | self-dual operators.<nowiki>}</nowiki> |
+ | self-dual operators.<nowiki>}</nowiki>, |
+ | doi = <nowiki>{</nowiki>10.1007/978-3-319-18720-4_48<nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 17:00, 27 May 2021
- Authors
- Thierry Géraud, Edwin Carlinet, Sébastien Crozet
- Where
- Mathematical Morphology and Its Application to Signal and Image Processing – Proceedings of the 12th International Symposium on Mathematical Morphology (ISMM)
- Place
- Reykjavik, Iceland
- Type
- inproceedings
- Publisher
- Springer
- Projects
- Olena
- Keywords
- Image
- Date
- 2015-04-07
Abstract
In digital topology, the use of a pair of connectivities is required to avoid topological paradoxes. In mathematical morphology, self-dual operators and methods also rely on such a pair of connectivities. There are several major issues: self-duality is impure, the image graph structure depends on the image values, it impacts the way small objects and texture are processed, and so on. A sub-class of images defined on the cubical grid, well-composed images, has been proposed, where all connectivities are equivalent, thus avoiding many topological problems. In this paper we unveil the link existing between the notion of well-composed images and the morphological tree of shapes. We prove that a well-composed image has a well-defined tree of shapes. We also prove that the only self-dual well-composed interpolation of a 2D image is obtained by the median operator. What follows from our results is that we can have a purely self-dual representation of images, and consequently, purely self-dual operators.
Documents
Bibtex (lrde.bib)
@InProceedings{ geraud.15.ismm, author = {Thierry G\'eraud and Edwin Carlinet and S\'ebastien Crozet}, title = {Self-Duality and Digital Topology: {L}inks Between the Morphological Tree of Shapes and Well-Composed Gray-Level Images}, booktitle = {Mathematical Morphology and Its Application to Signal and Image Processing -- Proceedings of the 12th International Symposium on Mathematical Morphology (ISMM)}, year = {2015}, series = {Lecture Notes in Computer Science Series}, volume = {9082}, address = {Reykjavik, Iceland}, publisher = {Springer}, editor = {J.A. Benediktsson and J. Chanussot and L. Najman and H. Talbot}, pages = {573--584}, abstract = {In digital topology, the use of a pair of connectivities is required to avoid topological paradoxes. In mathematical morphology, self-dual operators and methods also rely on such a pair of connectivities. There are several major issues: self-duality is impure, the image graph structure depends on the image values, it impacts the way small objects and texture are processed, and so on. A sub-class of images defined on the cubical grid, {\it well-composed} images, has been proposed, where all connectivities are equivalent, thus avoiding many topological problems. In this paper we unveil the link existing between the notion of well-composed images and the morphological tree of shapes. We prove that a well-composed image has a well-defined tree of shapes. We also prove that the only self-dual well-composed interpolation of a 2D image is obtained by the median operator. What follows from our results is that we can have a purely self-dual representation of images, and consequently, purely self-dual operators.}, doi = {10.1007/978-3-319-18720-4_48} }