Difference between revisions of "Publications/boutry.19.jmiv"
From LRDE
(Created page with "{{Publication | published = true | date = 2019-02-04 | authors = Nicolas Boutry, Thierry Géraud, Laurent Najman | title = How to Make n-D Plain Maps Alexandrov-Well-Composed...") |
|||
Line 9: | Line 9: | ||
| lrdeprojects = Olena |
| lrdeprojects = Olena |
||
| abstract = In 2013, Najman and Géraud proved that by working on a well-composed discrete representation of a gray-level image, we can compute what is called its tree of shapes, a hierarchical representation of the shapes in this image. This way, we can proceed to morphological filtering and to image segmentation. However, the authors did not provide such a representation for the non-cubical case. We propose in this paper a way to compute a well-composed representation of any gray-level image defined on a discrete surface, which is a more general framework than the usual cubical grid. Furthermore, the proposed representation is self-dual in the sense that it treats bright and dark components in the image the same way. This paper can be seen as an extension to gray-level images of the works of Daragon et al. on discrete surfaces. |
| abstract = In 2013, Najman and Géraud proved that by working on a well-composed discrete representation of a gray-level image, we can compute what is called its tree of shapes, a hierarchical representation of the shapes in this image. This way, we can proceed to morphological filtering and to image segmentation. However, the authors did not provide such a representation for the non-cubical case. We propose in this paper a way to compute a well-composed representation of any gray-level image defined on a discrete surface, which is a more general framework than the usual cubical grid. Furthermore, the proposed representation is self-dual in the sense that it treats bright and dark components in the image the same way. This paper can be seen as an extension to gray-level images of the works of Daragon et al. on discrete surfaces. |
||
+ | | lrdepaper = http://www.lrde.epita.fr/dload/papers/boutry.19.jmiv.pdf |
||
| lrdekeywords = Image |
| lrdekeywords = Image |
||
| lrdenewsdate = 2019-2-4 |
| lrdenewsdate = 2019-2-4 |
Revision as of 05:21, 10 February 2019
- Authors
- Nicolas Boutry, Thierry Géraud, Laurent Najman
- Journal
- Journal of Mathematical Imaging and Vision
- Type
- article
- Projects
- Olena
- Keywords
- Image
- Date
- 2019-02-04
Abstract
In 2013, Najman and Géraud proved that by working on a well-composed discrete representation of a gray-level image, we can compute what is called its tree of shapes, a hierarchical representation of the shapes in this image. This way, we can proceed to morphological filtering and to image segmentation. However, the authors did not provide such a representation for the non-cubical case. We propose in this paper a way to compute a well-composed representation of any gray-level image defined on a discrete surface, which is a more general framework than the usual cubical grid. Furthermore, the proposed representation is self-dual in the sense that it treats bright and dark components in the image the same way. This paper can be seen as an extension to gray-level images of the works of Daragon et al. on discrete surfaces.
Documents
Bibtex (lrde.bib)
@Article{ boutry.19.jmiv, author = {Nicolas Boutry and Thierry G\'eraud and Laurent Najman}, title = {How to Make {$n$-D} Plain Maps {A}lexandrov-Well-Composed in a Self-dual Way}, journal = {Journal of Mathematical Imaging and Vision}, volume = {0}, pages = {1--26}, month = {}, year = {2019}, abstract = {In 2013, Najman and G\'eraud proved that by working on a well-composed discrete representation of a gray-level image, we can compute what is called its tree of shapes, a hierarchical representation of the shapes in this image. This way, we can proceed to morphological filtering and to image segmentation. However, the authors did not provide such a representation for the non-cubical case. We propose in this paper a way to compute a well-composed representation of any gray-level image defined on a discrete surface, which is a more general framework than the usual cubical grid. Furthermore, the proposed representation is self-dual in the sense that it treats bright and dark components in the image the same way. This paper can be seen as an extension to gray-level images of the works of Daragon et al. on discrete surfaces.} }