Difference between revisions of "Publications/xu.15.ismm"

From LRDE

(Created page with "{{Publication | published = true | date = 2015-04-07 | authors = Yongchao Xu, Edwin Carlinet, Thierry Géraud, Laurent Najman | title = Efficient Computation of Attributes and...")
 
 
(9 intermediate revisions by the same user not shown)
Line 4: Line 4:
 
| authors = Yongchao Xu, Edwin Carlinet, Thierry Géraud, Laurent Najman
  
| authors = Yongchao Xu, Edwin Carlinet, Thierry Géraud, Laurent Najman
 
| title = Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations
  
| title = Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations
−
| booktitle = Mathematical Morphology and Its Application to Signal and Image Processing -- Proceedings of the 12th International Symposium on Mathematical Morphology (ISMM)
 +
| booktitle = Mathematical Morphology and Its Application to Signal and Image Processing – Proceedings of the 12th International Symposium on Mathematical Morphology (ISMM)
−
| optseries = Lecture Notes in Computer Science Series
 +
| series = Lecture Notes in Computer Science Series
  +
| volume = 9082
 
| address = Reykjavik, Iceland
  
| address = Reykjavik, Iceland
−
| optpublisher = Springer
 +
| publisher = Springer
  +
| editors = J A Benediktsson, J Chanussot, L Najman, H Talbot
−
| optpages = 00--00
  
−
| project = Image
 +
| pages = 693 to 704
  +
| lrdeprojects = Olena
−
| urllrde = 201503-ISMMc
  
−
| abstract = 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 incremental computation of information on region, contour, and context. Then we show how to compute efficiently extremal information along the contour (eg, 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 knowledgeexcept information on region, none of the other algorithms is presented explicitly in any state-of-the-art paper.
 +
| abstract = 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 incremental 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 knowledgeexcept information on region, none of the other algorithms is presented explicitly in any state-of-the-art paper.
 
| lrdepaper = http://www.lrde.epita.fr/dload/papers/xu.15.ismm.pdf
  
| lrdepaper = http://www.lrde.epita.fr/dload/papers/xu.15.ismm.pdf
 
| lrdekeywords = Image
  
| lrdekeywords = Image
Line 17: Line 18:
 
| type = inproceedings
  
| type = inproceedings
 
| id = xu.15.ismm
  
| id = xu.15.ismm
  +
| identifier = doi:10.1007/978-3-319-18720-4_58
 
| bibtex =
 
| bibtex =
 
@InProceedings<nowiki>{</nowiki> xu.15.ismm,
  
@InProceedings<nowiki>{</nowiki> xu.15.ismm,
Line 27: Line 29:
 
Symposium on Mathematical Morphology (ISMM)<nowiki>}</nowiki>,
  
Symposium on Mathematical Morphology (ISMM)<nowiki>}</nowiki>,
 
year = <nowiki>{</nowiki>2015<nowiki>}</nowiki>,
  
year = <nowiki>{</nowiki>2015<nowiki>}</nowiki>,
−
optseries = <nowiki>{</nowiki>Lecture Notes in Computer Science Series<nowiki>}</nowiki>,
 +
series = <nowiki>{</nowiki>Lecture Notes in Computer Science Series<nowiki>}</nowiki>,
  +
volume = <nowiki>{</nowiki>9082<nowiki>}</nowiki>,
 
address = <nowiki>{</nowiki>Reykjavik, Iceland<nowiki>}</nowiki>,
  
address = <nowiki>{</nowiki>Reykjavik, Iceland<nowiki>}</nowiki>,
−
optpublisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>,
 +
publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>,
−
optpages = <nowiki>{</nowiki>00--00<nowiki>}</nowiki>,
 +
editor = <nowiki>{</nowiki>J.A. Benediktsson and J. Chanussot and L. Najman and H.
−
project = <nowiki>{</nowiki>Image<nowiki>}</nowiki>,
 +
Talbot<nowiki>}</nowiki>,
  +
pages = <nowiki>{</nowiki>693--704<nowiki>}</nowiki>,
 
abstract = <nowiki>{</nowiki>Tree-based image representations are popular tools for
  
abstract = <nowiki>{</nowiki>Tree-based image representations are popular tools for
 
many applications in mathematical morphology and image
  
many applications in mathematical morphology and image
Line 43: Line 47:
 
information on region, contour, and context. Then we show
  
information on region, contour, and context. Then we show
 
how to compute efficiently extremal information along the
  
how to compute efficiently extremal information along the
−
contour (\eg, minimal gradient's magnitude along the
 +
contour (e.g., minimal gradient's magnitude along the
 
contour). Lastly, we depict computation of extinction-based
  
contour). Lastly, we depict computation of extinction-based
 
saliency map using tree-based image representations. The
  
saliency map using tree-based image representations. The
Line 49: Line 53:
 
algorithms are analyzed. To the best of our knowledge,
  
algorithms are analyzed. To the best of our knowledge,
 
except information on region, none of the other algorithms
  
except information on region, none of the other algorithms
−
is presented explicitly in any state-of-the-art paper.<nowiki>}</nowiki>
 +
is presented explicitly in any state-of-the-art paper.<nowiki>}</nowiki>,
  +
doi = <nowiki>{</nowiki>10.1007/978-3-319-18720-4_58<nowiki>}</nowiki>
 
<nowiki>}</nowiki>
  
<nowiki>}</nowiki>
   

Latest revision as of 17:02, 27 May 2021

Authors
Yongchao Xu, Edwin Carlinet, Thierry Géraud, Laurent Najman
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

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 incremental 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 knowledgeexcept information on region, none of the other algorithms is presented explicitly in any state-of-the-art paper.

Documents

Bibtex (lrde.bib)

@InProceedings{	  xu.15.ismm,
  author	= {Yongchao Xu and Edwin Carlinet and Thierry G\'eraud and
		  Laurent Najman},
  title		= {Efficient Computation of Attributes and Saliency Maps on
		  Tree-Based Image Representations},
  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		= {693--704},
  abstract	= {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 incremental 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.},
  doi		= {10.1007/978-3-319-18720-4_58}
}





Retrieved from "https://www.lrde.epita.fr/index.php?title=Publications/xu.15.ismm&oldid=126459"