[图书][B] Discrete calculus: Applied analysis on graphs for computational science
LJ Grady, JR Polimeni - 2010 - Springer
The field of discrete calculus, also known as" discrete exterior calculus", focuses on finding a
proper set of definitions and differential operators that make it possible to operate the …
proper set of definitions and differential operators that make it possible to operate the …
Supervised pattern classification based on optimum‐path forest
We present a supervised classification method which represents each class by one or more
optimum‐path trees rooted at some key samples, called prototypes. The training samples …
optimum‐path trees rooted at some key samples, called prototypes. The training samples …
A wrapper approach for feature selection based on bat algorithm and optimum-path forest
Besides optimizing classifier predictive performance and addressing the curse of the
dimensionality problem, feature selection techniques support a classification model as …
dimensionality problem, feature selection techniques support a classification model as …
Power watershed: A unifying graph-based optimization framework
In this work, we extend a common framework for graph-based image segmentation that
includes the graph cuts, random walker, and shortest path optimization algorithms. Viewing …
includes the graph cuts, random walker, and shortest path optimization algorithms. Viewing …
Watershed cuts: Minimum spanning forests and the drop of water principle
We study the watersheds in edge-weighted graphs. We define the watershed cuts following
the intuitive idea of drops of water flowing on a topographic surface. We first establish the …
the intuitive idea of drops of water flowing on a topographic surface. We first establish the …
Segmentation and classification of hyperspectral images using minimum spanning forest grown from automatically selected markers
Y Tarabalka, J Chanussot… - IEEE Transactions on …, 2009 - ieeexplore.ieee.org
A new method for segmentation and classification of hyperspectral images is proposed. The
method is based on the construction of a minimum spanning forest (MSF) from region …
method is based on the construction of a minimum spanning forest (MSF) from region …
ECG arrhythmia classification based on optimum-path forest
An important tool for the heart disease diagnosis is the analysis of electrocardiogram (ECG)
signals, since the non-invasive nature and simplicity of the ECG exam. According to the …
signals, since the non-invasive nature and simplicity of the ECG exam. According to the …
Watershed cuts: Thinnings, shortest path forests, and topological watersheds
We recently introduced watershed cuts, a notion of watershed in edge-weighted graphs. In
this paper, our main contribution is a thinning paradigm from which we derive three …
this paper, our main contribution is a thinning paradigm from which we derive three …
A new approach for nontechnical losses detection based on optimum-path forest
CCO Ramos, AN de Sousa, JP Papa… - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
Nowadays, fraud detection is important to avoid nontechnical energy losses. Various electric
companies around the world have been faced with such losses, mainly from industrial and …
companies around the world have been faced with such losses, mainly from industrial and …
k-core decomposition: A tool for the visualization of large scale networks
We use the k-core decomposition to visualize large scale complex networks in two
dimensions. This decomposition, based on a recursive pruning of the least connected …
dimensions. This decomposition, based on a recursive pruning of the least connected …