id ftccsdartic:oai:HAL:hal-01168781v1
record_format openpolar
spelling ftccsdartic:oai:HAL:hal-01168781v1 2023-05-15T16:50:14+02:00 Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations Xu, Yongchao Carlinet, Edwin Géraud, Thierry Najman, Laurent Laboratoire d'Informatique Gaspard-Monge (LIGM) Centre National de la Recherche Scientifique (CNRS)-Fédération de Recherche Bézout-ESIEE Paris-École des Ponts ParisTech (ENPC)-Université Paris-Est Marne-la-Vallée (UPEM) Laboratoire de Recherche et de Développement de l'EPITA (LRDE) Ecole Pour l'Informatique et les Techniques Avancées (EPITA) Benediktsson, J.A. Chanussot, J. Najman, L. Talbot, H. Reykjavik, Iceland 2015-05-27 https://hal.archives-ouvertes.fr/hal-01168781 https://hal.archives-ouvertes.fr/hal-01168781/document https://hal.archives-ouvertes.fr/hal-01168781/file/xu.15.ismm.pdf https://doi.org/10.1007/978-3-319-18720-4_58 en eng HAL CCSD info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-18720-4_58 hal-01168781 https://hal.archives-ouvertes.fr/hal-01168781 https://hal.archives-ouvertes.fr/hal-01168781/document https://hal.archives-ouvertes.fr/hal-01168781/file/xu.15.ismm.pdf doi:10.1007/978-3-319-18720-4_58 info:eu-repo/semantics/OpenAccess Mathematical Morphology and Its Applications to Signal and Image Processing https://hal.archives-ouvertes.fr/hal-01168781 Mathematical Morphology and Its Applications to Signal and Image Processing, Benediktsson, J.A.; Chanussot, J.; Najman, L.; Talbot, H., May 2015, Reykjavik, Iceland. pp.693-704, ⟨10.1007/978-3-319-18720-4_58⟩ Min/Max-tree tree of shapes algorithm attribute saliency map [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV] info:eu-repo/semantics/conferenceObject Conference papers 2015 ftccsdartic https://doi.org/10.1007/978-3-319-18720-4_58 2021-10-24T11:52:31Z International audience Tree-based image representations are popular tools for many applications in mathematical morphology and image processing. Classically , one computes an attribute on each node of a tree and decides whether to preserve or remove some nodes upon the attribute function. This attribute function plays a key role for the good performance of tree-based applications. In this paper, we propose several algorithms to compute efficiently some attribute information. The first one is incremen-tal computation of information on region, contour, and context. Then we show how to compute efficiently extremal information along the contour (e.g., minimal gradient's magnitude along the contour). Lastly, we depict computation of extinction-based saliency map using tree-based image representations. The computation complexity and the memory cost of these algorithms are analyzed. To the best of our knowledge, except information on region, none of the other algorithms is presented explicitly in any state-of-the-art paper. Conference Object Iceland Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe) 693 704
institution Open Polar
collection Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe)
op_collection_id ftccsdartic
language English
topic Min/Max-tree
tree of shapes
algorithm
attribute
saliency map
[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]
spellingShingle Min/Max-tree
tree of shapes
algorithm
attribute
saliency map
[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]
Xu, Yongchao
Carlinet, Edwin
Géraud, Thierry
Najman, Laurent
Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations
topic_facet Min/Max-tree
tree of shapes
algorithm
attribute
saliency map
[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]
description International audience Tree-based image representations are popular tools for many applications in mathematical morphology and image processing. Classically , one computes an attribute on each node of a tree and decides whether to preserve or remove some nodes upon the attribute function. This attribute function plays a key role for the good performance of tree-based applications. In this paper, we propose several algorithms to compute efficiently some attribute information. The first one is incremen-tal computation of information on region, contour, and context. Then we show how to compute efficiently extremal information along the contour (e.g., minimal gradient's magnitude along the contour). Lastly, we depict computation of extinction-based saliency map using tree-based image representations. The computation complexity and the memory cost of these algorithms are analyzed. To the best of our knowledge, except information on region, none of the other algorithms is presented explicitly in any state-of-the-art paper.
author2 Laboratoire d'Informatique Gaspard-Monge (LIGM)
Centre National de la Recherche Scientifique (CNRS)-Fédération de Recherche Bézout-ESIEE Paris-École des Ponts ParisTech (ENPC)-Université Paris-Est Marne-la-Vallée (UPEM)
Laboratoire de Recherche et de Développement de l'EPITA (LRDE)
Ecole Pour l'Informatique et les Techniques Avancées (EPITA)
Benediktsson, J.A.
Chanussot, J.
Najman, L.
Talbot, H.
format Conference Object
author Xu, Yongchao
Carlinet, Edwin
Géraud, Thierry
Najman, Laurent
author_facet Xu, Yongchao
Carlinet, Edwin
Géraud, Thierry
Najman, Laurent
author_sort Xu, Yongchao
title Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations
title_short Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations
title_full Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations
title_fullStr Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations
title_full_unstemmed Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations
title_sort efficient computation of attributes and saliency maps on tree-based image representations
publisher HAL CCSD
publishDate 2015
url https://hal.archives-ouvertes.fr/hal-01168781
https://hal.archives-ouvertes.fr/hal-01168781/document
https://hal.archives-ouvertes.fr/hal-01168781/file/xu.15.ismm.pdf
https://doi.org/10.1007/978-3-319-18720-4_58
op_coverage Reykjavik, Iceland
genre Iceland
genre_facet Iceland
op_source Mathematical Morphology and Its Applications to Signal and Image Processing
https://hal.archives-ouvertes.fr/hal-01168781
Mathematical Morphology and Its Applications to Signal and Image Processing, Benediktsson, J.A.; Chanussot, J.; Najman, L.; Talbot, H., May 2015, Reykjavik, Iceland. pp.693-704, ⟨10.1007/978-3-319-18720-4_58⟩
op_relation info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-18720-4_58
hal-01168781
https://hal.archives-ouvertes.fr/hal-01168781
https://hal.archives-ouvertes.fr/hal-01168781/document
https://hal.archives-ouvertes.fr/hal-01168781/file/xu.15.ismm.pdf
doi:10.1007/978-3-319-18720-4_58
op_rights info:eu-repo/semantics/OpenAccess
op_doi https://doi.org/10.1007/978-3-319-18720-4_58
container_start_page 693
op_container_end_page 704
_version_ 1766040398726168576