Sciweavers

2527 search results - page 133 / 506
» Discrete optimization in computer vision
Sort
View
ICCV
2005
IEEE
16 years 5 months ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas
ECCV
1996
Springer
16 years 5 months ago
Image Recognition with Occlusions
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-redu...
Tyng-Luh Liu, Michael J. Donahue, Davi Geiger, Rob...
ICPR
2008
IEEE
16 years 5 months ago
Combining content and structure similarity for XML document classification using composite SVM kernels
Combination of structure and content features is necessary for effective retrieval and classification of XML documents. Composite kernels provide a way for fusion of content and s...
Pabitra Mitra, Saptarshi Ghosh
ICPR
2004
IEEE
16 years 4 months ago
Segmentation and Classification of Meeting Events using Multiple Classifier Fusion and Dynamic Programming
In this paper the segmentation of a meeting into meeting events is investigated as well as the recognition of the detected segments. First the classification of a meeting event is...
Gerhard Rigoll, Stephan Reiter
ICPR
2008
IEEE
15 years 10 months ago
Improving Bayesian Network parameter learning using constraints
This paper describes a new approach to unify constraints on parameters with training data to perform parameter estimation in Bayesian networks of known structure. The method is ge...
Cassio Polpo de Campos, Qiang Ji