Labeling hypergraph-structured data using markov network
Explore this paper's citation graph
Summary
This dissertation proposes a novel labeling algorithm by modeling the datapoints as nodes of a higher order Markov Network and describes how a parametric form of the proposed clique function can be learned from labeled data.
- Published
- 2011-01-01
- Cited by
- 0
- References
- 125
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:59696341
References
- Multiple View Geometry in Computer Vision
- Online bagging and boosting
- Soft Margins for AdaBoost
- Bayesian Model Estimation and Selection for Epipolar Geometry and Generic Manifold Fitting
- Introduction to Statistical Relational Learning
- Submodular functions and optimization
- Markov Random Field Modeling in Image Analysis
- Hypergraph Cuts & Unsupervised Representation for Image Segmentation
- A tensor-based algorithm for high-order graph matching
- Feature-based correspondence: an eigenvector approach
- Boosting the margin: A new explanation for the effectiveness of voting methods
- Shape-Based Object Localization for Descriptive Classification
- The Elements of Statistical Learning: Data Mining, Inference, and Prediction
- A decision-theoretic generalization of on-line learning and an application to boosting
- Robust car tracking using Kalman filtering and Bayesian templates
- Performance Evaluation of RANSAC Family
- Improved Boosting Algorithms Using Confidence-rated Predictions
- One-shot multi-set non-rigid feature-spatial matching
- MLESAC: A New Robust Estimator with Application to Estimating Image Geometry
- CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
Cited by
No citing papers recorded for this paper.
Related papers
No related papers recorded.