LION
2009
Springer
14 years 6 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
LION
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Probabilistic Neural Networks (PNNs) constitute a promising methodology for classification and prediction tasks. Their performance depends heavily on several factors, su...
ICPR
2010
IEEE
14 years 6 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
0
posts
with
0
views
0
views
Homepage 3
posts
with
1535
views
1535
views
0
posts
with
0
views
0
views
CVPR
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we introduce a higher-order MRF optimization
framework. On the one hand, it is very general;
we thus use it to derive a generic optimizer that can be applied
to a...
Source Code
A library for developing portable applications that deal with networking, threads (message passing, futures, etc...), graphical interfaces, complex data structures, linear algebra,...
101
click to vote
Source Code
A C++ program that utilizes the quick and accurate implementation of the simplex method (i.e., unconstrained nonlinear optimization) using vtk 4.2.