Sciweavers

741 search results - page 47 / 149
» A Markov random field model for term dependencies
Sort
View
IROS
2009
IEEE
200views Robotics» more  IROS 2009»
15 years 4 months ago
Fast geometric point labeling using conditional random fields
— In this paper we present a new approach for labeling 3D points with different geometric surface primitives using a novel feature descriptor – the Fast Point Feature Histogram...
Radu Bogdan Rusu, Andreas Holzbach, Nico Blodow, M...
CVPR
2004
IEEE
15 years 11 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
TSP
2011
170views more  TSP 2011»
14 years 4 months ago
Model Selection for Sinusoids in Noise: Statistical Analysis and a New Penalty Term
—Detection of the number of sinusoids embedded in noise is a fundamental problem in statistical signal processing. Most parametric methods minimize the sum of a data fit (likeli...
Boaz Nadler, Leonid Kontorovich
ICCV
2011
IEEE
13 years 9 months ago
Are Spatial and Global Constraints Really Necessary for Segmentation?
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
Aurelien Lucchi, Yunpeng Li, Xavier Boix, Kevin Sm...
IJCAI
2007
14 years 11 months ago
Document Summarization Using Conditional Random Fields
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task ...
Dou Shen, Jian-Tao Sun, Hua Li, Qiang Yang, Zheng ...