2019
DOI: 10.5802/smai-jcm.55
|View full text |Cite
|
Sign up to set email alerts
|

Partial differential equations and variational methods for geometric processing of images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 65 publications
0
1
0
Order By: Relevance
“…Finite graphs and networks have been widely and successfully used in a variety of fields such as machine learning, data mining, image analysis and social sciences where one is facing analysis and modelling of high dimensional unstructured datasets. In this context, extending the models and methods from variational methods and PDEs to solve problems on graphs is an active research area; see [40,8,21,22] and references therein. Many of these problems, such as classification, clustering or segmentation, can be often formulated in terms of minimizing a graph perimeter (graph cut) or a related functional (normalized cut, ratio cut, balanced cut, etc.).…”
Section: Introductionmentioning
confidence: 99%
“…Finite graphs and networks have been widely and successfully used in a variety of fields such as machine learning, data mining, image analysis and social sciences where one is facing analysis and modelling of high dimensional unstructured datasets. In this context, extending the models and methods from variational methods and PDEs to solve problems on graphs is an active research area; see [40,8,21,22] and references therein. Many of these problems, such as classification, clustering or segmentation, can be often formulated in terms of minimizing a graph perimeter (graph cut) or a related functional (normalized cut, ratio cut, balanced cut, etc.).…”
Section: Introductionmentioning
confidence: 99%