Difference between revisions of "Publications/xu.15.pami"
From LRDE
(7 intermediate revisions by the same user not shown) | |||
Line 5: | Line 5: | ||
| title = Connected Filtering on Tree-Based Shape-Spaces |
| title = Connected Filtering on Tree-Based Shape-Spaces |
||
| journal = IEEE Transactions on Pattern Analysis and Machine Intelligence |
| journal = IEEE Transactions on Pattern Analysis and Machine Intelligence |
||
− | | volume = |
+ | | volume = 38 |
− | | number = |
+ | | number = 6 |
− | | pages = |
+ | | pages = 1126 to 1140 |
− | | |
+ | | lrdeprojects = Olena |
− | | abstract = Connected filters are well-known for their good contour preservation property. A popular implementation strategy relies on tree-based image representations: for exampleone can compute an attribute characterizing the connected component represented by each node of the tree and keep only the nodes for which the attribute is sufficiently high. This operation can be seen as a thresholding of the tree, seen as a graph whose nodes are weighted by the attribute. |
+ | | abstract = Connected filters are well-known for their good contour preservation property. A popular implementation strategy relies on tree-based image representations: for exampleone can compute an attribute characterizing the connected component represented by each node of the tree and keep only the nodes for which the attribute is sufficiently high. This operation can be seen as a thresholding of the tree, seen as a graph whose nodes are weighted by the attribute. Rather than being satisfied with a mere thresholding, we propose to expand on this idea, and to apply connected filters on this latest graph. Consequentlythe filtering is performed not in the space of the imagebut in the space of shapes built from the image. Such a processing of shape-space filtering is a generalization of the existing tree-based connected operators. Indeed, the framework includes the classical existing connected operators by attributes. It also allows us to propose a class of novel connected operators from the leveling family, based on non-increasing attributes. Finally, we also propose a new class of connected operators that we call morphological em shapings. Some illustrations and quantitative evaluations demonstrate the usefulness and robustness of the proposed shape-space filters. |
− | | urllrde = 201506-PAMI |
||
− | | note = To appear |
||
| lrdepaper = http://www.lrde.epita.fr/dload/papers/xu.15.pami.pdf |
| lrdepaper = http://www.lrde.epita.fr/dload/papers/xu.15.pami.pdf |
||
| lrdekeywords = Image |
| lrdekeywords = Image |
||
Line 17: | Line 15: | ||
| type = article |
| type = article |
||
| id = xu.15.pami |
| id = xu.15.pami |
||
+ | | identifier = doi:10.1109/TPAMI.2015.2441070 |
||
| bibtex = |
| bibtex = |
||
@Article<nowiki>{</nowiki> xu.15.pami, |
@Article<nowiki>{</nowiki> xu.15.pami, |
||
Line 23: | Line 22: | ||
journal = <nowiki>{</nowiki>IEEE Transactions on Pattern Analysis and Machine |
journal = <nowiki>{</nowiki>IEEE Transactions on Pattern Analysis and Machine |
||
Intelligence<nowiki>}</nowiki>, |
Intelligence<nowiki>}</nowiki>, |
||
− | year = <nowiki>{</nowiki> |
+ | year = <nowiki>{</nowiki>2016<nowiki>}</nowiki>, |
− | volume = <nowiki>{</nowiki> |
+ | volume = <nowiki>{</nowiki>38<nowiki>}</nowiki>, |
− | number = <nowiki>{</nowiki> |
+ | number = <nowiki>{</nowiki>6<nowiki>}</nowiki>, |
− | pages = <nowiki>{</nowiki> |
+ | pages = <nowiki>{</nowiki>1126--1140<nowiki>}</nowiki>, |
− | month = |
+ | month = jun, |
− | + | doi = <nowiki>{</nowiki>10.1109/TPAMI.2015.2441070<nowiki>}</nowiki>, |
|
abstract = <nowiki>{</nowiki>Connected filters are well-known for their good contour |
abstract = <nowiki>{</nowiki>Connected filters are well-known for their good contour |
||
preservation property. A popular implementation strategy |
preservation property. A popular implementation strategy |
||
Line 51: | Line 50: | ||
call morphological <nowiki>{</nowiki>\em shapings<nowiki>}</nowiki>. Some illustrations and |
call morphological <nowiki>{</nowiki>\em shapings<nowiki>}</nowiki>. Some illustrations and |
||
quantitative evaluations demonstrate the usefulness and |
quantitative evaluations demonstrate the usefulness and |
||
− | robustness of the proposed shape-space filters.<nowiki>}</nowiki> |
+ | robustness of the proposed shape-space filters.<nowiki>}</nowiki> |
− | note = <nowiki>{</nowiki>To appear<nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 13:43, 24 November 2020
- Authors
- Yongchao Xu, Thierry Géraud, Laurent Najman
- Journal
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Type
- article
- Projects
- Olena
- Keywords
- Image
- Date
- 2015-06-05
Abstract
Connected filters are well-known for their good contour preservation property. A popular implementation strategy relies on tree-based image representations: for exampleone can compute an attribute characterizing the connected component represented by each node of the tree and keep only the nodes for which the attribute is sufficiently high. This operation can be seen as a thresholding of the tree, seen as a graph whose nodes are weighted by the attribute. Rather than being satisfied with a mere thresholding, we propose to expand on this idea, and to apply connected filters on this latest graph. Consequentlythe filtering is performed not in the space of the imagebut in the space of shapes built from the image. Such a processing of shape-space filtering is a generalization of the existing tree-based connected operators. Indeed, the framework includes the classical existing connected operators by attributes. It also allows us to propose a class of novel connected operators from the leveling family, based on non-increasing attributes. Finally, we also propose a new class of connected operators that we call morphological em shapings. Some illustrations and quantitative evaluations demonstrate the usefulness and robustness of the proposed shape-space filters.
Documents
Bibtex (lrde.bib)
@Article{ xu.15.pami, author = {Yongchao Xu and Thierry G\'eraud and Laurent Najman}, title = {Connected Filtering on Tree-Based Shape-Spaces}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, year = {2016}, volume = {38}, number = {6}, pages = {1126--1140}, month = jun, doi = {10.1109/TPAMI.2015.2441070}, abstract = {Connected filters are well-known for their good contour preservation property. A popular implementation strategy relies on tree-based image representations: for example, one can compute an attribute characterizing the connected component represented by each node of the tree and keep only the nodes for which the attribute is sufficiently high. This operation can be seen as a thresholding of the tree, seen as a graph whose nodes are weighted by the attribute. Rather than being satisfied with a mere thresholding, we propose to expand on this idea, and to apply connected filters on this latest graph. Consequently, the filtering is performed not in the space of the image, but in the space of shapes built from the image. Such a processing of shape-space filtering is a generalization of the existing tree-based connected operators. Indeed, the framework includes the classical existing connected operators by attributes. It also allows us to propose a class of novel connected operators from the leveling family, based on non-increasing attributes. Finally, we also propose a new class of connected operators that we call morphological {\em shapings}. Some illustrations and quantitative evaluations demonstrate the usefulness and robustness of the proposed shape-space filters.} }