Inference on highly-connected discrete graphical models with applications to visual object recognition
From MaRDI portal
Bayesian inference (62F15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45) Mixed integer programming (90C11)
Recommendations
- (Hyper-)graphs inference through convex relaxations and move making algorithms: contributions and applications in artificial vision
- Discrete graphical models -- an optimization perspective
- \(\mathrm{AD}^3\): alternating directions dual decomposition for MAP inference in graphical models
- Exact solutions for discrete graphical models. Multicuts and reduction techniques
- Inference and learning with hierarchical shape models
Cited in
(5)- Contextual hierarchical part-driven conditional random field model for object category detection
- Discrete graphical models -- an optimization perspective
- A survey on learning approaches for undirected graphical models. Application to scene object recognition
- Common object discovery as local search for maximum weight cliques in a global object similarity graph
- (Hyper-)graphs inference through convex relaxations and move making algorithms: contributions and applications in artificial vision
This page was built for publication: Inference on highly-connected discrete graphical models with applications to visual object recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100907)
