Sciweavers

610 search results - page 62 / 122
» Markov Random Topic Fields
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Granularity and elasticity adaptation in visual tracking
The observation models in tracking algorithms are critical to both tracking performance and applicable scenarios but are often simplified to focus on fixed level of certain target...
Ming Yang, Ying Wu
ICIP
2008
IEEE
14 years 9 months ago
Implicit spatial inference with sparse local features
This paper introduces a novel way to leverage the implicit geometry of sparse local features (e.g. SIFT operator) for the purposes of object detection and segmentation. A two-clas...
Deirdre O'Regan, Anil C. Kokaram
MICCAI
2002
Springer
14 years 8 months ago
Recognizing Deviations from Normalcy for Brain Tumor Segmentation
A framework is proposed for the segmentation of brain tumors from MRI. Instead of training on pathology, the proposed method trains exclusively on healthy tissue. The algorithm att...
David T. Gering, W. Eric L. Grimson, Ron Kikinis
ICML
2009
IEEE
14 years 8 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
PAMI
2007
176views more  PAMI 2007»
13 years 7 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas