Modern regularization methods for inverse problems
Regularization methods are a key tool in the solution of inverse problems. They are used to
introduce prior knowledge and allow a robust approximation of ill-posed (pseudo-) inverses …
introduce prior knowledge and allow a robust approximation of ill-posed (pseudo-) inverses …
[LIVRO][B] Modern algorithms of cluster analysis
ST Wierzchoń, MA Kłopotek - 2018 - Springer
This chapter characterises the scope of this book. It explains the reasons why one should be
interested in cluster analysis, lists major application areas, basic theoretical and practical …
interested in cluster analysis, lists major application areas, basic theoretical and practical …
Hodge Laplacians on graphs
LH Lim - Siam Review, 2020 - SIAM
This is an elementary introduction to the Hodge Laplacian on a graph, a higher-order
generalization of the graph Laplacian. We will discuss basic properties including …
generalization of the graph Laplacian. We will discuss basic properties including …
Aesthetic preference for art can be predicted from a mixture of low-and high-level visual features
It is an open question whether preferences for visual art can be lawfully predicted from the
basic constituent elements of a visual image. Here, we developed and tested a …
basic constituent elements of a visual image. Here, we developed and tested a …
Neural mechanisms underlying the hierarchical construction of perceived aesthetic value
Little is known about how the brain computes the perceived aesthetic value of complex
stimuli such as visual art. Here, we used computational methods in combination with …
stimuli such as visual art. Here, we used computational methods in combination with …
Diffuse interface models on graphs for classification of high dimensional data
There are currently several communities working on algorithms for classification of high
dimensional data. This work develops a class of variational algorithms that combine recent …
dimensional data. This work develops a class of variational algorithms that combine recent …
The total variation on hypergraphs-learning on hypergraphs revisited
Hypergraphs allow to encode higher-order relationships in data and are thus a very flexible
modeling tool. Current learning methods are either based on approximations of the …
modeling tool. Current learning methods are either based on approximations of the …
On the graph Fourier transform for directed graphs
The analysis of signals defined over a graph is relevant in many applications, such as social
and economic networks, big data or biological networks, and so on. A key tool for analyzing …
and economic networks, big data or biological networks, and so on. A key tool for analyzing …
Submodular hypergraphs: p-laplacians, cheeger inequalities and spectral clustering
We introduce submodular hypergraphs, a family of hypergraphs that have different
submodular weights associated with different cuts of hyperedges. Submodular hypergraphs …
submodular weights associated with different cuts of hyperedges. Submodular hypergraphs …
On the -Laplacian and -Laplacian on Graphs with Applications in Image and Data Processing
In this paper we introduce a new family of partial difference operators on graphs and study
equations involving these operators. This family covers local variational p-Laplacian, ∞ …
equations involving these operators. This family covers local variational p-Laplacian, ∞ …